Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of database queries
Journal of Computer and System Sciences
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Parameterized complexity for the database theorist
ACM SIGMOD Record
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Perspectives on database theory
FOCS '95 Proceedings of the 36th 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
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Scaling up reasoning about actions using relational database technology
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Tractable reasoning in first-order knowledge bases with disjunctive information
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
On the expressiveness of Levesque's normal form
Journal of Artificial Intelligence Research
Grounding for model expansion in k-guarded formulas with inductive definitions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Progression of situation calculus action theories with incomplete information
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Efficient reasoning in proper knowledge bases with unknown individuals
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
An approximative inference method for solving ∃∀SO satisfiability problems
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
In previous work, Levesque proposed an extension to classical databases that would allow for a certain form of incomplete first-order knowledge. Since this extension was sufficient to make full logical deduction undecidable, he also proposed an alternative reasoning scheme with desirable logical properties. He also claimed (without proof) that this reasoning could be implemented efficiently using database techniques such as projections and joins. In this paper, we substantiate this claim and show how to adapt a bottom-up database query evaluation algorithm for this purpose, thus obtaining a tractability result comparable to those that exist for databases.