A logic for default reasoning

DOI10.1016/0004-3702(80)90014-4zbMath0435.68069WikidataQ56048230 ScholiaQ56048230MaRDI QIDQ1140434

S. H. Smith

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)90014-4

zbMATH Keywords

logic for default reasoning; incompletely specified worlds; top down resolution theorem prover

Mathematics Subject Classification ID

DB lookup for MSC labels failed

Related Items

European Summer Meeting of the Association for Symbolic Logic, General logical databases and programs: Default logic semantics and stratification, Nonmonotonic reasoning, preferential models and cumulative logics, Impediments to universal preference-based default theories, Hard problems for simple default logics, The effect of knowledge on belief: Conditioning, specificity and the lottery paradox in default reasoning, Three-valued nonmonotonic formalisms and semantics of logic programs, Default knowledge and measures of specificity, Cumulative default logic: In defense of nonmonotonic inference rules, A general framework for reason maintenance, The theory of nomic probability, Nonmonotonicity and the scope of reasoning, On the consistency of defeasible databases, How complicated is the set of stable models of a recursive logic program?, What does a conditional knowledge base entail?, Resolving ambiguity in nonmonotonic inheritance hierarchies, An explication of reasoning in multiple inheritance systems through non- monotonic Horn clause logic, Stable and extension class theory for logic programs and default logics, The relationship between stable, supported, default and autoepistemic semantics for general logic programs, On the complexity of propositional knowledge base revision, updates, and counterfactuals, A logic of knowledge and justified assumption, How to reason defeasibly, A logic for reasoning with inconsistent knowledge, Saying more with frames: Slots as classes, Relating minimal models and pre-requisite-free normal defaults, Ordered seminormal default theories and their extensions, Revision in ACMS, Nonmonotonic consequence based on intuitionistic logic