The mathematics of non-monotonic reasoning
From MaRDI portal
Cited in
(26)- Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning
- Saturation, nonmonotonic reasoning and the closed-world assumption
- Completeness results for circumscription
- On the computability of circumscription
- A natural semantics for modal logic over databases
- An approach to default reasoning based on a first-order conditional logic: Revised report
- Autocircumscription
- Nonmonotonic logic and temporal projection
- The importance of open and recursive circumscription
- Results on translating defaults to circumscription
- Eliminating the fixed predicates from a circumscription
- Circumscription - a form of non-monotonic reasoning
- Abstract minimality and circumscription
- The value of the four values
- First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment
- A tableau prover for domain minimization
- Obligation as optimal goal satisfaction
- Complexity and undecidability results for logic programming
- My Life as a Logician
- Circumscription within monotonic inferences
- General domain circumscription and its first-order reduction
- Only persistence makes nonmonotonicity monotonous (extended abstract)
- John McCarthy's legacy
- A theorem on the consistency of circumscription
- Decidability and definability with circumscription
- Circumscription: Completeness reviewed
This page was built for publication: The mathematics of non-monotonic reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140442)