Knowledge compilation = query rewriting + view synthesis
Pages 199 - 208
Abstract
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.
References
[1]
R. Ben-Eliyahu and R. Dechter. Default reasoning using classical logic. Artificial Intelligence, 84(1-2):113-150, 1996.
[2]
M. Cadoli and F. M. Donini. A survey on knowledge compilation. AI Communications---The European Journal on Artificial Intelligence, 10:137-150, 1997.
[3]
M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf. Preprocessing of intractable problems. Technical Report DIS 24-97, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", November 1997. To appear in Information and Computation.
[4]
M. Cadoli, F. M. Donini, and M. Schaerf. Is intractability of non-monotonic reasoning a real drawback? Artificial Intelligence, 88(1-2):215-251, 1996.
[5]
A. K. Chandra and G. Markowsky. On the number of prime implicants. Discrete Mathematics, 24:7-11, 1978.
[6]
A. Darwiche and P. Marquis. A perspective on knowledge compilation. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), pages 470-475, 2001.
[7]
T. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are II2p-complete. Theoretical Computer Science, 114:231-245, 1993.
[8]
R. Fagin. Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. In R. M. Karp, editor, Complexity of Computation, pages 43-74. AMS, 1974.
[9]
G. Gogic, H. A. Kautz, C. Papadimitriou, and B. Selman. The comparative linguistics of knowledge representation. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95), pages 862-869, 1995.
[10]
G. Gottlob, P. Kolatis, and T. Schwentick. Existential second-order logic over graphs: Charting the tractability frontier. In Proceedings of the Fortyfirst Annual Symposium on the Foundations of Computer Science (FOCS 2000). IEEE Computer Society Press, 2000.
[11]
R. M. Karp and R. J. Lipton. Some connections between non-uniform and uniform complexity classes. In Proceedings of the Twelfth ACM Symposium on Theory of Computing (STOC'80), pages 302-309, 1980.
[12]
H. A. Kautz and B. Selman. Forming concepts for fast inference. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92), pages 786-793, 1992.
[13]
P. G. Kolaitis and M. N. Thakur. Logical definability of NP optimization problems. Information and Computation, 115(2):321-353, 1994.
[14]
V. Lifschitz. Computing circumscription. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI'85), pages 121-127, 1985.
[15]
J. Minker. On indefinite databases and the closed world assumption. In Proceedings of the Sixth International Conference on Automated Deduction (CADE'82), pages 292-308, 1982.
[16]
Y. Moses and M. Tennenholtz. Off-line reasoning for on-line efficiency: knowledge bases. Artificial Intelligence, 83:229-239, 1996.
[17]
A. Nerode, R. T. Ng, and V. S. Subrahmanian. Computing circumscriptive databases. I: Theory and algorithms. Information and Computation, 116:58-80, 1995.
[18]
B. Selman and H. A. Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43:193-224, 1996.
[19]
M. Y. Vardi. The complexity of relational query languages. In Proceedings of the Fourteenth ACM SIGACT Symposium on Theory of Computing (STOC'82), pages 137-146, 1982.
[20]
M. Winslett. Updating Logical Databases. Cambridge University Press, 1990.
Index Terms
- Knowledge compilation = query rewriting + view synthesis
Recommendations
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a Boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of errorless hardness amplification is to show that if f has no size s errorless circuit that ...
On the tractability of query compilation and bounded treewidth
ICDT '12: Proceedings of the 15th International Conference on Database TheoryWe consider the problem of computing the probability of a Boolean function, which generalizes the model counting problem. Given an OBDD for such a function, its probability can be computed in linear time in the size of the OBDD. In this paper we ...
The Landscape of Communication Complexity Classes
We prove several results which, together with prior work, provide a nearly-complete picture of the relationships among classical communication complexity classes between $${\mathsf{P}}$$P and $${\mathsf{PSPACE}}$$PSPACE, short of proving lower bounds ...
Comments
Information & Contributors
Information
Published In
June 2002
311 pages
ISBN:1581135076
DOI:10.1145/543613
- Conference Chair:
- Lucian Popa,
- General Chair:
- Serge Abiteboul,
- Program Chair:
- Phokion G. Kolaitis
Copyright © 2002 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 03 June 2002
Check for updates
Author Tags
Qualifiers
- Article
Conference
SIGMOD/PODS02: International Conference on Management of Data and Symposium on Principles Database and Systems
June 3 - 5, 2002
Wisconsin, Madison
Acceptance Rates
PODS '02 Paper Acceptance Rate 24 of 109 submissions, 22%;
Overall Acceptance Rate 642 of 2,707 submissions, 24%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 270Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)1
Reflects downloads up to 12 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in