The following pages link to Near-Horn prolog and beyond (Q757031):
Displaying 19 items.
- Parsing as non-Horn deduction (Q688151) (← links)
- A family of goal directed theorem provers based on conjunction and implication. I (Q1181711) (← links)
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639) (← links)
- On computing minimal models (Q1380414) (← links)
- Non-Horn clause logic programming (Q1402738) (← links)
- Computing answers with model elimination (Q1402748) (← links)
- Renaming a set of non-Horn clauses (Q1587332) (← links)
- Near-Horn Prolog and the ancestry family of procedures (Q1924724) (← links)
- Negation as failure for disjunctive logic programming (Q1924818) (← links)
- N-Prolog: An extension of Prolog with hypothetical implications. I. (Q3696485) (← links)
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure (Q3727349) (← links)
- A comparison of three PROLOG extensions (Q3992235) (← links)
- (Q4499256) (← links)
- (Q4812982) (← links)
- Model elimination without contrapositives (Q5210764) (← links)
- The applicability of logic program analysis and transformation to theorem proving (Q5210773) (← links)
- Lemma matching for a PTTP-based top-down theorem prover (Q5234698) (← links)
- Prolog: the next 50 years (Q6171528) (← links)
- Case-free programs: An abstraction of definite horn programs (Q6488524) (← links)
