Updating logical databases
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
Logical definability of NP optimization problems
Information and Computation
Computing circumscriptive databases, I: theory and algorithms
Information and Computation
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Off-line reasoning for on-line efficiency: knowledge bases
Artificial Intelligence
Default reasoning using classical logic
Artificial Intelligence
Is intractability of nonmonotonic reasoning a real drawback?
Artificial Intelligence
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Existential second-order logic over graphs: charting the tractability frontier
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A survey on knowledge compilation
AI Communications
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
In Knowledge Compilation (KC) an intractable deduction problem KB ⊨ f is split into two phases: 1) KB is preprocessed, thus obtaining a data structure DKB; 2) the problem is efficiently solved using DKB and f. Our goal is to study KC in the context of relational databases: Both KB and f are represented as databases, and '⊨' is represented as a query Q in second-order logic. DKB is a database, to be synthesized from KB by means of an appropriate view. Q is rewritten, thus obtaining Qr. We show syntactic restrictions on Q implying that a polynomial-size DKB and a first-order Qr exist, which imply that phase 2 can be done in polynomial time. We also present classes of queries (in some sense complementary to the former ones) for which either no polynomial-size DKB or no first-order Qr exist (unless the PH collapses). Compilation to other complexity classes is also addressed.