Chapter IX A proof-theoretic framework for logic programming

Studies in Logic and the Foundations of Mathematics

Volumn 137, Issue C, 1998, Pages 639-682

  Jäger, Gerhard ^a   Stärk, Robert F ^b  

^a UNIVERSITY OF BERN   (Switzerland)

^b UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956667216     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(98)80024-4     Document Type: Chapter

References (43)

1. Ch. 10. Apt K.R. Logic programming. In: van Leeuwen J. (Ed). Handbook of Theoretical Computer Science Volume B (1990), Elsevier 495-574
2. Apt K.R., and Bol R. Logic programming and negation: A survey. J. of Logic Programming 19/20 (1994) 9-72
3. Belnap N.D. A useful four-valued logic. In: Dunn J.M., and Epstein G. (Eds). Modern Uses of Multiple-Valued Logic (1977), D. Reidel, Dordrecht 8-37
4. Blair H.A. The recursion-theoretic complexity of the semantics of predicate logic as a programming language. Information and Control 54 (1982) 25-47
5. Buchholz W. A negation as failure calculus. tech. rep. (1992), University of Munich
6. Cavedon L., and Lloyd J.W. A completeness theorem for SLDNF-resolution. J. of Logic Programming 7 (1989) 177-191
7. Clark K.L. Negation as failure. In: Gallaire H., and Minker J. (Eds). Logic and Data Bases (1978), Plenum Press, New York 293-322
8. Doets K. From Logic to Logic Programming (1994), MIT Press
9. Drabent W., and Martelli M. Strict completion of logic programs. New Generation Computing 9 (1991) 69
10. van Emden M.H., and Kowalski R.A. The semantics of predicate logic as a programming language. J. of the Association for Computing Machinery 4 (1976) 733-742
11. Feferman S. Reflecting on incompleteness. J. of Symbolic Logic 56 (1991) 1-49
12. Fitting M. A Kripke-Kleene semantics for logic programs. J. of Logic Programming 2 (1985) 295-312
13. Fitting M. Bilattices and the semantics of logic programming. J. of Logic Programming 11 (1991) 91-116
14. Ginsberg M.L. Multi-valued logics. In: Ginsberg M.L. (Ed). Readings in Nonmonotonic Reasoning (1987), Morgan Kaufmann 251-255
15. Girard J.-Y. Linear logic. Theoretical Computer Science 50 (1987) 1-102
16. Girard J.-Y. Proof Theory and Logical Complexity (1987), Bibliopolis, Napoli
17. Girard J.-Y., Lafont Y., and Taylor P. Proofs and Types (1989), Cambridge University Press
18. Hallnäs L., and Schroeder-heister P. A proof-theoretic approach to logic programming. I. Clauses as rules. J. of Logic and Computation 1 (1990) 261-283
19. Hösli B., and Jäger G. About some symmetries of negation. J. of Symbolic Logic 59 (1994) 473-485
20. Jäger G. Non-monotonic reasoning by axiomatic extensions. In: Fenstad J.E., Frolov I.T., and Hilpinen R. (Eds). Logic, Methodology and Philosophy of Science VIII (1989), North-Holland, Amsterdam 93-110
21. Jäger G. A deductive approach to logic programming. In: Schwichtenberg H. (Ed). Proof and Computation. Series F: Computer and Systems Sciences, NATO Advanced Study Institute, International Summer School held in Marktoberdorf, Germany (1993-1994), Springer-Verlag, Berlin 133-172
22. Kunen K. Negation in logic programming. J. of Logic Programming 4 (1987) 289-308
23. Kunen K. Signed data dependencies in logic programs. J. of Logic Programming 7 (1989) 231-245
24. Lassez J.-L., and Maher M.J. Optimal fixed points of logic programs. Theoretical Computer Science 39 (1985) 15-25
25. Lloyd J.W. Foundations of Logic Programming. second ed (1987), Springer-Verlag, Berlin
26. ch. 23. Mal'cev A.I. Axiomatizable classes of locally free algebras of various types. The Metamathematics of Algebraic Systems, Collected Papers (1971), North-Holland, Amsterdam 262-281
27. Miller D. A logic programming language with lambda-abstraction, function variables and simple unification. J. of Logic and Computation 1 (1991) 497-536
28. Moschovakis Y.N. Elementary Induction on Abstract Structures (1974), North-Holland, Amsterdam
29. Mycroft A. Logic programs and many-valued logic. In: Fontet M., and Mehlhorn K. (Eds). STACS 84: Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science #166 (1984), Springer-Verlag, Berlin 274-286
30. Pfenning F. Types in Logic Programming (1992), MIT Press
31. Robinson J.A. A machine-oriented logic based on the resolution principle. J. Ass Comp. Mach. 12 (1965) 23-41
32. Schroeder-Heister P. Hypothetical reasoning and definitional reflection in logic programming. In: Schroeder-Heister P. (Ed). Extensions of Logic Programming. Lecture Notes in Computer Science #475 (Lecture Notes in Artificial Intelligence) (1991), Springer-Verlag, Berlin 327-339
33. Schütte K. Proof Theory (1977), Springer-Verlag, Berlin
34. Shepherdson J.C. Language and Equality Theory in Logic Programming. Tech. Rep. PM-88-08 (1988), University of Bristol
35. Shepherdson J.C. A sound and complete semantics for a version of negation as failure. Theoretical Computer Science 65 (1989) 343-371
36. Shepherdson J.C. Logics for negation as failure. In: Moschovakis Y.N. (Ed). Logic from Computer Science (1992), Springer-Verlag, Berlin 521-583
37. Stärk R.F. A complete axiomatization of the three-valued completion of logic programs. J. of Logic and Computation 1 (1991) 811-834
38. Stärk R.F., and Stärk R.F. Cut-property and negation as failure. Input/output dependencies of normal logic programs. International Journal of Foundations, of Computer Science 5 (1994) 129-164
39. Stärk R.F., and Stärk R.F. Cut-property and negation as failure. J. of Logic and Computation 4 (1994) 249-262
40. Stärk R.F. From logic programs to inductive definitions. In: Hodges W. (Ed). Logic: From Foundations to Applications. Proceedings of Logic Colloquium '93 (1996), Oxford University Press 453-481
41. Tait W.W. Normal derivability in classical logic. In: Barwise J. (Ed). The Syntax and Semantics of Infinitary Languages. Lecture Notes in Mathematics #72 (1968), Springer-Verlag, Berlin 204-236
42. Takeuti G. Proof Theory (1987), North-Holland, Amsterdam
43. Van Gelder A., and Schlipf J.S. Commonsense axiomatizations for logic programs. J. of Logic Programming 17 (1993) 161-195