Loop formulas for circumscription

Artificial Intelligence

Volumn 170, Issue 2, 2006, Pages 160-185

  Lee, Joohyung ^a   Lin, Fangzhen ^b  

^a Arizona State University   (United States)

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

Author keywords

Circumscription; Clark's completion; Commonsense reasoning; Knowledge representation; Logic programming; Loop formulas; Nonmonotonic reasoning

Indexed keywords

KNOWLEDGE ENGINEERING; LOGIC PROGRAMMING; SEMANTICS;

CIRCUMSCRIPTION; CLARK'S COMPLETION; LOOP FORMULAS;

ARTIFICIAL INTELLIGENCE;

EID: 29344460362     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2005.09.003     Document Type: Article

References (34)

1. V. Akman, S. Erdoǧan, J. Lee, V. Lifschitz, and H. Turner Representing the Zoo World and the Traffic World in the language of the Causal Calculator Artificial Intelligence 153 1-2 2004 105 140
2. A. Artikis, M. Sergot, and J. Pitt An executable specification of an argumentation protocol Proceedings of Conference on Artificial Intelligence and Law (ICAIL) 2003 ACM Press New York 1 11
3. A. Artikis, M. Sergot, and J. Pitt Specifying electronic societies with the Causal Calculator F. Giunchiglia J. Odell G. Weiss Proceedings of Workshop on Agent-Oriented Software Engineering III (AOSE) Lecture Notes in Comput. Sci. vol. 2585 2003 Springer Berlin
4. J. Campbell, and V. Lifschitz Reinforcing a claim in commonsense reasoning, in: Working Notes of the AAAI Spring Symposium on Logical Formalizations of Commonsense Reasoning, 2003 http://www.cs.utexas.edu/users/vl/ papers/sams.ps
5. K. Clark Negation as failure H. Gallaire J. Minker Logic and Data Bases 1978 Plenum Press New York 293 322
6. P. Doherty, W. Łukaszewicz, and A. Szałas Computing circumscription revisited: A reduction algorithm J. Automat. Reasoning 18 3 1997 297 336
7. E. Erdem, and V. Lifschitz Tight logic programs Theory and Practice of Logic Programming 3 2003 499 518
8. F. Fages Consistency of Clark's completion and existence of stable of stable models J. Methods of Logic in Computer Science 1 1994 51 60
9. M. Gelfond, V. Lifschitz, The stable model semantics for logic programming, in: Proc. Fifth International Conference and Symposium on Logic Programming, 1988, pp. 1070-1080
10. E. Giunchiglia, J. Lee, V. Lifschitz, N. McCain, and H. Turner Nonmonotonic causal theories Artificial Intelligence 153 1-2 2004 49 104
11. E. Giunchiglia, Y. Lierler, M. Maratea, SAT-based answer set programming, in: Proc. AAAI-04, San Jose, CA, 2004, pp. 61-66
12. J. Lee, V. Lifschitz, Loop formulas for disjunctive logic programs, in: Proc. ICLP-03, 2003, pp. 451-465
13. J. Lee, Nondefinite vs. definite causal theories, in: Proc. 7th Internat. Conference on Logic Programming and Nonmonotonic Reasoning, 2004, pp. 141-153
14. J. Lee, Automated reasoning about actions, PhD thesis, University of Texas at Austin, 2005
15. J. Lee, A model-theoretic counterpart of loop formulas, in: Proc. IJCAI-05, Edinburgh, UK, 2005, pp. 503-508
16. V. Lifschitz, A. Razborov, Why are there so many loop formulas? ACM Trans. Comput. Logic (2005), submitted for publication
17. V. Lifschitz, L.R. Tang, and H. Turner Nested expressions in logic programs Ann. Math. Artificial Intelligence 25 1999 369 389
18. V. Lifschitz, N. McCain, E. Remolina, and A. Tacchella Getting to the airport: The oldest planning problem in AI J. Minker Logic-Based Artificial Intelligence 2000 Kluwer Dordrecht 147 165
19. V. Lifschitz, Computing circumscription, in: Proc. IJCAI-85, Los Angeles, CA, 1985, pp. 121-127
20. V. Lifschitz Pointwise circumscription M. Ginsberg Readings in Nonmonotonic Reasoning 1987 Morgan Kaufmann San Mateo, CA 179 193
21. V. Lifschitz Foundations of logic programming G. Brewka Principles of Knowledge Representation 1996 CSLI Publications 69 128
22. V. Lifschitz On the logic of causal explanation Artificial Intelligence 96 1997 451 465
23. V. Lifschitz, Missionaries and cannibals in the Causal Calculator, in: Principles of Knowledge Representation and Reasoning: Proc. Seventh Internat. Conf., 2000, pp. 85-96
24. F. Lin, Y. Zhao, ASSAT: Computing answer sets of a logic program by SAT solvers. in: Proc. AAAI-02, Edmonton, AB, 2002, pp. 112-117
25. F. Lin Embracing causality in specifying the indirect effects of actions Proc. IJCAI-95, Montreal, Quebec 1995 IJCAI Inc. 1985 1993 Distributed by Morgan Kaufmann, San Mateo, CA
26. F. Lin On strongest necessary and weakest sufficient conditions Artificial Intelligence 128 1-2 2001 143 159
27. F. Lin Compiling causal theories to successor state axioms and STRIPS-like systems J. Artificial Intelligence Res. 19 2003 279 314
28. N. McCain, H. Turner, Causal theories of action and change, in: Proc. AAAI-97, Providence, RI, 1997, pp. 460-465
29. J. McCarthy Circumscription - a form of non-monotonic reasoning Artificial Intelligence 13 1980 27 39 171-172. Reproduced in [31]
30. J. McCarthy Applications of circumscription to formalizing common sense knowledge Artificial Intelligence 26 3 1986 89 116 Reproduced in [31]
31. J. McCarthy Formalizing Common Sense: Papers by John McCarthy 1990 Ablex Norwood, NJ
32. R. Reiter On closed world data bases H. Gallaire J. Minker Logics and Data Bases 1978 Plenum Press New York 55 76
33. R. Reiter, Circumscription implies predicate completion (sometimes), in: Proc. AAAI-82, Pittsburg, PA, 1982, pp. 418-420
34. R. Reiter The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression V. Lifschitz Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy 1991 Academic Press San Diego, CA 418 420