article

A survey on knowledge compilation

Authors:

Francesco M. DoniniAuthors Info & Claims

AI Communications, Volume 10, Issue 3,4

Pages 137 - 150

Published: 01 December 1997 Publication History

Abstract

Knowledge compilation is an AI technique for addressing computationally demanding reasoning problems. In this paper we survey recent results in knowledge compilation of propositional knowledge bases. We first define and limit the scope of such a technique, then we survey exact and approximate knowledge compilation methods. We include a discussion of compilation for non‐monotonic knowledge bases.

References

[1]

{1} O.L. Astrachan and M.E. Stickel, Caching and lemmaizing in model elimination theorem provers, in: Proc. of the Eleventh International Conference on Automated Deduction (CADE- 92), 1992, pp. 224-238.

[2]

{2} R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs, Annals of Mathematics and Artificial Intelligence 12 (1994), 53-87.

[3]

{3} R. Ben-Eliyahu and R. Dechter, Default reasoning using classical logic, Artificial Intelligence Journal 84(1-2) (1996), 113-150.

Digital Library

[4]

{4} A. Borgida, R.J. Brachman, D.W. Etherington and H.A. Kautz, Vivid knowledge and tractable reasoning: Preliminary report, in: Proc. of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89), 1989, pp. 1146-1152.

[5]

{5} Y. Boufkhad, É. Grégoire, P. Marquis, B. Mazure and L. Saïs, Tractable cover compilations, in: Proc. of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI- 97), 1997, pp. 122-127.

[6]

{6} M. Cadoli, Semantical and computational aspects of Horn approximations, in: Proc. of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), 1993, pp. 39-44.

[7]

{7} M. Cadoli, F.M. Donini, P. Liberatore and M. Schaerf, The size of a revised knowledge base, in: Proc. of the Fourteenth ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems (PODS-95), 1995, pp. 151-162. Extended version available as Technical Report DIS 34-96, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", November, 1996.

[8]

{8} M. Cadoli, F.M. Donini and M. Schaerf, Is intractability of non-monotonic reasoning a real drawback? Artificial Intelligence Journal 88(1-2) (1996), 215-251.

Digital Library

[9]

{9} M. Cadoli, F.M. Donini, M. Schaerf and R. Silvestri, On compact representations of propositional circumscription, Theoretical Computer Science 182 (1997), 183-202.

Digital Library

[10]

{10} M. Cadoli, F.M. Donini, P. Liberatore and M. Schaerf, Pre-processing of intractable problems. Technical Report DIS 24- 97, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", November, 1997.

[11]

{11} M. Cadoli and M. Schaerf, A survey of complexity results for non-monotonic logics, Journal of Logic Programming 17 (1993), 127-160.

[12]

{12} T. Castell and M. Cayrol, Computation of prime implicates and prime implicants by the Davis and Putnam procedure, in: Workshop on "Advances in Propositional Deduction", held at ECAI-96, 1996, pp. 61-64.

[13]

{13} A.K. Chandra and G. Markowsky, On the number of prime implicants, Discrete Mathematics 24 (1978), 7-11.

Digital Library

[14]

{14} J. de Kleer, An improved incremental algorithm for generating prime implicates, in: Proc. of the Tenth National Conference on Artificial Intelligence (AAAI-92), 1992, pp. 780- 785.

[15]

{15} R. Dechter and I. Rish, Directional resolution: The Davis-Putnam procedure, revisited, in: Proc. of the Fourth International Conference on the Principles of Knowledge Representation and Reasoning (KR-94), 1994, pp. 134-145.

[16]

{16} A. del Val, Tractable databases: How to make propositional unit resolution complete through compilation, in: Proc. of the Fourth International Conference on the Principles of Knowledge Representation and Reasoning (KR-94), 1994, pp. 551- 561.

[17]

{17} A. del Val, An analysis of approximate knowledge compilation, in: Proc. of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 1995, pp. 830- 836.

[18]

{18} A. del Val, Approximate knowledge compilation: The first order case, in: Proc. of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 498-503.

[19]

{19} P. Doherty, W. Lukaszewicz and A. Szalas, Computing circumscription revisited: A reduction algorithm, in: Proc. of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 1995, pp. 1502-1508.

[20]

{20} R.G. Downey and M.F. Fellows, Fixed-parameter tractability and completeness: Basic results, SIAM Journal on Computing 24(4) (1995), 873-921.

Digital Library

[21]

{21} R.G. Downey and M.F. Fellows, Parameterized complexity, February 1995. Manuscript, 411 p. To appear by Springer-Verlag Monography in Theoretical Computer Science, 1998.

[22]

{22} T. Eiter and G. Gottlob, On the complexity of propositional knowledge base revision, updates and conterfactuals, Artificial Intelligence Journal 57 (1992), 227-270.

Digital Library

[23]

{23} T. Eiter and G. Gottlob, Propositional circumscription and extended closed world reasoning are II ₂ ^p -complete, Theoretical Computer Science 114 (1993), 231-245.

[24]

