A tractability result for reasoning with incomplete first-order knowledge bases

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 83-88

  Liu, Yongmei ^a   Levesque, Hector J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AND JOINS; DATABASE QUERIES; DATABASE TECHNIQUE; FIRST-ORDER; KNOWLEDGE BASIS; LOGICAL PROPERTIES; REASONING SCHEMES;

ARTIFICIAL INTELLIGENCE;

DATABASE SYSTEMS;

EID: 9444269097     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. H. Andreka, I. Hodkinson, and I. Nemeti. Modal languages and bounded fragments of predicate logic. ILLC Research Report ML-96-03, University of Amsterdam, 1996.
2. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Conference record of the 9th annual ACM Symp. on Theory of Computing, pages 77-90, 1977.
3. C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. In Proc. 6th Int. Conf. on Database Theory, pages 56-70, 1997.
4. R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness 1: Basic results. SIAM Journal on Computing, 24(4):873-921, 1995.
5. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. In Proc. of the 8th Int. Conf on Database Theory, pages 22-38, 2001.
6. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. In Proc. /8th ACM Symp. on Principles of Database Systems, 1999.
7. G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. In Proc. of the 20th ACM Symp. on Principles of Database Systems, 2001.
8. M. Grohe. Parameterized complexity for the database theorist. SIGMOD Record 31 (4), 2002.
9. G. Lakemeyer and H.J. Levesque. Evaluation-based reasoning with disjunctive information in first-order knowledge bases. In Proc. of KR-02, pages 73-81, 2002.
10. H.J. Levesque. A completeness result for reasoning with incomplete first-order knowledge bases. In Proc. ofKR-98, pages 14-23, 1998.
11. C.H. Papadimitriou and M. Yannakakis. On the complexity of database queries. Journal of Computer and System Sciences, 58(3):407-427,1999.
12. R. Petrick and H.J. Levesque. Knowledge equivalence in combined action theories. In Proc. ofKR-02, pages 303-314,2002.
13. R. Reiter. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, 2001'.
14. M.Y. Vardi. The complexity of relational query languages. In Proc. of the 14th Annual ACM Symp. on Theory of Computing, pages 137-146, 1982.
15. M. Yannakakis. Algorithms for acyclic database schemes. In Proc. of the 7th Int. Conf. on Very Large Data Bases, pages 82-94, 1981.
16. M. Yannakakis. Perspectives on database theory. In Proc. of the 36th Annual Symp. on Foundations of Computer Science, pages 224-246,1995.