The theoretical foundations of LPTP (a logic program theorem prover)
From MaRDI portal
Publication:4223458
DOI10.1016/S0743-1066(97)10013-9zbMath0911.68030MaRDI QIDQ4223458
Publication date: 19 April 1999
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Correctness and Completeness of Logic Programs ⋮ On Completeness of Logic Programs ⋮ Towards proving type safety of .NET CIL ⋮ Towards proving type safety of \(\mathrm{C}^{\#}\) ⋮ LPTP ⋮ Formal specification and verification of the C\(\#\) thread model ⋮ Finite-tree analysis for constraint logic-based languages
This page was built for publication: The theoretical foundations of LPTP (a logic program theorem prover)
