First-order logic and automated theorem proving
First-order logic and automated theorem proving
An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
CADE-10 Proceedings of the tenth international conference on Automated deduction
A knowledge level analysis of belief revision
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Optimizing the clausal normal form transformation
Journal of Automated Reasoning
Propositional knowledge base revision and minimal change
Artificial Intelligence
A unified model of qualitative belief change: a dynamical systems perspective
Artificial Intelligence
Propositional belief base update and minimal change
Artificial Intelligence
Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates
Journal of Automated Reasoning
Arbitration (or How to Merge Knowledge Bases)
IEEE Transactions on Knowledge and Data Engineering
Prime Implicant Computation Using Satisfiability Algorithms
ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
A knowledge-based framework for belief change part I: foundations
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
A survey on knowledge compilation
AI Communications
On $k$-Term DNF with the Largest Number of Prime Implicants
SIAM Journal on Discrete Mathematics
IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
Prime Implicate-based Belief Revision Operators
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
Introducing actions into qualitative simulation
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
A unified view of propositional knowledge base updates
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Syntactic characterizations of belief change operators
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
A perspective on knowledge compilation
IJCAI'01 Proceedings of the 17th international joint 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
A syntactical approach to belief update
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Knowledge compilation for belief change
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Relevant minimal change in belief update
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Hi-index | 0.00 |
This paper proposes to use prime implicants and prime implicates normal forms to represent belief sets. This representation is used, on the one hand, to define syntactical versions of belief change operators that also satisfy the rationality postulates but present better complexity properties than those proposed in the literature and, on the other hand, to propose a new minimal distance that adopts as a minimal belief unit a "fact", defined as a prime implicate of the belief set, instead of the usually adopted Hamming distance, i.e., the number of propositional symbols on which the models differ. Some experiments are also presented that show that this new minimal distance allows to define belief change operators that usually preserve more information of the original belief set.