Easy problems for tree-decomposable graphs
Journal of Algorithms
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Propositional knowledge base revision and minimal change
Artificial Intelligence
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Monadic Second Order Logic on Graphs with Local Cardinality Constraints
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Bounded treewidth as a key to tractability of knowledge representation and reasoning
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Introducing actions into qualitative simulation
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Algorithms for propositional model counting
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
| Hi-index | 0.00 |
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, with the ones by Dalal or Satoh being two of the most fundamental ones. As is well known, most computational tasks in this area are intractable. Therefore, in practical applications, one requires sufficient conditions under which revision problems become efficiently solvable. In this paper, we identify such tractable fragments for the reasoning and the enumeration problem exploiting the notion of treewidth. More specifically, we present new algorithms based on dynamic programming for these problems in Dalal's setting and a tractability proof using Courcelle's Theorem for Satoh's approach.