Loop formulas for circumscription

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 281-286

  Lee, Joohyung ^a   Lin, Fangzhen ^b  

^a University of Texas at Austin   (United States)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM LISTINGS; CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

CIRCUMSCRIPTION; LOOP FORMULAS; NONMONOTONIC LOGICS;

FORMAL LOGIC;

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

References (22)

1. Clark, K. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases. New York: Plenum Press. 293-322.
2. Doherty, P.; Lukaszewicz, W.; and Szałas, A. 1997. Computing circumscription revisited: A reduction algorithm. Journal of Automated Reasoning 18(3):297-336.
3. Erdem, E., and Lifschitz, V. 2003. Tight logic programs. Theory and Practice of Logic Programming 3:499-518.
4. Fages, F. 1994. Consistency of clark's completion and existence of stable of stable models. Journal of Methods of Logic in Computer Science 1:51-60.
5. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. Fifth International Conference and Symposium on Logic Programming, 1070-1080.
6. Giunchiglia, E.; Lee, J.; Lifschitz, V.; McCain, N.; and Turner, H. 2004. Nonmonotonic causal theories. Artificial Intelligence 153:49-104.
7. Giunchiglia, E.; Lierler, Y.; and Maratea, M. 2004. SAT-based answer set programming. In Proc̀. AAAI-04. this proceeding.
8. Lee, J., and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Proc. Nineteenth Int'l Conf. on Logic Programming, 451 -465.
9. Lee, J. 2004. Nondefinite vs. definite causal theories. In Proc. 7th Int'l Conference on Logic Programming and Nonmonotonic Reasoning, 141-153.
10. Lifschitz, V.; Tang, L. R.; and Turner, H. 1999. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25:369-389.
11. Lifschitz, V. 1985. Computing circumscription. In Proc. IJCAI-85, 121-127.
12. Lifschitz, V. 1987. Pointwise circumscription. In Ginsberg, M., ed., Readings in nonmonotonic reasoning. San Mateo, CA: Morgan Kaufmann. 179-193.
13. Lifschitz, V. 1997. On the logic of causal explanation. Artificial Intelligence 96:451-465.
14. Lin, F., and Zhao, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc. AAAI-02, 112-117.
15. Lin, F. 1995. Embracing causality in specifying the indirect effects of actions. In Proc. IJCAI-95, 1985-1993.
16. Lin, F. 2001. On strongest necessary and weakest sufficient conditions. Artificial Intelligence 128(1-2): 143-159.
17. Lin, F. 2003. Compiling causal theories to successor state axioms and STRIPS-like systems. Journal of Artificial Intelligence Research 19:279-314.
18. McCain, N., and Turner, H. 1997. Causal theories of action and change. In Proc. AAAI-97,460-465.
19. McCarthy, J. 1980. Circumscription - a form of non-monotonic reasoning. Artificial Intelligence 13:2739,171-172.
20. McCarthy, J. 1986. Applications of circumscription to formalizing common sense knowledge. Artificial Intelligence 26(3):89-116.
21. Reiter, R. 1982. Circumscription implies predicate completion (sometimes). In Proceedings of AAAI-82, 418-420.
22. Reiter, R. 1991. The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In Lifschitz, V., ed., Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. San Diego, CA: Academic Press. 359-380.