Non-Horn clause logic programming
From MaRDI portal
Recommendations
Cites work
- A comparison of three PROLOG extensions
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A Prolog technology theorem prover: A new exposition and implementation in Prolog
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler
- A sequent-style model elimination strategy and a positive refinement
- A Simplified Format for the Model Elimination Theorem-Proving Procedure
- A simplified problem reduction format
- Depth-first iterative-deepening: An optimal admissible tree search
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3731310 (Why is no real title available?)
- scientific article; zbMATH DE number 194009 (Why is no real title available?)
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 1090102 (Why is no real title available?)
- Near-Horn prolog and beyond
- Near-Horn Prolog and the ancestry family of procedures
- Non-Horn clause logic programming without contrapositives
- Renaming a Set of Clauses as a Horn Set
- SETHEO: A high-performance theorem prover
- The search efficiency of theorem proving strategies
Cited in
(6)- Non-Horn clause logic programming without contrapositives
- Renaming a set of non-Horn clauses
- scientific article; zbMATH DE number 4160108 (Why is no real title available?)
- scientific article; zbMATH DE number 1497833 (Why is no real title available?)
- Programming in logic without logic programming
- Predicate Completion for non-Horn Clause Sets
This page was built for publication: Non-Horn clause logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1402738)