The applicability of logic program analysis and transformation to theorem proving
From MaRDI portal
Publication:5210773
Recommendations
Cites work
- A framework for defining logics
- Case-free programs: An abstraction of definite horn programs
- scientific article; zbMATH DE number 3984612 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 236855 (Why is no real title available?)
- scientific article; zbMATH DE number 3407199 (Why is no real title available?)
- Knowledge compilation and theory approximation
- Most specific logic programs
- Near-Horn prolog and beyond
- Partial evaluation in logic programming
- The applicability of logic program analysis and transformation to theorem proving
- The TPTP problem library
- Type analysis of prolog using type graphs
Cited in
(5)- scientific article; zbMATH DE number 4092823 (Why is no real title available?)
- scientific article; zbMATH DE number 4110158 (Why is no real title available?)
- Automated theorem proving and logic programming: a natural symbiosis
- The applicability of logic program analysis and transformation to theorem proving
- Symbolic Specialization of Rewriting Logic Theories with Presto
This page was built for publication: The applicability of logic program analysis and transformation to theorem proving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210773)