First order LUB approximations: Characterization and algorithms

Artificial Intelligence

Volumn 162, Issue 1-2, 2005, Pages 7-48

  Del Val, Alvaro ^a  

^a UNIVERSIDAD AUTÓNOMA DE MADRID   (Spain)

Author keywords

Approximation; Automated reasoning; First order logic; Knowledge compilation; Reformulation; Resolution theorem proving

Indexed keywords

AUTOMATED REASONING; FIRST ORDER LOGIC; KNOWLEDGE COMPILATION; REFORMULATION; RESOLUTION THEOREM PROVING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; KNOWLEDGE BASED SYSTEMS; THEOREM PROVING;

APPROXIMATION THEORY;

EID: 11144291045     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.01.003     Document Type: Article

References (44)

1. K. Bning On generalized Horn formulas and k-resolution Theoret. Comput. Sci. 116 1993 405 413
2. Y. Boufkhad Algorithms for propositional KB approximation Proceedings of the Fifteenth American National Conference on Artificial Intelligence, AAAI-98, Madison, WI 1998 AAAI Press/MIT Press Cambridge, MA 280 285
3. M. Cadoli Semantic and computational aspects of Horn approximations Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, IJCAI-93, Chambéry, France 1993 39 45
4. M. Cadoli, and F.M. Donini A survey on knowledge compilation AI Comm. 10 1997 137 150 printed in 1998
5. A.K. Chandra, and G. Markowsky On the number of prime implicants Discrete Math. 24 1978 7 11
6. M. Cadoli, L. Palopoli, and F. Scarcello Propositional lower bounds: Algorithms and complexity Ann. Math. Artificial Intelligence 27 1999 129 148
7. M. Cadoli, and F. Scarcello Semantical and computational aspects of Horn approximations Artificial Intelligence 119 2000 1 17
8. A. Darwiche Model-based diagnosis using structured system descriptions J. Artificial Intelligence Res. 8 1998 165 222
9. A. Darwiche Decomposable negation normal form J. ACM 48 2001 608 647
10. M. Dalal, and D.W. Etherington Tractable approximate deduction using limited vocabularies Proceedings of the Ninth Canadian Conference on Artificial Intelligence, Vancouver, BC 1992 206 212
11. J. de Kleer, A.K. Mackworth, and R. Reiter Characterizing diagnosis and systems Artificial Intelligence 56 1992 197 222
12. R. Dechter, and J. Pearl Structure identification in relational data Artificial Intelligence 58 1992 237 290
13. A. del Val An analysis of approximate knowledge compilation Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95, Montreal, Quebec 1995 830 836
14. A. del Val Approximate knowledge compilation: The first order case Proceedings of the Thirteenth American National Conference on Artificial Intelligence, AAAI-96, Portland, OR 1996 AAAI Press/MIT Press Cambridge, MA 498 503
15. A. del Val A new method for consequence finding and compilation in restricted languages Proceedings of the Sixteenth American National Conference on Artificial Intelligence, AAAI-99, Orlando, FL 1999 AAAI Press/MIT Press Cambridge, MA 259 264
16. A. del Val The complexity of restricted consequence finding and abduction Proc. 17th (U.S.) National Conference on Artificial Intelligence, AAAI-2000, Austrin, TX 2000 AAAI Press/MIT Press Cambridge, MA 337 342
17. W. Hodges Logical features of Horn clauses D.M. Gabbay C.J. Hogger J.A. Robinson Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3 1993 University Press Oxford 449 503
18. K. Iwanuma, and K. Inoue Minimal answer computation and SOL S. Greco N. Leone Proceedings of the Eighth European Conference on Logics in Artificial Intelligence, JELIA 2002 2002 245 257
19. K. Inoue Linear resolution for consequence-finding Artificial Intelligence 56 1992 301 353
20. R. Khardon Translating between Horn representations and their characteristic models J. Artificial Intelligence Res. 3 1995 349 372
21. H. Kautz, M. Kearns, and B. Selman Reasoning with characteristic models Proceedings of the Eleventh American National Conference on Artificial Intelligence, AAAI-93, Washington, DC 1993 34 39
22. R. Khardon, and D. Roth Reasoning with models Proceedings of the Twelfth American National Conference on Artificial Intelligence, AAAI-94, Seattle, WA 1994 1148 1153
23. H. Kautz, and B. Selman A general framework for knowledge compilation Proceedings of the International Workshop on Processing Declarative Knowledge (PDK), Kaiserlautern 1991 287 300
24. H. Kautz, and B. Selman Forming concepts for fast inference Proceedings of the Tenth American National Conference on Artificial Intelligence, AAAI-92, San Jose, CA 1992 786 793
25. H. Kautz, M.J. Kearns, and B. Selman Horn approximations of empirical data Artificial Intelligence 74 1995 129 145
26. A. Kean, and G. Tsiknis An incremental method for generating prime implicants/implicates J. Symbolic Comput. 9 1990 185 206
27. R.C.T. Lee, A completeness theorem and a computer program for finding theorems derivable from given axioms, PhD Thesis, University of California at Berkeley, 1967
28. F. Lin On strongest necessary and weakest sufficient conditions Artificial Intelligence 128 2001 143 159
29. D. Loveland Automated Theorem Proving: A Logical Basis 1978 North-Holland New York
30. S. McIlraith, and E. Amir Theorem proving with structured theories Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01, Seattle, WA 2001 624 631
31. P. Marquis Extending abduction from propositional to first-order logic Proceedings of the International Workshop on Fundamentals of Artificial Intelligent Research Lecture Notes in Artificial Intelligence vol. 535 1991 141 155
32. P. Marquis Consequence-finding algorithms D. Gabbay Ph. Smets Algorithms for Defeasible and Uncertain Reasoning S. Moral J. Kohlas Handbook of Defeasible Reasoning and Uncertainty Management Systems vol. 5 2000 Kluwer Academic Dordrecht 41 145
33. B. MacCartney, S. McIlraith, E. Amir, and T. Uribe Practical partition-based theorem proving for large knowledge bases Proceedings of the Nineteenth International Conference on Artificial Intelligence, IJCAI-03, Acapulco, Mexico 2003 89 96
34. E. Minicozzi, and R. Reiter A note on linear resolution strategies in consequence-finding Artificial Intelligence 3 1972 175 180
35. D. Plaisted, The search efficiency of theorem proving strategies: an analytical comparison, Technical Report MPI-I-94-233, Max-Planck Institut für Informatik, Saarbruecken, Germany, 1994
36. T.C. Przymusinski An algorithm to compute circumscription Artificial Intelligence 38 1989 49 73
37. R. Reiter, and J. de Kleer Foundations of assumption-based truth maintenance systems Proceedings of the Sixth American National Conference on Artificial Intelligence, AAAI-87, Seattle, WA 1987 183 189
38. J.R. Slagle, C.L. Chang, and R.C.T. Lee Completeness theorems for semantic resolution in consequence finding Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI-69, Washington, DC 1969 281 286
39. L. Simon, and A. del Val Efficient consequence-finding Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01, Seattle, WA 2001 Morgan Kaufmann San Francisco, CA 359 365
40. B. Selman, and H. Kautz Knowledge compilation using Horn approximations Proceedings of the Ninth American National Conference on Artificial Intelligence, AAAI-91, Anaheim, CA 1991 904 909
41. B. Selman, and H. Kautz Knowledge compilation and theory approximation J. ACM 43 2 1996 193 224
42. B. Selman, and H.J. Levesque Support set selection for abductive and default reasoning Artificial Intelligence 82 1996 259 272
43. M.E. Stickel Resolution theorem proving Ann. Rev. Comput. Sci. 3 1988 285 316
44. I. Wegener The Complexity of Boolean Functions 1987 Wiley New York