The following pages link to A circumscriptive theorem prover (Q1123640):
Displaying 21 items.
- Compiling a default reasoning system into Prolog (Q750134) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
- Linear resolution for consequence finding (Q1199916) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- How to reason defeasibly (Q1199924) (← links)
- Prolog technology for default reasoning: proof theory and compilation techniques (Q1275596) (← links)
- The open logic and its relation to circumscription (Q1297717) (← links)
- The complexity of propositional closed world reasoning and circumscription (Q1329160) (← links)
- A tableau prover for domain minimization (Q1344878) (← links)
- Tableau-based characterization and theorem proving for default logic (Q1344885) (← links)
- Sound and efficient closed-world reasoning for planning (Q1399125) (← links)
- An abstract, argumentation-theoretic approach to default reasoning (Q1402718) (← links)
- Reducing belief revision to circumscription (and vice versa) (Q1402725) (← links)
- Compiling specificity into approaches to nonmonotonic reasoning (Q1402752) (← links)
- Modality and interrupts (Q1891265) (← links)
- ECWA made easy (Q1924727) (← links)
- Modular specifications with supernormal defaults (Q1924749) (← links)
- An SE-tree-based prime implicant generation algorithm (Q1924815) (← links)
- An extension of pointwise circumscription (Q2676573) (← links)
- A sequent calculus for skeptical Default Logic (Q4610318) (← links)
