Skip to main navigation Skip to search Skip to main content

Characterizing relevant belief revision operators

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

6 Citations (Scopus)

Abstract

This paper introduces a framework for relevant belief revision. We represent agent's beliefs in prime implicants and express agent's preference on beliefs as a pre-order over terms. We define a belief revision operator via minimising the change of the prime implicants of the existing beliefs and the incoming information with respect to agent's preferences. We show that such a belief revision operator satisfies Katsuno and Mendelzon's postulates for belief revision as well as Parikh's postulate for relevant revision. This paper demonstrates a natural way to identify relevance of beliefs and an implementation of Parikh's relevant belief revision.
Original languageEnglish
Title of host publicationAI 2010: Advances in Artificial Intelligence: Proceedings of the 23rd Australasian Joint Conference on Artificial Intelligence, Adelaide, Australia\,7-10 December 2010
PublisherSpringer
Pages42-51
Number of pages10
ISBN (Print)9783642174315
DOIs
Publication statusPublished - 2010
EventAustralasian Joint Conference on Artificial Intelligence -
Duration: 1 Dec 2013 → …

Publication series

Name
ISSN (Print)0302-9743

Conference

ConferenceAustralasian Joint Conference on Artificial Intelligence
Period1/12/13 → …

Fingerprint

Dive into the research topics of 'Characterizing relevant belief revision operators'. Together they form a unique fingerprint.

Cite this