The rise and fall of semantic rule updates based onSE-models

DOI10.1017/S1471068413000100zbMath1302.68254arXiv1306.3884MaRDI QIDQ2933088

João Leite, Martin Slota

Publication date: 10 December 2014

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

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

zbMATH Keywords

supportbelief updateanswer-set programsliteral inertiarule updateSE-models

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (6)

Default Negation as Explicit Negation plus Update ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ A denotational semantics for equilibrium logic ⋮ Characterization of logic program revision as an extension of propositional revision ⋮ On updates of hybrid knowledge bases composed of ontologies and rules ⋮ On the limits of forgetting in answer set programming

Cites Work

• Unnamed Item
• Unnamed Item
• Logics in artificial intelligence. 10th European conference, JELIA 2006, Liverpool, UK, September 13--15, 2006. Proceedings
• The polynomial-time hierarchy
• Artificial intelligence and mathematics. 1
• Progress in artificial intelligence. 11th Portuguese conference on artificial intelligence, EPIA 2003, Beja, Portugal, December 4--7, 2003. Proceedings
• Propositional belief base update and minimal change
• Logic programming and nonmonotonic reasoning. 9th international conference, LPNMR 2007, Tempe, AZ, USA, May 15--17, 2007. Proceedings
• The refinement extension principle for semantics of dynamic logic programming
• On the logic of theory change: Partial meet contraction and revision functions
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Dynamic updates of non-monotonic knowledge bases
• Strong equivalence made easy: nested expressions and weight constraints
• An abductive framework for computing knowledge base updates
• Logic program-based updates
• Updates in answer set programming: An approach based on basic structural properties
• Propositional theories are strongly equivalent to logic programs
• Strongly equivalent logic programs

This page was built for publication: The rise and fall of semantic rule updates based onSE-models