Tractable reasoning in first-order knowledge bases with disjunctive information

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2005, Pages 639-644

  Liu, Yongmei ^a   Levesque, Hector J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; INFORMATION THEORY; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING;

CHARACTERISTIC MODELS; CLASSICAL LOGIC; DISJUNCTIVE INFORMATION; MODEL CHECKING PROBLEM;

ARTIFICIAL INTELLIGENCE;

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

References (15)

1. Chen, H. 2004. Quantified constraint satisfaction and bounded treewidth. In Proc. of ECAI-04, 161-165.
2. Dechter, R., and Pearl, J. 1989. Tree clustering for constraint networks. Artificial Intelligence 38(3):353-366.
3. Freuder, E. C. 1990. Complexity of K-tree structured constraint satisfaction problems. In Proc. AAAI-90, 4-9.
4. Frisch, A. M. 1987. Inference without chaining. In Proc. IJCAI-87, 515-519.
5. Kolaitis, P. G., and Vardi, M. Y. 2000. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences 61(2): 14-23.
6. Lakemeyer, G., and Levesque, H. J. 2002. Evaluation-based reasoning with disjunctive information in first-order knowledge bases. In Proc. KR-02, 73-81.
7. Lakemeyer, G. 1994. Limited reasoning in first-order knowledge bases. Artificial Intelligence 71(2):213-255.
8. Levesque, H. J. 1984. A logic of implicit and explicit belief. In Proc. of AAAI-84, 198-202.
9. Levesque, H. J. 1998. A completeness result for reasoning with incomplete first-order knowledge bases. In Proc. KK-98, 302-332.
10. Liu, Y., and Levesque, H. J. 2003. A tractability result for reasoning with incomplete first-order knowledge bases. In Proc. IJCAI-03, 83-88.
11. Liu, Y.; Lakemeyer, G.; and Levesque, H. J. 2004. A logic of limited belief for reasoning with disjunctive information. In Proc. KR-04, 587-597.
12. Patel-Schneider, P. F. 1990. A decidable first-order logic for knowledge representation. Journal of Automated Reasoning 6:361-388.
13. Schaerf, M., and Cadoli, M. 1995. Tractable reasoning via approximation. Artificial Intelligence 74:249-310.
14. Vardi, M. Y. 1982. The complexity of relational query languages (extended abstract). In Proc. 14th Annual ACM Symposium on Theory of Computing, 137-146.
15. Vardi, M. Y. 1995. On the complexity of bounded-variable queries. In Proc. 14th ACM Symposium on Principles of Database Systems (PODS '95), 266-276.