The mathematics of non-monotonic reasoning
From MaRDI portal
Publication:1140442
DOI10.1016/0004-3702(80)90013-2zbMath0435.68075OpenAlexW2040326164MaRDI QIDQ1140442
Publication date: 1980
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(80)90013-2
Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) Artificial intelligence (68T99)
Related Items
A tableau prover for domain minimization, 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, Obligation as optimal goal satisfaction, Complexity and undecidability results for logic programming, Circumscription - a form of non-monotonic reasoning, Circumscription within monotonic inferences, General domain circumscription and its first-order reduction, My Life as a Logician, Abstract minimality and circumscription, Circumscription: Completeness reviewed, John McCarthy's legacy, A theorem on the consistency of circumscription, Decidability and definability with circumscription, Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning, The value of the four values, Only persistence makes nonmonotonicity monotonous, Saturation, nonmonotonic reasoning and the closed-world assumption, First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment, Completeness results for circumscription
