Characterization of logic program revision as an extension of propositional revision
From MaRDI portal
Publication:4593020
DOI10.1017/S1471068415000101zbMath1379.68302arXiv1506.08919OpenAlexW2210653761MaRDI QIDQ4593020
Nicolas Schwind, Katsumi Inoue
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.08919
Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Logic programming (68N17)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Propositional knowledge base revision and minimal change
- AGM-Style Belief Revision of Logic Programs under Answer Set Semantics
- Characterization Theorems for Revision of Logic Programs
- The rise and fall of semantic rule updates based onSE-models
- A Model-Theoretic Approach to Belief Change in Answer Set Programming
- On Semantic Update Operators for Answer-Set Programs
- On the logic of theory change: Partial meet contraction and revision functions
- Negation as failure in the head
- On properties of update sequences based on causal rejection
- Dynamic updates of non-monotonic knowledge bases
- Merging Logic Programs under Answer Set Semantics
- Merging Information Under Constraints: A Logical Framework
- Strong equivalence made easy: nested expressions and weight constraints
- An abductive framework for computing knowledge base updates
- Logic program-based updates
- A Preference-Based Framework for Updating Logic Programs
- Propositional theories are strongly equivalent to logic programs
- Strongly equivalent logic programs
- Belief revision and update: Complexity of model checking
This page was built for publication: Characterization of logic program revision as an extension of propositional revision