An investigation of parametrized difference revision operators

Aravanis, T; Peppas, P; Williams, MA

An investigation of parametrized difference revision operators

Aravanis, T Peppas, P

Williams, MA

Permalink

Publication Type:: Journal Article
Citation:: Annals of Mathematics and Artificial Intelligence, 2019
Issue Date:: 2019-01-01

Recently Added

	Filename	Size
	Aravanis2019_Article_AnInvestigationOfParametrizedD.pdf	803.79 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is new to OPUS and is not currently available.

Full metadata record

Field	Value	Language
dc.contributor.author	Aravanis, T	en_US
dc.contributor.author	Peppas, P https://orcid.org/0000-0002-0008-5505	en_US
dc.contributor.author	Williams, MA https://orcid.org/0000-0002-1047-0503	en_US
dc.date.accessioned	2020-06-11T06:50:50Z
dc.date.accessioned	2020-06-11T06:50:51Z
dc.date.available	2020-06-11T06:50:50Z
dc.date.available	2020-06-11T06:50:51Z
dc.date.issued	2019-01-01	en_US
dc.identifier.citation	Annals of Mathematics and Artificial Intelligence, 2019	en_US
dc.identifier.issn	1012-2443	en_US
dc.identifier.uri	http://hdl.handle.net/10453/141324
dc.description.abstract	© 2019, Springer Nature Switzerland AG. In this article, we provide the epistemic-entrenchment and partial-meet characterizations of a new, important class of concrete revision operators (all of which satisfy the AGM postulates for revision), called Parametrized Difference revision operators (PD operators, for short). PD operators are natural generalizations of Dalal’s revision operator, with a much greater range of applicability, hence, the epistemic-entrenchment and partial-meet characterizations of the latter are also provided, as a by-product. Lastly, we prove that PD operators satisfy the strong version of Parikh’s relevance-sensitive axiom for belief revision, showing that they are fully compatible with the notion of relevance.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP160102693
dc.relation.ispartof	Annals of Mathematics and Artificial Intelligence	en_US
dc.relation.isbasedon	10.1007/s10472-019-09625-x	en_US
dc.rights	info:eu-repo/semantics/restrictedAccess
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	An investigation of parametrized difference revision operators	en_US
dc.type	Journal Article
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	recently_added	*
pubs.publication-status	Published	en_US

Abstract:

© 2019, Springer Nature Switzerland AG. In this article, we provide the epistemic-entrenchment and partial-meet characterizations of a new, important class of concrete revision operators (all of which satisfy the AGM postulates for revision), called Parametrized Difference revision operators (PD operators, for short). PD operators are natural generalizations of Dalal’s revision operator, with a much greater range of applicability, hence, the epistemic-entrenchment and partial-meet characterizations of the latter are also provided, as a by-product. Lastly, we prove that PD operators satisfy the strong version of Parikh’s relevance-sensitive axiom for belief revision, showing that they are fully compatible with the notion of relevance.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/141324