The following pages link to (Q3490987):
Displaying 14 items.
- Conditional entailment: bridging two approaches to default reasoning. (Q989161) (← links)
- Evaluating dialectical structures (Q1025574) (← links)
- Eliminating the fixed predicates from a circumscription (Q1119564) (← links)
- A circumscriptive theorem prover (Q1123640) (← links)
- How to reason defeasibly (Q1199924) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- Lexicographic priorities in default logic (Q1277698) (← links)
- An abstract, argumentation-theoretic approach to default reasoning (Q1402718) (← links)
- ECWA made easy (Q1924727) (← links)
- Modular specifications with supernormal defaults (Q1924749) (← links)
- Bayesian ranking for strategy scheduling in automated theorem provers (Q2104545) (← links)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models (Q3534658) (← links)
- (Q4946094) (← links)
- Logic Programming (Q5313197) (← links)