Near-Horn prolog and beyond
From MaRDI portal
Publication:757031
Recommendations
Cited in
(19)- A family of goal directed theorem provers based on conjunction and implication. I
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic
- On computing minimal models
- Non-Horn clause logic programming
- Computing answers with model elimination
- Renaming a set of non-Horn clauses
- Near-Horn Prolog and the ancestry family of procedures
- Negation as failure for disjunctive logic programming
- N-Prolog: An extension of Prolog with hypothetical implications. I.
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure
- A comparison of three PROLOG extensions
- scientific article; zbMATH DE number 1497833 (Why is no real title available?)
- scientific article; zbMATH DE number 2090546 (Why is no real title available?)
- Model elimination without contrapositives
- The applicability of logic program analysis and transformation to theorem proving
- Lemma matching for a PTTP-based top-down theorem prover
- Prolog: the next 50 years
- Case-free programs: An abstraction of definite horn programs
- Parsing as non-Horn deduction
This page was built for publication: Near-Horn prolog and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757031)