Solving logic program conflict through strong and weak forgettings

DOI10.1016/j.artint.2006.02.002zbMath1131.68037OpenAlexW2114549239MaRDI QIDQ2457621

Norman Y. Foob, Yan Zhanga

Publication date: 23 October 2007

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

Full work available at URL: http://hdl.handle.net/10072/2700

zbMATH Keywords

computational complexityknowledge representationanswer set semanticsconflict solvinglogic program update

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic programming (68N17)

Related Items (15)

Semantic forgetting in answer set programming ⋮ Preserving Strong Equivalence while Forgetting ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ Knowledge forgetting in propositional \(\mu\)-calculus ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions ⋮ From forgetting signature elements to forgetting formulas in epistemic states ⋮ On the limits of forgetting in answer set programming ⋮ Reasoning under inconsistency: a forgetting-based approach ⋮ Multi-shot ASP solving with clingo ⋮ On syntactic forgetting under uniform equivalence ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Forgetting in multi-agent modal logics ⋮ Knowledge forgetting: properties and applications ⋮ On Quantifying Literals in Boolean Logic and its Applications to Explainable AI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A three-valued semantics for deductive databases and logic programs
• Propositional belief base merging or how to merge beliefs/goals coming from several sources and some links with social choice theory
• Partial deduction in disjunctive logic programming
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Two results for prioritized logic programming
• On properties of update sequences based on causal rejection
• Reasoning about evolving nonmonotonic knowledge bases
• Logic program-based updates
• Logics in Artificial Intelligence
• Strongly equivalent logic programs
• On strongest necessary and weakest sufficient conditions

This page was built for publication: Solving logic program conflict through strong and weak forgettings