Knowledge compilation for belief change

Authors:
Maurice Pagnucco
Affiliations:
ARC Centre of Excellence for Autonomous Systems and National ICT Australia, School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW, Australia
Venue:
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Year:
2006

Citing 8
Cited 4

An incremental method for generating prime implicants/implicates

Journal of Symbolic Computation
Belief revision

Handbook of logic in artificial intelligence and logic programming (Vol. 4)
On the logic of iterated belief revision

Artificial Intelligence
Computing Prime Implicates Incrementally

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Revisions of knowledge systems using epistemic entrenchment

TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
A knowledge compilation map

Journal of Artificial Intelligence Research
Iterated theory base change: a computational model

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Found ations of assumption-based truth maintenance systems: preliminary report

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1

Prime implicates and prime implicants: from propositional to modal logic

Journal of Artificial Intelligence Research
Implementing iterated belief change via prime implicates

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Prime forms and minimal change in propositional belief bases

Annals of Mathematics and Artificial Intelligence
Knowledge-Base revision using implications as hypotheses

KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Techniques for knowledge compilation like prime implicates and binary decision diagrams (BDDs) are effective methods for improving the practical efficiency of reasoning tasks. In this paper we provide a construction for a belief contraction operator using prime implicates. We also briefly indicate how this technique can be used for belief expansion, belief revision and also iterated belief change. This simple yet novel technique has two significant features: (a) the contraction operator constructed satisfies all the AGM postulates for belief contraction; (b) when compilation has been effected only syntactic manipulation is required in order to contract the reasoner's belief state.