The well-founded semantics is the principle of inductive definition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1489, Issue , 1998, Pages 1-16

  Denecker, Marc ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION;

CONSTRUCTIVE MATHEMATICS; DEFAULT THEORY; FORMALISATION; INDUCTIVE DEFINITIONS; PERFECT MODEL; WELL-FOUNDED SEMANTICS;

SEMANTICS;

EID: 84949994421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49545-2_1     Document Type: Conference Paper

References (28)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addusin-Wesley Publishing Company, 1995.
2. P. Aczel. An Introduction to Inductive Definitions. In J. Barwise, editor, Handbook of Mathematical Logic, pages 739-782. North-Holland Publishing Company, 1977.
3. K.R. Apt, H.A. Blair, and A. Walker. Towards a theory of Declarative Knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, 1988.
4. W. Buchholz, S. Feferman, and W. Pohlers, W. Sieg. Iterated Inductive Definitions and Subsystems of Analysis: Recent Proof-Theoretical Studies. Springer-Verlag, Lecture Notes in Mathematics 897, 1981.
5. K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Databases, pages 293-322. Plenum Press, 1978.
6. M. Denecker. A Terminological Interpretation of (Abductive) Logic Programming. In V.W. Marek, A. Nerode, and M. Truszczynski, editors, International Conference on Logic Programming and Nonmonotonic Reasoning, pages 15-29. Springer, Lecture notes in Artificial Intelligence 928, 1995.
7. M. Denecker and D. De Schreye. Justification semantics: a unifying framework for the semantics of logic programs. Technical Report 157, Department of Computer Science, K.U.Leuven, 1992.
8. M. Denecker and D. De Schreye. SLDNFA: an abductive procedure for abductive logic programs. Journal of Logic Programming, 34(2):111-167, 1997.
9. S. Feferman. Formal theories for transfinite iterations of generalised inductive definitions and some subsystems of analysis. In A. Kino, J. Myhill, and R.E. Vesley, editors, Intuitionism and Proof theory, pages 303-326. North Holland, 1970.
10. M. Fitting. A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming, 2(4):295-312, 1985.
11. M. Gelfond. On Strati_ed Autoepistemic Theories. In Proc. of AAAI87, pages 207-211. Morgan Kaufman, 1987.
12. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the International Joint Conference and Symposium on Logic Programming, pages 1070-1080. IEEE, 1988.
13. M. Gelfond and V. Lifschitz. Logic Programs with Classical Negation. In D.H.D. Warren and P. Szeredi, editors, Proc. of the 7th International Conference on Logic Programming 90, page 579. MIT press, 1990.
14. M. Hagiya and T. Sakurai. Foundation of Logic Programming Based on Inductive Definition. New Generation Computing, 2:59-77, 1984.
15. G. Kreisel. Generalized inductive definitions. Technical report, Stanford University, 1963.
16. P. Martin-Löf. Hauptsatz for the intuitionistic theory of iterated inductive definitions. In J.e. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 179-216, 1971.
17. J. McCarthy. Applications of Circumscription to Formalizing Common-Sense Knowledge. Artifical Intelligence, 28:89-116, 1980.
18. Y. N. Moschovakis. Elementary Induction on Abstract Structures. North-Holland Publishing Company, Amsterdam- New York, 1974.
19. E. Post. Formal reduction of the general combinatorial decision problem. American Journal of Mathematics, 65:197-215, 1943.
20. H. Przymusinska and T.C. Przymusinski. Weakly perfect model semantics for logic programs. In R.A. Kowalski and K.A. Bowen, editors, Proc. of the fifth international conference and symposium on logic programming, pages 1106-1120. the MIT press, 1988.
21. T.C. Przymusinski. On the semantics of Strati_ed Databases. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan Kaufman, 1988.
22. T.C. Przymusinski. Well founded semantics coincides with three valued Stable Models. Fundamenta Informaticae, 13:445-463, 1990.
23. R. Reiter. The Frame Problem in the Situation Calculus: A simple Solution (Sometimes) and a Completeness Result for Goal Regression. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honour of John McCarthy, pages 359-380. Academic Press, 1991.
24. C. Spector. Inductively defined sets of natural numbers. In Infinitistic Methods (Proc. 1959 Symposium on Foundation of Mathematis in Warsaw), pages 97-102. Pergamon Press, Oxford, 1961.
25. K. Van Belleghem, M. Denecker, and D. De Schreye. A strong correspondence between description logics and open logic programming. In Lee Naish, editor, Proc. of the International Conference on Logic Programming, 1997, pages 346-360. MIT-press, 1997.
26. K. Van Belleghem, M. Denecker, and D. Theseider Dupré. Dependencies and ramifications in an event-based language. In Proc. of the Ninth Dutch Artificial Intelligence Conference, 1997, 1997.
27. M. van Emden and R.A Kowalski. The semantics of Predicate Logic as a Programming Language. Journal of the ACM, 4(4):733-742, 1976.
28. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3):620-650, 1991.