Loop formulas for circumscription

DOI10.1016/j.artint.2005.09.003zbMath1131.68105OpenAlexW2123741728MaRDI QIDQ2457644

Joohyung Lee, Fangzhen Lin

Publication date: 23 October 2007

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

Full work available at URL: https://doi.org/10.1016/j.artint.2005.09.003

zbMATH Keywords

Logic programmingCommonsense reasoningNonmonotonic reasoningKnowledge representationCircumscriptionClark's completionLoop formulas

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items (5)

On elementary loops of logic programs ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Implementing Prioritized Circumscription by Computing Disjunctive Stable Models ⋮ Stable models and circumscription ⋮ ASSAT: computing answer sets of a logic program by SAT solvers

Uses Software

• ASSAT
• CCalc

Cites Work

• Nonmonotonic causal theories
• Representing the Zoo World and the Traffic World in the language of the Causal Calculator
• Answer set programming based on propositional satisfiability
• On the logic of causal explanation
• Circumscription - a form of non-monotonic reasoning
• Computing circumscription revisited: A reduction algorithm
• Nested expressions in logic programs
• Tight logic programs
• Logic Programming
• Why are there so many loop formulas?
• Logic Programming and Nonmonotonic Reasoning
• On strongest necessary and weakest sufficient conditions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Loop formulas for circumscription