The following pages link to (Q4028795):
Displaying 30 items.
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies (Q286087) (← links)
- Graph theoretical structures in logic programs and default theories (Q672050) (← links)
- A causal approach to nonmonotonic reasoning (Q814640) (← links)
- Default logic generalized and simplified (Q1028638) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- Reasoning by cases in Default Logic (Q1128615) (← links)
- A logic of knowledge and justified assumption (Q1199920) (← links)
- Relating minimal models and pre-requisite-free normal defaults (Q1205716) (← links)
- On the relation between default and modal nonmonotonic reasoning (Q1274266) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- Lexicographic priorities in default logic (Q1277698) (← links)
- Operational concepts of nonmonotonic logics. I: Default logic (Q1333283) (← links)
- Deontic logic as founded on nonmonotonic logic (Q1353848) (← links)
- Operational characterization of extensions in some logics for default reasoning (Q1364501) (← links)
- Polynomial-time computable stable models (Q1380428) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- Reasoning with power defaults (Q1882904) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Assumption-based argumentation for extended disjunctive logic programming (Q2103901) (← links)
- Free choice reasons (Q2219154) (← links)
- Rule Calculus: Semantics, Axioms and Applications (Q3532483) (← links)
- (Q5020979) (← links)
- Update by means of inference rules (Q5101448) (← links)
- Skeptical rational extensions (Q5101455) (← links)
- Cumulativity Tailored for Nonmonotonic Reasoning (Q5172609) (← links)
- Semi-representability of default theories in rational default logic (Q5236433) (← links)
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming (Q5504653) (← links)
- Default logic and bounded treewidth (Q5918613) (← links)
- Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs (Q6063883) (← links)
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming (Q6566627) (← links)
