A decomposition based algorithm for maximal contractions

DOI10.1007/S11704-013-3089-ZzbMath1425.68393OpenAlexW2039120963MaRDI QIDQ2418656

Zhengzhong Liao, Jie Luo, Yihua Lou, Dongchen Jiang, Wei Li

Publication date: 28 May 2019

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-013-3089-z

zbMATH Keywords

belief changemaximal contractiondecomposing rulesrevision algorithm

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Classical propositional logic (03B05)

Cites Work

• Unnamed Item
• Unnamed Item
• \textbf{R}-calculus without the cut rule
• An algorithm to compute maximal contractions for Horn clauses
• A consistency-based approach for belief change
• A development calculus for specifications
• On the logic of iterated belief revision
• A general framework for computing maximal contractions
• On the logic of theory change: Partial meet contraction and revision functions
• A representative model based algorithm for maximal contractions
• Logical verification of scientific discovery

This page was built for publication: A decomposition based algorithm for maximal contractions