Modelling belief-revision functions at extended languages

Aravanis, T; Peppas, P; Williams, MA

Modelling belief-revision functions at extended languages

Aravanis, T Peppas, P Williams, MA

Permalink

Publisher:: IOS Press
Publication Type:: Conference Proceeding
Citation:: 24th European Conference on Artificial Intelligence, 2020, 325, pp. 601-607
Issue Date:: 2020-08-24

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download full textAdobe PDF (299.57 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Aravanis, T
dc.contributor.author	Peppas, P
dc.contributor.author	Williams, MA
dc.date	2020-08-29
dc.date.accessioned	2021-06-03T07:10:54Z
dc.date.available	2021-06-03T07:10:54Z
dc.date.issued	2020-08-24
dc.identifier.citation	24th European Conference on Artificial Intelligence, 2020, 325, pp. 601-607
dc.identifier.isbn	9781643681009
dc.identifier.issn	0922-6389
dc.identifier.uri	http://hdl.handle.net/10453/149395
dc.description.abstract	The policy of rational belief revision is encoded in the so-called AGM revision functions. Such functions are characterized (both axiomatically and constructively) within the well-known AGM paradigm, proposed by Alchourrón, Gärdenfors and Makinson. In this article, we show that - although not in a straightforward way - a sufficient extension of the underlying language allows for the modelling of any AGM revision function (defined at the initial language), by means of a Hamming-based rule for belief revision introduced by Dalal (defined at the extended language). The established results enrich the applicability of Dalal's proposal, leading to a conceptual and ontological reduction, as well as open new doors for the construction of any type of revision function in a practical context, given the intuitive appeal and simplicity of Dalal's construction.
dc.language	en
dc.publisher	IOS Press
dc.relation.ispartof	24th European Conference on Artificial Intelligence
dc.relation.ispartof	European Conference on Artificial Intelligence
dc.relation.ispartofseries	Frontiers in Artificial Intelligence and Applications
dc.relation.isbasedon	10.3233/FAIA200144
dc.rights	info:eu-repo/semantics/openAccess
dc.title	Modelling belief-revision functions at extended languages
dc.type	Conference Proceeding
utslib.citation.volume	325
utslib.location.activity	Spain
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/Strength - AAII - Australian Artificial Intelligence Institute
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	open_access	*
pubs.consider-herdc	false
dc.date.updated	2021-06-03T07:10:50Z
pubs.finish-date	2020-09-08
pubs.publication-status	Published
pubs.start-date	2020-08-29
pubs.volume	325

Abstract:

The policy of rational belief revision is encoded in the so-called AGM revision functions. Such functions are characterized (both axiomatically and constructively) within the well-known AGM paradigm, proposed by Alchourrón, Gärdenfors and Makinson. In this article, we show that - although not in a straightforward way - a sufficient extension of the underlying language allows for the modelling of any AGM revision function (defined at the initial language), by means of a Hamming-based rule for belief revision introduced by Dalal (defined at the extended language). The established results enrich the applicability of Dalal's proposal, leading to a conceptual and ontological reduction, as well as open new doors for the construction of any type of revision function in a practical context, given the intuitive appeal and simplicity of Dalal's construction.

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

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