Characterizing relevant belief revision operators

Laurent Perrussel; Jerusa Marchi; Dongmo Zhang

doi:10.1007/978-3-642-17432-2_5

Characterizing relevant belief revision operators

Laurent Perrussel, Jerusa Marchi, Dongmo Zhang

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

6 Citations (Scopus)

Abstract

![CDATA[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 language	English
Title of host publication	AI 2010: Advances in Artificial Intelligence: Proceedings of the 23rd Australasian Joint Conference on Artificial Intelligence, Adelaide, Australia\,7-10 December 2010
Publisher	Springer
Pages	42-51
Number of pages	10
ISBN (Print)	9783642174315
DOIs	https://doi.org/10.1007/978-3-642-17432-2_5
Publication status	Published - 2010
Event	Australasian Joint Conference on Artificial Intelligence - Duration: 1 Dec 2013 → …

Publication series

Name
ISSN (Print)	0302-9743

Conference

Conference	Australasian Joint Conference on Artificial Intelligence
Period	1/12/13 → …

Access to Document

10.1007/978-3-642-17432-2_5

Cite this

@inproceedings{03e2d20c930540d0bd4bb0644e5a5fd2,

title = "Characterizing relevant belief revision operators",

abstract = "![CDATA[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.]]",

author = "Laurent Perrussel and Jerusa Marchi and Dongmo Zhang",

year = "2010",

doi = "10.1007/978-3-642-17432-2_5",

language = "English",

isbn = "9783642174315",

publisher = "Springer",

pages = "42--51",

booktitle = "AI 2010: Advances in Artificial Intelligence: Proceedings of the 23rd Australasian Joint Conference on Artificial Intelligence, Adelaide, Australia\,7-10 December 2010",

note = "Australasian Joint Conference on Artificial Intelligence ; Conference date: 01-12-2013",

}

Perrussel, L, Marchi, J & Zhang, D 2010, Characterizing relevant belief revision operators. in AI 2010: Advances in Artificial Intelligence: Proceedings of the 23rd Australasian Joint Conference on Artificial Intelligence, Adelaide, Australia\,7-10 December 2010. Springer, pp. 42-51, Australasian Joint Conference on Artificial Intelligence, 1/12/13. https://doi.org/10.1007/978-3-642-17432-2_5

Characterizing relevant belief revision operators. / Perrussel, Laurent; Marchi, Jerusa; Zhang, Dongmo.
AI 2010: Advances in Artificial Intelligence: Proceedings of the 23rd Australasian Joint Conference on Artificial Intelligence, Adelaide, Australia\,7-10 December 2010. Springer, 2010. p. 42-51.

Research output: Chapter in Book / Conference Paper › Conference Paper › peer-review

TY - GEN

T1 - Characterizing relevant belief revision operators

AU - Perrussel, Laurent

AU - Marchi, Jerusa

AU - Zhang, Dongmo

PY - 2010

Y1 - 2010

N2 - ![CDATA[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.]]

AB - ![CDATA[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.]]

UR - http://handle.uws.edu.au:8081/1959.7/562481

UR - http://ai10.cis.unisa.edu.au/

U2 - 10.1007/978-3-642-17432-2_5

DO - 10.1007/978-3-642-17432-2_5

M3 - Conference Paper

SN - 9783642174315

SP - 42

EP - 51

BT - AI 2010: Advances in Artificial Intelligence: Proceedings of the 23rd Australasian Joint Conference on Artificial Intelligence, Adelaide, Australia\,7-10 December 2010

PB - Springer

T2 - Australasian Joint Conference on Artificial Intelligence

Y2 - 1 December 2013

ER -

Characterizing relevant belief revision operators

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this