Results on translating defaults to circumscription

DOI10.1016/0004-3702(87)90064-6zbMath0667.03014OpenAlexW1982644464MaRDI QIDQ1117211

Tomasz Imielinski

Publication date: 1987

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(87)90064-6

zbMATH Keywords

nonmonotonic reasoningabnormality theorytranslation of defaults into circumscription

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) Artificial intelligence (68T99)

Related Items (10)

On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics ⋮ On the relation between default and autoepistemic logic ⋮ On the relationship between circumscription and negation as failure ⋮ Reducing belief revision to circumscription (and vice versa) ⋮ General logical databases and programs: Default logic semantics and stratification ⋮ The relationship between stable, supported, default and autoepistemic semantics for general logic programs ⋮ Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics ⋮ Seminormalizing a default theory ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ Evaluating the effect of semi-normality on the expressiveness of defaults

Cites Work

• Completeness results for circumscription
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Non-monotonic logic. I
• The mathematics of non-monotonic reasoning

This page was built for publication: Results on translating defaults to circumscription