Belief revision within fragments of propositional logic

DOI10.1016/j.jcss.2013.08.002zbMath1433.03044OpenAlexW2122085722MaRDI QIDQ386044

Nadia Creignou, Reinhard Pichler, Odile Papini, Stefan Woltran

Publication date: 13 December 2013

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2013.08.002

zbMATH Keywords

complexitybelief revisionfragments of propositional logicKM postulates

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42)

Related Items (8)

DL-Lite Ontology Revision Based on An Alternative Semantic Characterization ⋮ Belief Merging within Fragments of Propositional Logic ⋮ Merging in the Horn Fragment ⋮ Belief Update Within Propositional Fragments ⋮ A Unifying Perspective on Knowledge Updates ⋮ Minimal change: relevance and recovery revisited ⋮ The incremental satisfiability problem for a two conjunctive normal form ⋮ Belief revision in Horn theories

Cites Work

• The complexity of nested counterfactuals and iterated knowledge base revisions
• \(P^{NP[O(\log n)}\) and sparse turing-complete sets for NP]
• Propositional knowledge base revision and minimal change
• On the complexity of propositional knowledge base revision, updates, and counterfactuals
• Constraints, consistency and closure
• Semantical and computational aspects of Horn approximations
• First order LUB approximations: characterization and algorithms
• A Model-Theoretic Approach to Belief Change in Answer Set Programming
• Information Fusion and Revision in Qualitative and Quantitative Settings
• On the logic of theory change: Partial meet contraction and revision functions
• Knowledge compilation and theory approximation
• On properties of update sequences based on causal rejection
• Dynamic updates of non-monotonic knowledge bases
• Answer sets for consistent query answering in inconsistent databases
• An abductive framework for computing knowledge base updates
• Prime implicates and relevant belief revision
• The complexity of satisfiability problems
• A Preference-Based Framework for Updating Logic Programs
• Compilability and compact representations of revision of Horn knowledge bases
• On sentences which are true of direct unions of algebras
• Belief revision and update: Complexity of model checking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Belief revision within fragments of propositional logic