Pages that link to "Item:Q3727349"
From MaRDI portal
The following pages link to N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failure (Q3727349):
Displaying 18 items.
- Semantics of structured normal logic programs (Q444364) (← links)
- Theory of semi-instantiation in abstract argumentation (Q528522) (← links)
- Knowledgebase transformations (Q676426) (← links)
- Hypothetical datalog: Complexity and expressibility (Q915436) (← links)
- Translating propositional extended conjunctions of Horn clauses into Boolean circuits (Q964389) (← links)
- A family of goal directed theorem provers based on conjunction and implication. I (Q1181711) (← links)
- Extending Horn clause logic with implication goals (Q1186427) (← links)
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639) (← links)
- Correspondences between classical, intuitionistic and uniform provability (Q1575924) (← links)
- Near-Horn Prolog and the ancestry family of procedures (Q1924724) (← links)
- An extended constraint deductive database: theory and implementation (Q2436517) (← links)
- N-Prolog: An extension of Prolog with hypothetical implications. I. (Q3696485) (← links)
- Computation with run time skolemisation (N-Prolog part 3) (Q4275698) (← links)
- Direct deductive computation on discourse representation structures (Q4312345) (← links)
- What Is Negation in a System 2020? (Q5020169) (← links)
- Hypothetical updates, priority and inconsistency in a logic programming language (Q5101451) (← links)
- Model elimination without contrapositives (Q5210764) (← links)
- A Survey of the Proof-Theoretic Foundations of Logic Programming (Q6063891) (← links)
