Pages that link to "Item:Q3201745"
From MaRDI portal
The following pages link to Completed logic programs and their consistency (Q3201745):
Displaying 17 items.
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete (Q689290) (← links)
- Updating knowledge bases (Q918229) (← links)
- Acyclic logic programs and the completeness of SLDNF-resolution (Q1177925) (← links)
- Equivalence-preserving first-order unfold/fold transformation systems (Q1200980) (← links)
- Graph properties for normal logic programs (Q1208418) (← links)
- A transformation system for deductive database modules with perfect model semantics (Q1208734) (← links)
- Credolous argumentation with the disjunctive stable semantics (Q1267224) (← links)
- An alternative approach to the semantics of disjunctive logic programs and deductive databases (Q1344892) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- An abstract, argumentation-theoretic approach to default reasoning (Q1402718) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games (Q1855240) (← links)
- Synthesis of positive logic programs for checking a class of definitions with infinite quantification (Q2629858) (← links)
- Characterizations of stable model semantics for logic programs with arbitrary constraint atoms (Q3183130) (← links)
- An equivalence preserving first order unfold/fold transformation system (Q5096195) (← links)
