Inductive situation calculus

Artificial Intelligence

Volumn 171, Issue 5-6, 2007, Pages 332-360

  Denecker, Marc ^a   Ternovska, Eugenia ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Inductive definitions; Knowledge representation; Situation calculus

Indexed keywords

COMPUTATIONAL COMPLEXITY; IDENTIFICATION (CONTROL SYSTEMS); KNOWLEDGE REPRESENTATION; PROBLEM SOLVING;

ID-LOGIC AXIOMATIZATION; INDUCTIVE DEFINITIONS; RAMIFICATION; SITUATION CALCULUS;

COMPUTATIONAL METHODS;

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

References (42)

1. Aczel P. An introduction to inductive definitions. In: Barwise J. (Ed). Handbook of Mathematical Logic (1977), North-Holland Publishing Company, Amsterdam 739-782
2. In: Baader F., Calvanese D., McGuinness D., Nardi D., and Patel-Schneider P. (Eds). The Description Logic Handbook. Theory, Implementation and Applications (2002), Cambridge University Press
3. Clark K.L. Negation as failure. In: Gallaire H., and Minker J. (Eds). Logic and Databases (1978), Plenum Press 293-322
4. Denecker M. The well-founded semantics is the principle of inductive definition. In: Dix J., Fariñas del Cerro L., and Furbach U. (Eds). Logics in Artificial Intelligence. Schloss Daghstull. Lecture Notes in Artificial Intelligence vol. 1489 (1998), Springer 1-16
5. Denecker M. Extending classical logic with inductive definitions. In: Lloyd J., et al. (Ed). First International Conference on Computational Logic (CL2000). London. Lecture Notes in Artificial Intelligence vol. 1861 (2000), Springer 703-717
6. Denecker M., Bruynooghe M., and Marek V. Logic programming revisited: logic programs as inductive definitions. ACM Transactions on Computational Logic 2 4 (2001) 623-654
7. Denecker M., and Ternovska E. Inductive situation calculus. Proceedings of Ninth International Conference on Principles of Knowledge Representation and Reasoning (2004), Delta Whistler Resort, Canada 545-553. http://www.cs.kuleuven.ac.be/cgi-bin-dtai/publ_info.pl?id=41085
8. M. Denecker, E. Ternovska, A logic of non-monotone inductive definitions and its modularity properties, in: V. Lifschitz, I. Niemelä (Eds.), 7th International Conference on Logic Programming and Nonmonotonic Reasoning, 2004
9. Denecker M., Theseider Duprè D., and Van Belleghem K. An inductive definition approach to ramifications. Linköping Electronic Articles in Computer and Information Science 3 7 (1998) 1-43. http://www.ep.liu.se/ea/cis/1998/007/
10. M. Denecker, E. Ternovska, A logic of non-monotone inductive definitions, ACM Transactions on Computational Logic (TOCL), 2007
11. Fages F. Consistency of Clark completion and existence of stable models. Journal of Methods of Logic in Computer Science 1 (1994) 51-60
12. Fitting M. Fixpoint semantics for logic programming a survey. Theoretical Computer Science 278 1-2 (2002) 25-51
13. Gelfond M., and Lifschitz V. Classical negation in logic programs and disjunctive databases. New Generation Computing 9 (1991) 365-385
14. Gelfond M., and Lifschitz V. Describing action and change by logic programs. Ninth Joint International Conference and Symposium on Logic Programming JICSLP'92 (1992), MIT Press
15. Giunchiglia E., Lee J., Lifschitz V., McCain N., and Turner H. Nonmonotonic causal theories. Artificial Intelligence (AIJ) 153 (2004) 49-104
16. Gurevich Y., and Shelah S. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic 32 (1986) 265-280
17. Hanks S., and McDermott D. Nonmonotonic logic and temporal projection. Artificial Intelligence 33 (1987) 379-412
18. Levesque H.J., Pirri F., and Reiter R. Foundations for the situation calculus. Electronic Transactions on Artificial Intelligence 2 (1998) 159-178
19. F. Lin, Embracing causality in specifying the indirect effects of actions, in: Proc. of IJCAI 95, 1995, pp. 1985-1991
20. Marek V.W., and Truszczyński M. Stable models and an alternative logic programming paradigm. In: Apt K.R., Marek V., Truszczyński M., and Warren D.S. (Eds). The Logic Programming Paradigm: A 25 Years Perspective (1999), Springer 375-398
21. Mariën M., Mitra R., Denecker M., and Bruynooghe M. Satisfiability checking for PC(ID). In: Sutcliffe G., and Voronkov A. (Eds). Proc. LPAR'05. Lecture Notes in Artificial Intelligence vol. 3835 (2005), Springer 565-579
22. N. McCain, H. Turner, Causal theories of action and change, in: Proc. of AAAI 97, 2007, pp. 460-465
23. McCarthy J. Circumscription-a form of nonmonotonic reasoning. Artificial Intelligence 13 (1980) 27-39
24. J. McCarthy, Elaboration tolerance, in: COMMON SENSE 98, Symposium on Logical Formalizations of Commonsense Reasoning, January 1998
25. McCarthy J., and Hayes P.J. Some philosophical problems from the standpoint of artificial intelligence. In: Meltzer B., and Michie D. (Eds). Machine Intelligence 4 (1969), Edinburgh University Press 463-502
26. McIlraith S. An axiomatic solution to the ramification problem (sometimes). Artificial Intelligence 116 1-2 (2000) 87-121
27. D. Mitchell, E. Ternovska, A framework for representing and solving NP search problems, in: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI-05), 2005, pp. 430-435
28. Moschovakis Y.N. Elementary Induction on Abstract Structures (1974), North-Holland Publishing Company, Amsterdam, New York
29. Niemelä I. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25 3,4 (1999) 241-273
30. N. Pelov, E. Ternovska, Reducing ID-logic to propositional satisfiability, in: Proceedings of the Twenty First International Conference on Logic Programming (ICLP 2005), 2005
31. Pirri F., and Reiter R. Some contributions to the metatheory of the situation calculus. ACM 46 3 (1999) 325-361
32. Reiter R. A logic for default reasoning. Artificial Intelligence 13 (1980) 81-132
33. Reiter R. 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 (1991), Academic Press, San Diego, CA 359-380
34. Reiter R. Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems (2001), MIT Press
35. Shanahan M. Solving the Frame Problem (1997), MIT Press
36. E. Ternovskaia, Causality via inductive definitions, in: Working Notes of "Prospects for a Commonsense Theory of Causation", AAAI Spring Symposium Series, March 23-28, 1998
37. Ternovskaia E. Inductive definability and the situation calculus. Transaction and Change in Logic Databases. Lecture Notes in Computer Science vol. 1472 (1998), Springer
38. Thielscher M. Ramification and causality. Journal of Artificial Intelligence 89 (1997) 317-364
39. Thielscher M. Introduction to the fluent calculus. Electronic Transactions on Artificial Intelligence 3-4 (1998) 179-192. http://www.ep.liu.se/ej/etai/1998/006/
40. Van Gelder A. An alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences 47 (1993) 185-221
41. Van Gelder A., Ross K.A., and Schlipf J.S. The well-founded semantics for general logic programs. Journal of the ACM 38 3 (1991) 620-650
42. J. Vennekens, D. Gilis, M. Denecker, Splitting an operator: Algebraic modularity results for logics with fixpoint semantics, ACM Transactions on Computational Logic (TOCL) 2006, submitted for publication