Logic Programming Revisited: Logic Programs as Inductive Definitions

ACM Transactions on Computational Logic

Volumn 2, Issue 4, 2001, Pages 623-654

  Denecker, Marc ^a   Bruynooghe, Maurice ^a   Marek, Victor ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Epistemological foundations; inductive definitions; Languages; Theory

Indexed keywords

EID: 84987625889     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/383779.383789     Document Type: Article

References (72)

1. Aczel, P. 1977. An Introduction to Inductive Definitions. In Handbook of Mathematical Logic, J. Barwise, Ed. North-Holland Publishing Company, 739-782
2. Andreka, H. and Nemeti, I. 1978. The Generalized Completeness of Horn Predicate Logic as a Programming Language. Acta Cybernetica 4, 3-10
3. Apt, K. and Blair, H. 1990. Arithmetical classification of perfect models of stratified programs. Fundamenta Informaticae 13, 1, 1-17
4. Apt, K. and Bol, R. 1994. Logic programming and negation: a survey. Journal of Logic Programming 19-20, 9-71
5. Apt, K. R. and Van Emden, M. 1982. Contributions to the Theory of Declarative Knowledge. Journal of the ACM 29, 3, 841-862
6. Apt, K., Blair, H., and Walker, A. 1988. Towards a theory of Declarative Knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, 89-148
7. Barwise, J. 1977. Admissible Sets and Structures. Springer Verlag
8. Blair, H., Marek, V., and Schlipf, J. 1995. The expressiveness of locally stratified programs. Annals of Mathematics and Artificial Intelligence 15, 209-229
9. Bowen, K. and Kowalski, R. 1982. Amalgamating Language and Metalanguage in Logic Programming. In Logic Programming, K. Clark and S.-A. Tarnlund, Eds. Academic Press, 153-172
10. Brass, S. and Dix, J. 1999. Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic Programming 40, 1 (July), 1-46
11. Buchholz, W., Feferman, S., and Sieg, W. P. W. 1981. Iterated InductiveDefinitions and Subsystems of Analysis: Recent Proof-Theoretical Studies. Lecture Notes in Mathematics, vol. 897. SpringerVerlag
12. Chen, W. and Warren, D. 1996. Tabled evaluation with delaying for general logic programs. Journal of the ACM 43, 1 (January), 20-74
13. Clark, K. 1978. Negation as failure. In Logic and Databases, H. Gallaire and J. Minker, Eds. Plenum Press, 293-322
14. Colmerauer, A., Kanoui, H., Pasero, R., and Roussel, P. 1973. Un systeme de communication homme-machine en Francais. Tech. rep., GIA, University d'Aix Marseille 11, Luminy, France
15. Cousot, P. and Cousot, R. 1977. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the Fourth ACM Symp. on Principles of Programming Languages. 238-252
16. De Schreye, D. and Decorte, S. 1994. Termination of logic programs: the never-ending story. Journal of Logic Programming 19-20, 199-260
17. Denecker, M. 1995. A Terminological Interpretation of (Abductive) Logic Programming. In International Conference on Logic Programming and Nonmonotonic Reasoning, V. Marek, A. Nerode, and M. Truszczynski, Eds. Lecture notes in Artificial Intelligence 928. Springer, 15-29
18. Denecker, M. 1998. The well-founded semantics is the principle of inductive definition. In Logics in Artificial Intelligence, J. Dix, L. Fariñas del Cerro, and U. Furbach, Eds. Lecture Notes in Artificial Intelligence, vol. 1489. Springer-Verlag, 1-16
19. Denecker, M. 2000. Extending classical logic with inductive definitions. In First International Conference on Computational Logic (CL2000). Lecture Notes in Artificial Intelligence, vol. 1861. Springer, 703-717
20. Denecker, M. and De Schreye, D. 1993. Justification semantics: a unifying framework for the semantics of logic programs. In Proc. of the Logic Programming and Nonmonotonic Reasoning Workshop. MIT Press, 365-379
21. Denecker, M., Marek, V., and Truszczynski, M. 2000. Approximating operators, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In Logic-based Artificial Intelligence, J. Minker, Ed. Kluwer Academic Publishers, Boston, Chapter 6, 127-144
22. Feferman, S. 1970. Formal theories for transfinite iterations of generalised inductive definitions and some subsystems of analysis. In Intuitionism and Proof theory, A. Kino, J. Myhill, and R. Vesley, Eds. North Holland, 303-326
23. Ferry, A. 1994. Topological characterizations for logic programming semantics. Ph.D. thesis, University of Michigan
24. Fitting, M. 1985. A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming 2, 4, 295-312
25. Fitting, M. 1991. Bilattices and the semantics of logic programming. Journal of Logic Programming 11, 2 (August), 91-116
26. Fitting, M. 1993. The family of stable models. Journal of Logic Programming 17, 2,3&4, 197225
27. Fitting, M. 1997. A theory of truth that prefers falsehood. Journal of Philosophical Logic 26, 477-500
28. Fitting, M. 2001. Fixpoint semantics for logic programming - a survey. Journal of Theoretical Computer Science. To appear
29. Gelfond, M. 1987. On Stratified Autoepistemic Theories. In Proc. ofAAAI87. Morgan Kaufman, 207-211
30. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. of the International Joint Conference and Symposium on Logic Programming. MIT Press, 1070-1080
31. Gurevich, Y. and Shelah, S. 1986. Fixed-point Extensions of First-Order Logic. Annals of Pure and Applied Logic 32, 265-280
32. Kakas, A. C., Kowalski, R., and Toni, F. 1992. Abductive Logic Programming. Journal of Logic and Computation2, 6, 719-770
33. Kleene, S. 1955. Arithmetical predicates and function quantifiers. Transactions Amer. Math. Soc. 79, 312-340
34. Kolaitis, P. G. and Papadimitriou, C. H. 1991. Why not negation by fixpoint. Journal of Computer and System Sciences 43, 1, 125-144
35. Kowalski, R. 1974. Predicate logic as a programming language. In Proc. of IFIP 74. North-Holland, 569-574
36. Kreisel, G. 1963. Generalized inductive definitions. Tech. rep., Stanford University
37. Lifschitz, V. 1999. Answer set planning. In Logic Programming, Proc. 1999 Int. Conf. on Logic Programming (ICLP'99), D. De Schreye, Ed. MIT Press, 23-37
38. Lloyd, J. 1987. Foundations of Logic Programming. Springer-Verlag
39. Marek, V. and Truszczynski, M. 1989. Stable semantics for logic programs and default reasoning. In Proc. of the North American Conference on Logic Programming and Nonmonotonic Reasoning, E. Lust and R. Overbeek, Eds. 243-257
40. Marek, V. and Truszczyinski, M. 1991. Autoepistemic Logic. Journal of the ACM 38, 3, 588-619
41. Marek, V. and Truszczynski, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25 Years Perspective, K. Apt, V. Marek, M. Truszczynski, and D. Warren, Eds. Springer-Verlag, pp. 375-398
42. Marek, V., Nerode, N., and Remmel, J. 1994. The stable models of predicate logic programs. Journal of Logic Programming 21, 3, 129-154
43. Marek, W. 1989. Stable theories in autoepistemic logic. Fundamenta Informaticae 12, 2, 243-254
44. Marriott, K. and Sondergaard, H. 1993. Precise and efficient groundness analysis for logic programs. ACM-LOPLAS 2, 1-4, 181-196
45. Martens, B. and De Schreye, D. 1995. Why untyped non-ground meta-programming is not (much of) a problem. Journal of Logic Programming 22, 1 (January), 47-99
46. Martin-Lcof, P. 1971. Hauptsatz for the intuitionistic theory of iterated inductive definitions. In Proceedings of the Second Scandinavian Logic Symposium, J. Fenstad, Ed. 179-216
47. Moore, R. 1985. Semantical considerations on nonmonotonic logic. Artificial Intelligence 25, 1, 75-94
48. Moschovakis, Y. N. 1974. Elementary Induction on Abstract Structures. North-Holland Publishing Company, Amsterdam-New York
49. Niemela, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3,4, 241-273
50. Pereira, L., Aparicio, J., and Alferes, J. 1991. Hypothetical Reasoning with Well Founded Semantics. In Proc. of the 3th Scandinavian Conference on AI, B. Mayoh, Ed. lOS Press, 289300
51. Przymusinska, H. and Przymusinski, T. 1988. Weakly perfect model semantics for logic programs. In Proc. of the Fifth International Conference and Symposium on Logic Programming, R. Kowalski and K. Bowen, Eds. MIT Press, 1106-1120
52. Przymusinska, H. and Przymusinski, T. 1990. Weakly Stratified Logic Programs. Fundamenta Informaticae 13, 51-65
53. Przymusinski, T. 1988. On the declarative Semantics of Deductive Databases and Logic Programs. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufman, 193-216
54. Przymusinski, T. 1989a. Every Logic Program Has a Natural Stratification and an Iterated Least Fixed Point Model. In Proceedings of the Eight ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 11-21
55. Przymusinski, T. 1989b. On the declarative and procedural semantics of logic programs. Journal of Automated Reasoning 5, 167-205
56. Przymusinski, T. 1990. Well founded semantics coincides with three valued Stable Models. Fundamenta Informaticae 13, 445-463
57. Reichgelt, H. 1991. Knowledge Representation: an AI Perspecitive. Ablex Publishing Corporation
58. Reiter, R. 1978. On Closed WorldDatabases. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, 55-76
59. Reiter, R. 1980. A logic for default reasoning. Artificial Intelligence 13, 81-132
60. Robinson, J. 1965. A machine-oriented logic based on the resolution principle. Journal of the ACM 12, 1, 23-41
61. Schlipf, J. 1995a. Complexity and undecidability results in logic programming. Annals of Mathematics and Artificial Intelligence 15, 257-288
62. Schlipf, J. 1995b. The expressive powers of the logic programming semantics. Journal of Computer and System Sciences 51, 64-86
63. Smullyan, R. 1968. First-Order Logic, second ed. Springer, New York
64. Spector, C. 1961. Inductively defined sets ofnatural numbers. In Infinitistic Methods (Proc. 1959 Symposium on Foundation of Mathematis in Warsaw). Pergamon Press, Oxford, 97-102
65. Tamaki, H. and Sato, T. 1986. OLD resolution with tabulation. In Third International Conference on Logic Programming. Lecture Notes in Computer Science, vol. 225. Springer-Verlag, 84-98
66. Tarski, A. 1955. Lattice-theoretic fixpoint theorem and its applications. Pacific journal of Mathematics 5, 285-309
67. Van Emden, M. and Kowalski, R. 1976. The semantics of Predicate Logic as a Programming Language. Journal of the ACM 4, 4, 733-742
68. Van Gelder, A. 1988. Negation as Failure Using Tight Derivations for General Logic Programs. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, 149-176
69. Van Gelder, A. 1993. The Alternating Fixpoint of Logic Programs with Negation. Journal of Computer and System Sciences 47, 1, 185-221
70. Van Gelder, A., Ross, K. A., and Schlipf, J. 1991. The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38, 3, 620-650
71. Vardi, M. 1982. The complexity of relational query languages. In 14th ACM Symposium on Theory of Computing. 137-145
72. Verbaeten, S., Sagonas, K., and De Schreye, D. 2001. Termination proofs for logic programs with tabling. ACM Transactions on Computational Logic 2, 1, 57-92