The following pages link to (Q3493327):
Displaying 15 items.
- Proof complexity of propositional default logic (Q647339) (← links)
- The complexity of path-based defeasible inheritance (Q685542) (← links)
- Inheritance comes of age: applying nonmonotonic techniques to problems in industry (Q1274763) (← links)
- On Stein's paper: Resolving ambiguity in nonmonotonic inheritance hierarchies (Q1341669) (← links)
- Seminormal stratified default theories (Q1380425) (← links)
- Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions (Q1392104) (← links)
- Dynamic reasoning with qualified syllogisms (Q1402719) (← links)
- Yet some more complexity results for default logic (Q1606113) (← links)
- Reasoning with power defaults (Q1882904) (← links)
- Well-founded and stationary models of logic programs (Q1924748) (← links)
- Connections between default reasoning and partial constraint satisfaction (Q1961815) (← links)
- Limited reasoning in first-order knowledge bases with full introspection (Q2171268) (← links)
- Model-preference default theories (Q2638818) (← links)
- Two simple characterizations of well-founded semantics (Q5096858) (← links)
- Reasoning with stratified default theories (Q5101456) (← links)
