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

DOI10.1016/S0743-1066(97)10013-9MaRDI QIDQ4223458zbMATH OpenFDO

Authors Robert F. Stärk

Publication date 19 April 1999

Published in The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

logic programpure Prolog

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 3986671
• A Prolog technology theorem prover: A new exposition and implementation in Prolog
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• An examination of the prolog technology theorem-prover

Cited in

(15)

• scientific article; zbMATH DE number 1809864 (Why is no real title available?)
• On completeness of logic programs
• Correctness and completeness of logic programs
• The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
• A Prolog technology theorem prover: A new exposition and implementation in Prolog
• LPTP
• Towards proving type safety of \(\mathrm{C}^{\#}\)
• scientific article; zbMATH DE number 1163485 (Why is no real title available?)
• The rue theorem-proving system: The complete set of LIM+ challenge problems
• Voting theory in the Lean theorem prover
• Formal specification and verification of the C\(\#\) thread model
• Towards proving type safety of .NET CIL
• Finite-tree analysis for constraint logic-based languages
• scientific article; zbMATH DE number 3986671 (Why is no real title available?)
• scientific article; zbMATH DE number 3965464 (Why is no real title available?)

This page was built for publication: The theoretical foundations of LPTP (a logic program theorem prover)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4223458)