{24} M. Fitting, First-Order Logic and Automated Theorem Proving , 2nd edn, Springer-Verlag, 1996.

[25]

{25} M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, CA, 1979.

Digital Library

[26]

{26} M. Gelfond, H. Przymusinska and T. Przymusinsky, On the relationship between circumscription and negation as failure, Artificial Intelligence Journal 38 (1989), 49-73.

Digital Library

[27]

{27} G. Gogic, H.A. Kautz, C. Papadimitriou and B. Selman, The comparative linguistics of knowledge representation, in: Proc. of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 1995, pp. 862-869.

[28]

{28} G. Gogic, C. Papadimitriou and M. Sideri, Incremental recompilation of knowledge, in: Proc. of the Twelfth National Conference on Artificial Intelligence (AAAI-94), 1994, pp. 922-927.

Digital Library

[29]

{29} G. Gottlob, Complexity results for nonmonotonic logics, Journal of Logic and Computation 2 (1992), 397-425.

[30]

{30} P.L. Hammer and A. Kogan, Horn functions and their DNFs, Information Processing Letters 44 (1992), 23-29.

Digital Library

[31]

{31} P.L. Hammer and A. Kogan, Optimal compression of propositional Horn knowledge bases: Complexity and approximation, Artificial Intelligence Journal 64 (1993), 131-145.

[32]

{32} T. Hogg, B.A. Hubermann and C.P. Williams, eds, Special volume on frontiers of problem solving: Phase transitions and complexity, Artificial Intelligence Journal 81, (1996).

[33]

{33} P. Jackson and J. Pais, Computing prime implicants, in: Proc. of the Tenth International Conference on Automated Deduction (CADE-90), 1990, pp. 543-557.

[34]

{34} H.A. Kautz and B. Selman, Forming concepts for fast inference, in: Proc. of the Tenth National Conference on Artificial Intelligence (AAAI-92), 1992, pp. 786-793.

Digital Library

[35]

{35} R. Khardon and D. Roth, Reasoning with models, Artificial Intelligence Journal 87 (1996), 187-213.

Digital Library

[36]

{36} H.J. Levesque, Making believers out of computers, Artificial Intelligence Journal 30 (1986), 81-108.

Digital Library

[37]

{37} V. Lifschitz, Computing circumscription, in: Proc. of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85), 1985, pp. 121-127.

[38]

{38} J.C. Madre and O. Coudert, A logically complete reasoning maintenance system based on a logical constraint solver, in: Proc. of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), 1991, pp. 294-299.

[39]

{39} P. Marquis, Knowledge compilation using theory prime implicates, in: Proc. of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), 1995, pp. 837- 843.

[40]

{40} P. Marquis and S. Sadaoui, A new algorithm for computing theory prime implicates compilations, in: Proc. of the Thirteenth National Conference on Artificial Intelligence (AAAI- 96), 1996, pp. 504-509.

Digital Library

[41]

{41} P. Mathieu and J.-P. Delahaye, A kind of logical compilation for knowledge bases, Theoretical Computer Science 131 (1994), 197-218.

Digital Library

[42]

{42} J. McCarthy, Circumscription - A form of nonmonotonic reasoning, Artificial Intelligence Journal 13 (1980), 27-39.

Digital Library

[43]

{43} Y. Moses and M. Tennenholtz, Off-line reasoning for on-line efficiency: knowledge bases, Artificial Intelligence Journal 83 (1996), 229-239.

Digital Library

[44]

{44} A. Nerode, R.T. Ng and V.S. Subrahmanian, Computing circumscriptive databases. I: Theory and algorithms, Information and Computation 116 (1995), 58-80.

[45]

{45} T.-H. Ngair, A new algorithm for incremental prime implicate generation, in: Proc. of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), 1993, pp. 46-51.

[46]

{46} C.H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.

[47]

{47} R. Reiter, A logic for default reasoning, Artificial Intelligence Journal 13 (1980), 81-132.

Digital Library

[48]

{48} R. Reiter and J. de Kleer, Foundations of assumption-based truth maintenace systems: Preliminary report, in: Proc. of the Sixth National Conference on Artificial Intelligence (AAAI-87), 1987, pp. 183-188.

[49]

{49} R. Schrag, Compilation for critically constrained knowledge bases, in: Proc. of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), 1996, pp. 510-515.

[50]

{50} R. Schrag and J. Crawford, Implicates and prime implicates in random 3SAT, Artificial Intelligence Journal 81 (1996), 199-222.

[51]

{51} B. Selman and H.A. Kautz, Knowledge compilation using Horn approximations, in: Proc. of the Ninth National Conference on Artificial Intelligence (AAAI-91), 1991, pp. 904- 909.

Digital Library

[52]

{52} B. Selman and H.A. Kautz, Knowledge compilation and theory approximation, Journal of the ACM 43 (1996), 193-224.

Digital Library

[53]

{53} B. Selman, D.G. Mitchell and H.J. Levesque, Generating hard satisfiability problems, Artificial Intelligence Journal 81 (1996), 17-30.

Digital Library

