Knowledge compilation and theory approximation

Journal of the ACM

Volumn 43, Issue 2, 1996, Pages 193-224

  Selman, Bart ^a   Kautz, Henry ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Algorithms; Efficient reasoning methods; Experimentation; Horn clauses; Knowledge compilation; Knowledge base optimization; Query evaluation; Theory; Theory approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; FORMAL LANGUAGES; INFERENCE ENGINES; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; THEOREM PROVING;

COMPUTATIONAL EFFICIENCY; COMPUTATIONAL PROPERTIES; EFFICIENT REASONING METHODS; HORN CLAUSES; HORN THEORY; KNOWLEDGE COMPILATION; QUERY EVALUATION;

KNOWLEDGE REPRESENTATION;

EID: 0030102186     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/226643.226644     Document Type: Article

References (76)

1. AGRE, P. E., AND CHAPMAN, D. 1987. Pengi: An implementation of a theory of activity. In Proceedings of the 6th National Conference on Artificial Intelligence (AIII-87) (Seattle, Wash.). Morgan-Kaufmann, San Mateo, Calif., pp. 268-272.
2. AMAREL, S. 1968. On representations of problems of reasoning about actions. In Machine Intelligence, vol. 3, D. Michie, ed. Edinburgh University Press, Edinburgh, Scotland, pp. 131-171.
3. ASPVALL, B., PLASS, M. F., AND TARJAN, R. E. 1979. A linear-time algorithm for testing the truth of certain quantified Boolean formulae. Inf. Proc. Lett. 8, 121-127.
4. BOPPANA, R. B., AND SIPSER, M. 1990. The complexity of finite functions. In Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, J. an Leeuwen, ed. Elsevier, Amsterdam, The Netherlands (and MIT Press, Cambridge, Mass.), pp. 757-804.
5. BORGIDA, A., AND ETHERINGTON, D. W. 1989. Hierarchical knowledge bases and efficient disjunctive reasoning. In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning. (Toronto, Ont., Canada). Morgan-Kaufmann, San Mateo, Calif., pp. 33-43.
6. BURO, M., AND BÜNING, H. K. 1992. Report on a SAT competition. Technical Memorandum 110. Mathematik/Informatik Univ. Paderborn, Paderborn, Germany.
7. BYLANDER, T. 1991. Complexity results for planning. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91) (Sidney, Australia). Morgan-Kaufmann, San Mateo, Calif., pp. 274-279.
8. CADOLI, M. 1993. Semantical and computational aspects of horn approximations. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93) (Chambery, France). Morgan-Kaufmann, San Mateo, Calif., pp. 39-44.
9. CADOLI, M., AND SCHAERF, M. 1992. Approximation in concept description languages. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92) (Cambridge, Mass.). Morgan-Kaufmann, San Mateo, Calif., pp. 330-341.
10. COOK, S. A. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (Shaker Heights, Ohio, May 3-5). ACM, New York, pp. 151-158.
11. CRAWFORD, J., AND AUTON, L. 1993. Experimental results on the crossover point in satisfiability problems. In Proceedings of the 11th National Conference of Artificial Intelligence (AIII-93) (Washington, D.C.). MIT Press, Cambridge, Mass., pp. 21-27.
12. DALAL, M., AND ETHERINGTON, D. W. 1992. Tractable approximate deduction using limited vocabularies. In Proceedings of the 9th Canadian Conference on Artificial Intelligence (AI '92) (Vancouver, B.C., Canada). Morgan-Kaufmann, Sun Mateo, Calif., pp. 206-212.
13. DAVIS, M., AND PUTNAM, H. 1960. A computing procedure for quantification theory. J. ACM 7, 3 (July), 201-215.
14. DE KLEER, J. 1990. Exploiting locality in the TMS. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI-91) (Boston, Mass.). MIT Press, Cambridge, Mass., pp. 264-271.
15. DEAN, T. 1985. Artificial Intelligence, Theory and Practice. Benjamin/Cummings, Redwood City, Calif.
16. DEAN, T., AND BODDY, M. 1988. An analysis of time-independent planning. In Proceedings of the 7th National Conference on Artificial Intelligence (AAAI-88) (St. Paul, Minn.). Morgan-Kaufmann, San Mateo, Calif., pp. 49-54.
17. DECHTER, R. 1992. Constraint networks. In Encyclopedia of Artificial Intelligence. John Wiley & Sons, New York, pp. 276-285.
18. DECHTER, R., AND PEARL, J. 1992. Structure identification in relational data. Artif. Int. 58, 1-3, 237-270.
19. DEL VAL, A. 1995. An analysis of approximate knowledge compilation. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95) (Montreal, Que., Canada). Morgan-Kaufmann, San Mateo, Calif., pp. 830-836.
20. DONINI, F. M., LENZERINI, M., NARDI, D., AND NUTT, W. 1991. The complexity of concept languages. In Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91) (Cambridge, Mass.). Morgan-Kaufmann, San Mateo, Calif., pp. 151-162.
21. DOWLING, W. F., AND GALLIER, J. H. 1984. Linear time algorithms for testing the satisfiability of propositional Horn formula. J. Log. Prog. 3, 267-284.
22. DOYLE, J., AND PATIL, R. 1991. Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services. Artif. Int. 48, 3, 261-298.
23. DUBOIS, O., ANDRE, P., BOUFKHAD, Y., AND CARLIER, J. 1995. SAT versus unSAT. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D. S. Johnson and M. A. Trick, eds. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS Press, Providence, R.I.
24. ELLMAN, T. 1993. Abstraction via approximate symmetry. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), vol. 2. (Chambery, France). Morgan-Kaufmann, Mateo, Calif., pp. 916-921.
25. EROL, K., NAU, D. S., AND SUBRAHMANIAN, V. S. 1992. On the complexity of domain-independent planning. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92) (San Jose, Calif.). MIT Press, Cambridge, Mass., pp. 381-386.
26. ETHERINGTON, D. W., BORGIDA, A., BRACHMAN, R. J., AND KAUTZ, H. 1989. Vivid knowledge and tractable reasoning: Preliminary report. In Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI-89) (Detroit, Mich.). Morgan-Kaufmann, San Mateo, Calif., pp. 1146-1152.
27. FRISCH, A. M. 1985. Using model theory to specify AI programs. In Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85) (Los Angeles, Calif.). Morgan-Kaufmann, San Mateo, Calif., pp. 148-154.
28. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, Calif.
29. GELERNTER, H. 1959/1963. Realization of a geometry theorem-proving machine. In Proceedings of the International Conference on Information Processing (Paris, France). UNESCO House, 1959. pp. 273-282. (Reprinted in Computers and Thought. E. Feigenbaum and J. Feldman, eds. McGraw-Hill, New York, 1963, 134-152.)
30. GELERNTER, H. 1959/1963. Realization of a geometry theorem-proving machine. In Proceedings of the International Conference on Information Processing (Paris, France). UNESCO House, 1959. pp. 273-282. (Reprinted in Computers and Thought. E. Feigenbaum and J. Feldman, eds. McGraw-Hill, New York, 1963, 134-152.)
31. GOGIC, G., PAPADIMITRIOU, C., AND SIDERI, M. 1994. Incremental recompilation of knowledge. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) (Seattle, Wash.). MIT Press, Boston, Mass., pp. 922-927.
32. GREINER, R., AND SCHUURMANS, D. 1992. Learning useful horn approximations. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92) (Boston, Mass.). Morgan-Kaufmann, San Mateo, Calif., pp. 383-392.
33. GUPTA, N., AND NAU, D. S. 1991. Complexity results for blocks-world planning. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-91). (Anaheim, Calif.). MIT Press, Cambridge, Mass., pp. 629-635.
34. HEINTZE, N., AND JAFFAR, J. 1990. A finite presentation theorem for approximating logic programs. In Proceedings of POPL-90. MIT Press, Cambridge, Mass., pp. 197-201.
35. HENSCHEN L., AND WOS, L. 1974. Unit refutations and Horn sets. J. ACM 21, 4 (Oct.), 590-605.
36. HORVITZ, E. J., COOPER, G. F., AND HECKERMAN, D. E. 1989. Reflection and action under scarce resources: Theoretical principles and empirical study. In Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI-89) (Detroit, Mich., May). Morgan-Kaufmann, San Mateo, Calif., pp. 1121-1126.
37. IMIELINSKI, T. 1987. Domain abstraction and limited reasoning. In Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI-87), vol. 2. Morgan-Kaufmann, San Mateo, Calif., pp. 997-1002.
38. JOHNSON, D. S. 1990. A catalog of complexity classes. In Handbook of Theoretical Computer Science, vol. A: Algorithms and Complexity, chap. 2. J. Van Leeuwen, ed. Elsevier Science Publishers B. V., Amsterdam, The Netherlands (and MIT Press, Cambridge, Mass.), pp. 67-161.
39. KARP, R. M., AND LIPTON, R. 1982. Turing machines that take advice. Enseign. Math., 28, 191-209.
40. KAUTZ, H. A., KEARNS, M. J., AND SELMAN, B. 1994. Horn approximations of empirical data. Artif. Int. 74, 129-145.
41. KAUTZ, H., AND SELMAN, B. 1991. A general framework for knowledge compilation. In Proceedings of the International Workshop on Processing Declarative Knowledge (PDK-91) (Kaiserslautern, Germany, July). Lecture Notes in Artificial Intelligence vol. 567. H. Boley and M. M. Richter, eds. Springer-Verlag, Berlin, Germany, pp. 287-300.
42. KAUTZ, H., AND SELMAN, B. 1992a. Forming concepts for fast inference. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92) (San Jose, Calif.). MIT Press, Cambridge, Mass., pp. 786-793.
43. KAUTZ, H., AND SELMAN, B. 1992b. Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI-92) (Vienna, Austria). Wiley, Chichester, UK, pp. 359-364.
44. KAUTZ, H., AND SELMAN, B. 1994. An empirical evaluation of knowledge compilation. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) (Seattle, Wash.). MIT Press, Boston, Mass., pp. 155-161.
45. KHARDON, R., AND ROTH, D. 1994. Learning to reason. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) (Seattle, Wash.). MIT Press, Boston, Mass. pp. 682-688.
46. KIRKPATRICK, S. AND SELMAN, B. 1994. Critical behavior in the satisfiability of random Boolean expressions. Science, 264 (May), 1297-1301.
47. KNOBLOCK, C. A., MINTON, S., AND ETZIONI, O. 1991. Integrating abstraction and explanationbased learning in prodigy. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-91) (Anaheim, Calif.). MIT Press, Cambridge, Mass., pp. 541-546.
48. KNOBLOCK, C. A., TENENBERG, J. D., AND YANG, Q. 1991. Characterizing abstraction hierarchies for planning. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-91) (Anaheim, Calif.). MIT Press, Cambridge, Mass., pp. 692-697.
49. LARRABEE, T. 1992. Test pattern generation using Boolean satisfiability. IEEE Trans. Comput. Aid. Des. 11, 4-15.
50. LEE, R. C. T. 1967. A completeness theorem and a computer program for finding theorems derivable from given axioms. Ph.D. dissertation. Univ. California at Berkeley, Berkeley, Calif.
51. LEVESQUE, H. J. 1984. A logic of implicit and explicit belief. In Proceedings of the 4th National Conference on Artificial Intelligence (AAAI-84). (Austin, Tex.). Morgan-Kaufmann, San Mateo, Calif., pp. 198-202.
52. LEVESQUE, H. 1986. Making believers out of computers. Artif. Int. 30, 1, 81-108.
53. LEVESQUE, H. J., AND BRACHMAN, R. J. 1985. A fundamental tradeoff in knowledge representation and reasoning (revised version). In Readings in Knowledge Representation, R. J. Brachman and H. J. Levesque, eds. Morgan-Kaufmann, San Mateo, Calif., pp. 41-70.
54. LEWIS, H. R. 1978. Renaming a set of clauses as a Horn set. J. ACM, 25, 1 (Jan.), 134-135.
55. MCALLESTER, D. A., AND GIVAN, R. 1992. Natural language syntax and first-order inference. Artif. Int. 56, 1-20.
56. MITCHELL, D., SELMAN, B., AND LEVESQUE, H. 1992. Hard and easy distribution of SAT problems. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92) (San Jose, Calif.). MIT Press, Cambridge, Mass., pp. 459-465.
57. MUGGLETON, S., AND BUNTINE, W. 1988. Machine invention of first-order predicates by inverting resolution. In Proceedings of the 5th International Conference on Machine Learning. Morgan-Kaufmann, San Mateo, Calif., pp 339-344.
58. PATEL-SCHNEIDER, P. F. 1986. A four-valued semantics for frame-based description languages. In Proceedings of the 5th National Conference on Artificial Intelligence (AAAI-86) (Philadelphia, Pa.). Morgan-Kaufmann, San Mateo, Calif., pp. 344-348.
59. PLAISTED, D. 1981. Theorem proving with abstraction. Artif. Int. 16, 47-65.
60. REITER, R., AND DE KLEER, J. 1987. Foundations of assumption based truth maintenance systems: Preliminary report. In Proceedings of the 6th National Conference on Artificial Intelligence (AAAI-87) (Austin, Tex.). Morgan-Kaufmann, San Mateo, Calif., pp. 183-187.
61. REITER, R., AND MACKWORTH, A. 1989. A logical framework for depiction and image interpretation. Artif. Int. 41, 2, 125-155.
62. SACERDOTI, E. D. 1974. Planning in a hierarchy of abstraction spaces. Artif. Int. 5, 2, 115-135.
63. SCHOPPERS, M. J. 1987. Universal plans for reactive robots in unpredictable environments. In Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI-87) (Milan, Italy). Morgan-Kaufmann, San Mateo, Calif., pp. 1039-1046.
64. SELMAN, B. 1991. Tractable default reasoning. Ph.D. thesis. Dept. Computer Science, Univ. Toronto, Toronto, Ontario, Canada.
65. SELMAN, B. 1994. Near-Optimal Plans, Tractability, and Reactivity. In Proceedings of the 4th International Conference on Knowledge Representation and Reasoning (KR-94) (Bonn, Germany). Morgan-Kaufmann, San Mateo, Calif., pp. 521-529.
66. SELMAN, B., AND KAUTZ, H. 1991. Knowledge compilation using Horn approximations. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-91) (Anaheim, Calif.). MIT Press, Cambridge, Mass., pp. 904-909.
67. SELMAN, B., AND KAUTZ, H. 1993. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93) (Chambery, France). Morgan-Kaufmann, San Mateo, Calif., pp. 290-295.
68. SELMAN, B., AND KIRKPATRICK, S. 1996. Critical behavior in the computational cost of satisfiability testing. Artif. Int., 81, in press.
69. SELMAN, B., AND LEVESQUE, H. J. 1990. Abductive and default reasoning: a computational Core. In Proceedings of the 8th National Conference on Artificial Intelligence (AAAI-90) (Cambridge, Mass.). MIT Press, Cambridge, Mass., pp. 343-348.
70. SELMAN B., AND LEVESQUE, H. J. 1996. Support set selection for abductive and default reasoning. Artif. Int., in press.
71. SELMAN, B., LEVESQUE, H. J., AND MITCHELL, D. 1992. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92) (San Jose, Calif.). MIT Press, Cambridge, Mass. pp. 440-446.
72. SELMAN, B., MITCHELL, D., AND LEVESQUE, H. J. 1996. Generating Hard Satisfiability Problems. Artif. Int., 81, in press.
73. SUBRAMANIAN, D., AND GENESERETH, M. R. 1987. The relevance of irrelevance. In Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI-87) (Milan, Italy). Morgan-Kaufmann, San Mateo, Calif., pp. 416-422.
74. TSEITIN, G. S. 1968. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, Part II. A. O. Slisenko, ed. pp. 115-125.
75. VALIANT, L. G. 1983. A theory of the learnable. Commun. ACM 27, 11 (Nov.), 1134-1142.
76. VALIANT, L. G., AND VAZIRANI, V. V. 1986. NP is as easy as detecting unique solutions. Theoret. Comput. Sci. 47, 85-93.