A program-level approach to revising logic programs under the answer set semantics

DOI10.1017/S1471068410000281zbMath1209.68090arXiv1007.5024OpenAlexW2002154970MaRDI QIDQ3585168

James P. Delgrande

Publication date: 19 August 2010

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.5024

zbMATH Keywords

belief revisionbelief changeanswer set programming

Mathematics Subject Classification ID

Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (4)

Belief Base Change Operations for Answer Set Programming ⋮ On updates of hybrid knowledge bases composed of ontologies and rules ⋮ AGM contraction and revision of rules ⋮ Revision of defeasible preferences

Cites Work

• A consistency-based approach for belief change
• Extending and implementing the stable model semantics
• On the logic of theory change: Partial meet contraction and revision functions
• On properties of update sequences based on causal rejection
• Dynamic updates of non-monotonic knowledge bases
• The DLV system for knowledge representation and reasoning
• Strongly equivalent logic programs

This page was built for publication: A program-level approach to revising logic programs under the answer set semantics