[54]

{54} J.R. Slagle, C.L. Chang and R.C.T. Lee, A new algorithm for generating prime implicants, IEEE Trans. Comput. 19(4) (1970), 304-310.

Digital Library

[55]

{55} P. Tison, Generalized consensus theory and application to the minimization of boolean functions, IEEE Trans. Electronic Comput. 4 (1967), 446-456.

[56]

{56} M. Winslett, Updating Logical Databases, Cambridge University Press, 1990.

Cited By

Dubslaff CHusung NKäfer N(2024)Configuring BDD Compilation Techniques for Feature ModelsProceedings of the 28th ACM International Systems and Software Product Line Conference10.1145/3646548.3676538(209-216)Online publication date: 2-Sep-2024
https://dl.acm.org/doi/10.1145/3646548.3676538
Darwiche AMarquis P(2024)Knowledge compilationAnnals of Mathematics and Artificial Intelligence10.1007/s10472-024-09942-w92:5(1007-1011)Online publication date: 17-May-2024
https://dl.acm.org/doi/10.1007/s10472-024-09942-w
Salhi YSioutis M(2024)Compact Solution Representation in Qualitative Constraint-Based ReasoningScalable Uncertainty Management10.1007/978-3-031-76235-2_31(421-428)Online publication date: 28-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-76235-2_31
Show More Cited By

A survey on knowledge compilation

Recommendations

Acquiring Knowledge in Extended Hierarchical Censored Production Rules (EHCPRS) System

EHCPRs system is a knowledge representation and reasoning system for representing common sense knowledge and reasoning with it. In such a system an EHCPR is used as a unit of knowledge for representing any universal concept. There are a number of EHCPRs ...
Disjunctive closures for knowledge compilation

The knowledge compilation (KC) map [1] can be viewed as a multi-criteria evaluation of a number of target classes of representations for propositional KC. Using this map, the choice of a class for a given application can be made, considering both the ...
On a Novel Cognitive Knowledge Base CKB for Cognitive Robots and Machine Learning

A cognitive knowledge base CKB is a novel structure of intelligent knowledge base that represents and manipulates knowledge as a dynamic concept network mimicking human knowledge processing. The essence of CKB is the denotational mathematical model of ...

Comments

Information & Contributors

Information

Published In

cover image AI Communications

AI Communications Volume 10, Issue 3,4

December 1997

76 pages

ISSN:0921-7126

Issue’s Table of Contents

Publisher

IOS Press

Netherlands

Publication History

Published: 01 December 1997

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

83
Total Citations
View Citations
9
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dubslaff CHusung NKäfer N(2024)Configuring BDD Compilation Techniques for Feature ModelsProceedings of the 28th ACM International Systems and Software Product Line Conference10.1145/3646548.3676538(209-216)Online publication date: 2-Sep-2024
https://dl.acm.org/doi/10.1145/3646548.3676538
Darwiche AMarquis P(2024)Knowledge compilationAnnals of Mathematics and Artificial Intelligence10.1007/s10472-024-09942-w92:5(1007-1011)Online publication date: 17-May-2024
https://dl.acm.org/doi/10.1007/s10472-024-09942-w
Salhi YSioutis M(2024)Compact Solution Representation in Qualitative Constraint-Based ReasoningScalable Uncertainty Management10.1007/978-3-031-76235-2_31(421-428)Online publication date: 28-Nov-2024
https://dl.acm.org/doi/10.1007/978-3-031-76235-2_31
Kennedy LKindo IChoi AMarquis PSon TKern-Isberner G(2023)On training neurons with bounded compilationsProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/39(395-405)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/39
Pittaras NGiannakopoulos GStamatopoulos PKarkaletsis V(2023)Content-based and Knowledge-enriched Representations for Classification Across Modalities: A SurveyACM Computing Surveys10.1145/358368255:14s(1-40)Online publication date: 13-Feb-2023
https://dl.acm.org/doi/10.1145/3583682
Möhle S(2023)An Abstract CNF-to-d-DNNF Compiler Based on Chronological CDCLFrontiers of Combining Systems10.1007/978-3-031-43369-6_11(195-213)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43369-6_11
Shah PBansal AAkshay SChakraborty SGorla D(2021)A normal form characterization for efficient boolean skolem function synthesisProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470741(1-13)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470741
Bollig BFarenholtz M(2021)On the Relation Between Structured d-DNNFs and SDDsTheory of Computing Systems10.1007/s00224-020-10003-y65:2(274-295)Online publication date: 1-Feb-2021
https://dl.acm.org/doi/10.1007/s00224-020-10003-y
Darwiche ASuciu DTao YWei Z(2020)Three Modern Roles for Logic in AIProceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3375395.3389131(229-243)Online publication date: 14-Jun-2020
https://dl.acm.org/doi/10.1145/3375395.3389131
Lai YLiu DYin M(2017)New canonical representations by augmenting OBDDs with conjunctive decompositionJournal of Artificial Intelligence Research10.5555/3176764.317677658:1(453-521)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3176764.3176776
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents