A logic of non-monotone inductive definitions and its modularity properties

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 47-60

  Denecker, Marc ^a   Ternovska, Eugenia ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SEMANTICS; SET THEORY; ALGEBRA; CODES (SYMBOLS); FORMAL LOGIC; INFORMATION SCIENCE; KNOWLEDGE REPRESENTATION; THEOREM PROVING;

ABDUCTIVE LOGIC PROGRAMMING; DELTA-I; DISJOINT SETS; INDUCTIVE DEFINITIONS; ORDERED SET; POSITIVE INDUCTION; SITUATION CALCULUS; WELL FOUNDED SEMANTICS;

LOGIC PROGRAMMING;

LOGIC PROGRAMS; NON-MONOTONIC REASONING; TEMPORAL FORMALISM;

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

References (16)

1. P. Aczel. An introduction to inductive definitions. In J. Barwise, editor, Handbook of Mathematical Logic, pages 739-782. Elsevier, 1977.
2. M. Denecker, M. Bruynooghe, and V. Marek. Logic programming revisited: Logic programs as inductive definitions. ASM Transactions on Computational Logic (TOCL), 4(2), 2001.
3. M. Denecker. The well-founded semantics is the principle of inductive definitions. In J. Dix, L. Farinas del Cerro, and U. Furbach, editors, Logics in Artificial Intelligence, volume 1489 of Lecture Notes in Artificial Intelligence, pages 1-16. Springer-Verlag, 1998.
4. M. Denecker. Extending classical logic with inductive definitions. In Proc. CL'2000, 2000.
5. A. Dawar and Y. Gurevich. Fixed point logics. The Bulletin of Symbolic Logic, 8(1):65-88, 2002.
6. M. Denecker, V. Marek, and M. Truszczynski. Approximating operators, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In J. Minker, editor, Logic-Based AI, pages 127-144. Kluwer Academic Publishers, Boston/Dordrecht/London, 2000.
7. M. Denecker, D. Theseider Duprè, and K. Van Belleghem. An inductive definition approach to ramifications. Linköping Electronic Articles in Computer and Information Science, 3(1998): nr 7, 1998. URL: http://www.ep.liu.se/ea/cis/1998/007/.
8. M. Fitting. Fixpoint semantics for logic programming - a survey. Theoretical Computer Science, 2003. To appear.
9. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
10. Y.N. Moschovakis. Elementary Induction on Abstract Structures. Amsterdam, North Holland, 1974.
11. R. Reiter. Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. MIT Press, 2001.
12. J. Schlipf. The expressive powers of the logic programming semantics. Journal of Computer and System Sciences, 51:64-86, 1995.
13. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math., 5:285-309, 1955.
14. A. Van Gelder. An alternating fixpoint of logic programs with negation. Journal of computer and system sciences, 47:185-221, 1993.
15. S. Verbaeten, M. Denecker, and D. De Scheye. Compositionality of normal open logic programs. journal of Logic Programming, 1(3):151-183, 2000.
16. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of Assoc. Comput. Mach., 38(3):620-650, 1991.