Computational efficiency is a central concern in the design of knowledge representation systems. In order to obtain efficient systems, it has been suggested that one should limit the form of the statements in the knowledge base or use an incomplete inference mechanism. The former approach is often too restrictive for practical applications, whereas the latter leads to uncertainty about exactly what can and cannot be inferred from the knowledge base. We present a third alternative, in which knowledge given in a general representation language is translated (compiled) into a tractable form--- allowing for efficient subsequent query answering. We show how propositional logical theories can be compiled into Horn theories that approximate the original information. The approximations bound the original theory from below and above in terms of logical strength. The procedures are extended to other tractable languages (for example, binary clauses) and to the first-order case. Finally, we demonstrate the generality of our approach by compiling concept descriptions in a general frame-based language into a tractable form. Journal of the ACM (to appear)
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
1395
|
A theory of the learnable
– Valiant
- 1984
|
|
799
|
A computing procedure for quantification theory
– DAVIS, PUTNAM
- 1960
|
|
763
|
Temporal constraint networks
– Dechter, Meiri, et al.
- 1991
|
|
567
|
A new method for solving hard satisfiability problems
– Selman, Levesque, et al.
- 1992
|
|
514
|
Pengi: An implementation of a theory of activity
– Agre, Chapman
- 1987
|
|
511
|
The complexity of theorem-proving procedures
– COOK
|
|
398
|
Planning in a Hierarchy of Abstraction Spaces
– Sacerdoti
- 1974
|
|
322
|
A catalog of complexity classes
– Johnson
- 1990
|
|
320
|
Universal planning for reactive robots in unpredictable envi-ronments
– Schoppers
- 1987
|
|
286
|
Planning as satisfiability
– Kautz, Selman
- 1992
|
|
255
|
and easy distributions of SAT problems
– Hard
- 1992
|
|
237
|
A logic of implicit and explicit belief
– Levesque
- 1984
|
|
232
|
The complexity of concept languages
– Donini, Lenzerini, et al.
- 1991
|
|
213
|
Solving time-dependent planning problems
– Boddy, Dean
- 1989
|
|
201
|
Test pattern generation using boolean satisfiability
– Larrabee
- 1992
|
|
196
|
Experimental results on the crossover point in satisfiability problems
– Crawford, Anton
- 1993
|
|
196
|
Domain-independent extensions to gsat: Solving large structured satisfiability problems
– Selman, Kautz
- 1993
|
|
192
|
On the complexity of derivations in the propositional calculus
– TSEITIN
- 1968
|
|
179
|
NP is as Easy as Detecting Unique Solutions
– Valiant, Vazirani
- 1986
|
|
179
|
and easy distributions of SAT problems
– Mitchell, Selman, et al.
- 1992
|
|
170
|
The complexity of finite functions
– Boppana, Sipser
- 1990
|
|
157
|
Machine invention of first-order predicates by inverting resolution
– Muggleton, Buntine
- 1988
|
|
115
|
Complexity results for planning, in
– Bylander
- 1991
|
|
114
|
A linear-time algorithm for testing the truth of certain quanti ed Boolean formulas
– Aspvall, Plass, et al.
- 1979
|
|
112
|
Critical behavior in the satisfiability of random Boolean expressions
– Kirkpatrick, Selman
- 1994
|
|
111
|
Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services
– Doyle, Patil
- 1991
|
|
110
|
A fundamental tradeoff in knowledge representation and reasoning (revised version
– Levesque, Brachman
- 1985
|
|
94
|
A Finite Presentation Theorem for Approximating Logic Programs
– Heintze, Jaffar
- 1990
|
|
93
|
Making believers out of computers
– Levesque
- 1986
|
|
93
|
Knowledge compilation using Horn approximation
– Sellman, Kautz
- 1991
|
|
84
|
Report on a SAT competition
– Buro, Kleine-Buning
- 1992
|
|
82
|
Abductive and default reasoning: a computational core
– Selman, Levesque
- 1990
|
|
78
|
Linear time algorithms for testing the satisfi-abiltiy of propositional horn formulae
– Dowling, Gallier
- 1984
|
|
77
|
On representations of problems of reasoning about actions
– Amarel
- 1968
|
|
73
|
Reflection and action under scarce resources: Theoretical principles and empirical study
– Horvitz, Cooper, et al.
- 1989
|
|
69
|
Theorem proving with abstraction
– Plaisted
- 1981
|
|
67
|
Structure identification in relational data
– Dechter, Pearl
- 1992
|
|
60
|
Characterizing abstraction hierarchies for planning
– Knoblock, Tenenberg, et al.
- 1991
|
|
58
|
A logical framework for depiction and image interpretation
– Reiter, Mackworth
- 1989
|
|
57
|
Learning to reason
– Khardon, R, et al.
- 1997
|
|
54
|
Turing machines that take advice
– Karp, Lipton
- 1982
|
|
51
|
On the complexity of domain-independent planning
– Erol, Nau, et al.
- 1992
|
|
50
|
Forming Concepts for Fast Inference
– Kautz, Selman
- 1992
|
|
44
|
SAT versus UNSAT
– Dubois, Andre, et al.
- 1995
|
|
40
|
Near-optimal plans, tractability, and reactivity
– Selman
- 1994
|
|
39
|
A Completeness Theorem and a Computer Program for Finding Theorems Derivable From Given Axioms
– Lee
- 1967
|
|
38
|
Abstraction via approximate symmetry
– Ellman
- 1993
|
|
37
|
Critical behavior in the computational cost of satisfiability testing
– Selman, Kirkpatrick
- 1996
|
|
36
|
Genesereth M., The relevance of irrelevance
– Subramanian
|
|
