Abstract
The reduced implicate trie, introduced in [10], is a data structure that may be used as a target language for knowledge compilation. It has the property that a query can be processed in time linear in the size of the query, regardless of the size of the compiled knowledge base. This data structure can be used with propositional databases, where a query amounts to asking whether a clause is an implicate of a logical formula. In this paper, reduced implicant tries are investigated, and the dual question is addressed: determining the implicants of a formula. The main result is that a single trie — the reduced implicate/implicant trie, with a structure that is similar to that of reduced implicate tries — can serve dual roles, representing both implicates and implicants. As a result, there can be significant savings in both time and space.
This research was supported in part by the National Science Foundation under grants IIS-0712849 and IIS-0712752.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bryant, R.E.: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Comput. Surv. 24(3), 293–318 (1992)
Cadoli, M., Donini, F.M.: A survey on knowledge compilation. AI Commun. 10, 137–150 (1997)
Darwiche, A.: Compiling devices: A structure-based approach. In: Proc. Int’l Conf. on Principles of Knowledge Representation and Reasoning (KR 1998), pp. 156–166. Morgan-Kaufmann, San Francisco (1998)
Darwiche, A.: Decomposable negation normal form. J. ACM 48(4), 608–647 (2001)
Forbus, K.D., de Kleer, J.: Building Problem Solvers. MIT Press, Cambridge, Mass (1993)
Hähnle, R., Murray, N.V., Rosenthal, E.: Normal Forms for Knowledge Compilation. In: Ras, Z. (ed.) Proceedings of the International Symposium on Methodologies for Intelligent Systems, ISMIS 2005. LNCS, Springer, Heidelberg (to appear, 2005)
Hai, L., Jigui, S.: Knowledge compilation using the extension rule. J. Automated Reasoning 32(2), 93–102 (2004)
Kautz, H., Selman, B.: A general framework for knowledge compilation. In: Boley, H., Richter, M.M. (eds.) PDK 1991. LNCS, vol. 567, Springer, Heidelberg (1991)
Marquis, P.: Knowledge compilation using theory prime implicates. In: Proc. Int’l Joint Conf. on Artificial Intelligence (IJCAI), pp. 837–843. Morgan-Kaufmann, San Mateo, Calif (1995)
Murray, N.V., Rosenthal, E.: Efficient query processing with compiled knowledge bases. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS (LNAI), vol. 3702, pp. 231–244. Springer, Heidelberg (2005)
Murray, N.V., Rosenthal, E.: Efficient query processing with reduced implicate tries. Journal of Automated Reasoning 38(1-3) (2207), 155–172
Murray, N.V., Rosenthal, E.: Linear response time for implicate and implicant queries. Technical Report SUNYA-CS-08-01, Department of Computer Science, University at Albany - SUNY (January 2008), Download in pdf at: http://www.cs.albany.edu/~nvm/ritries/papers.html
Ramesh, A., Murray, N.V.: An application of non-clausal deduction in diagnosis. Expert Systems with Applications 12(1), 119–126 (1997)
Reiter, R., de Kleer, J.: Foundations of assumption-based truth maintenance systems: preliminary report. In: Proceedings of the 6th National Conference on Artificial Intelligence, Seattle, WA, July 12-17, pp. 183–188 (1987)
Selman, B., Kautz, H.: Knowledge compilation and theory approximation. J. ACM 43(2), 193–224 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murray, N.V., Rosenthal, E. (2008). Reduced Implicate/Implicant Tries. In: An, A., Matwin, S., Raś, Z.W., Ślęzak, D. (eds) Foundations of Intelligent Systems. ISMIS 2008. Lecture Notes in Computer Science(), vol 4994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68123-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-68123-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68122-9
Online ISBN: 978-3-540-68123-6
eBook Packages: Computer ScienceComputer Science (R0)