The theoretical foundations of LPTP (a logic program theorem prover)
- 1 September 1998
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 36 (3) , 241-269
- https://doi.org/10.1016/s0743-1066(97)10013-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languagesJournal of Functional Programming, 1998
- A Proof-Theoretic Framework for Logic ProgrammingPublished by Elsevier ,1998
- A logical semantics for depth-first prolog with ground negationTheoretical Computer Science, 1997
- The execution algorithm of mercury, an efficient purely declarative logic programming languageThe Journal of Logic Programming, 1996
- First-order theories for pure Prolog programs with negationArchive for Mathematical Logic, 1995
- Reasoning about Prolog programs: From modes through types to assertionsFormal Aspects of Computing, 1994
- Reasoning about Termination of Pure Prolog ProgramsInformation and Computation, 1993
- Inductive assertion method for logic programsTheoretical Computer Science, 1988
- Denotational and operational semantics for prologThe Journal of Logic Programming, 1988
- Negation in logic programmingThe Journal of Logic Programming, 1987