Belief Revision with Bounded Treewidth

DOI10.1007/978-3-642-04238-6_22MaRDI QIDQ3643123zbMATH OpenOpenAlexFDO

Authors Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Publication date 10 November 2009

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04238-6_22

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27)

Recommendations

• Bounded treewidth as a key to tractability of knowledge representation and reasoning
• The size of a revised knowledge base
• An approximate approach to belief revision
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• scientific article; zbMATH DE number 108002

Cited in

(6)

• Boosting distance-based revision using SAT encodings
• Bounded treewidth as a key to tractability of knowledge representation and reasoning
• Backdoors to tractable answer set programming
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Default logic and bounded treewidth
• Limited-knowledge propositional announcement synthesis under Dalal revision: tight PH bounds, parameterized tractability and kernelization

This page was built for publication: Belief Revision with Bounded Treewidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643123)