The theoretical foundations of LPTP (a logic program theorem prover)

Journal of Logic Programming

Volumn 36, Issue 3, 1998, Pages 241-269

  Stärk, Robert F ^a  

^a UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

Induction; Left termination; Pure prolog; Verification of logic programs

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; PROGRAMMING THEORY; PROLOG (PROGRAMMING LANGUAGE); THEOREM PROVING;

FORMAL THEORY; LOGIC PROGRAM THEOREM PROVER;

LOGIC PROGRAMMING;

EID: 0032162924     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(97)10013-9     Document Type: Article

References (22)

1. J. Andrews, A logical semantics for depth-first Prolog with ground negation. Theoretical Computer Science 184 (1,2) (1997) 105-143.
2. K.R. Apt, E. Marchiori, Reasoning about Prolog programs: From modes through types to assertions, Formal Aspects of Computing 6 (6A) (1994) 743-765.
3. K.R. Apt, D. Pedreschi, Reasoning about termination of pure Prolog programs, Information and Computation 106 (1) (1993) 109-157.
4. M. Baudinet, Proving termination properties of Prolog programs: a semantic approach, in: Proceedings of the Third Annual IEEE Symposium on Logic in Computer Science (LICS '88), IEEE Computer Soc. Press, Silver Spring, MD, Edinburgh, Scotland, 1988, pp. 336-347.
5. R. Boyer, J. Moore, A Computational Logic Handbook, Academic Press, New York, 1988.
6. K.L. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Data Bases. Plenum Press, New York, 1978, pp. 293-322.
7. S.K. Debray, P. Mishra, Denotational and operational semantics for Prolog, J. Logic Programming 5 (1) (1988) 61-91.
8. K. Doets, From Logic to Logic Programming, MIT Press, Cambridge, MA, 1994.
9. W. Drabent, J. Maluszyński, Inductive assertion method for logic programs, Theoretical Computer Science 59 (1988) 133-155.
10. B. Elbl, Deklarative Semantik von Logikprogrammen mit PROLOGS Auswertungsstrategie, Ph.D. Thesis, Universität der Bundeswehr, München, Germany (1994).
11. S. Feferman, Logics for termination and correctness of functional programs, in: Y.N. Moschovakis (Ed.), Logic from Computer Science, Springer, New York, 1992, pp. 95-127.
12. S. Feferman, Logics for termination and correctness of functional programs, II. Logics of strength PRA, in: P. Aczel, H. Simmons, S.S. Wainer (Eds.), Proof Theory, Cambridge Univ. Press, Cambridge, 1992, pp. 195-225.
13. G. Jäger, R.F. Stärk, A proof-theoretic framework for logic programming, in: S.R. Buss (Ed.), Handbook of Proof Theory (to appear).
14. M. Kalsbeek, Meta logics for logic programming, Ph.D. Thesis, ILLC Dissertation Series 1995-13, University of Amsterdam (1995).
15. K. Kunen, Negation in logic programming, J. Logic Programming 4 (4) (1987) 289-308.
16. L.T. McCarty, Proving inductive properties of Prolog programs in second-order intuitionistic logic, in: D.S. Warren (Ed.), Proceedings of the Tenth International Conference on Logic Programming, Budapest, MIT Press, Cambridge, MA, 1993, pp. 44-63.
17. Y.N. Moschovakis, Elementary Induction on Abstract Structures, North-Holland, Amsterdam, 1974.
18. F. Pfenning (Ed.), Types in Logic Programming, MIT Press, Cambridge, MA, 1992.
19. Z. Somogyi, F. Henderson, T. Conway, The execution algorithm of Mercury, an efficient purely declarative logic programming language, J. Logic Programming 29 (1-3) (1996) 17-64.
20. R.F. Stärk, The declarative semantics of the Prolog selection rule, in: Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science (LICS '94). Paris, France, IEEE Computer Soc. Press, Silver Spring, MD, July 1994, pp. 232-261.
21. R.F. Stärk, First-order theories for pure Prolog programs with negation, Archive for Mathematical Logic 34 (2) (1995) 113-144.
22. R.F. Stärk, Why the constant 'undefined'? Logics of partial terms for strict and non-strict functional programming languages, J. Functional Programming (to appear).