Erratum to: Database preference queries - a possibilistic logic approach with symbolic priorities

Dubois, D; Hadjali, A; Prade, H; Touazi, F

Erratum to: Database preference queries - a possibilistic logic approach with symbolic priorities

Dubois, D Hadjali, A Prade, H

Touazi, F

Permalink

Publisher:: Kluwer Academic Publishers
Publication Type:: Journal Article
Citation:: Annals of Mathematics and Artificial Intelligence, 2015
Issue Date:: 2015-02-27

Closed Access

	Filename	Description	Size
	err.pdf	Published Version	246.7 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Dubois, D	en_US
dc.contributor.author	Hadjali, A	en_US
dc.contributor.author	Prade, H https://orcid.org/0000-0003-4586-8527	en_US
dc.contributor.author	Touazi, F	en_US
dc.date.issued	2015-02-27	en_US
dc.identifier.citation	Annals of Mathematics and Artificial Intelligence, 2015	en_US
dc.identifier.issn	1012-2443	en_US
dc.identifier.uri	http://hdl.handle.net/10453/115857
dc.description.abstract	This note corrects a claim made in the above-mentioned paper about the exact representation of a conditional preference network by means of a possibilistic logic base with partially ordered symbolic weights. We provide a counter-example that shows that the possibilistic logic representation is indeed not always exact. This is the basis of a short discussion on the difficulty of obtaining an exact representation.	en_US
dc.language	eng	en_US
dc.publisher	Kluwer Academic Publishers	en_US
dc.relation.ispartof	Annals of Mathematics and Artificial Intelligence	en_US
dc.relation.isbasedon	10.1007/s10472-014-9446-2	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	Erratum to: Database preference queries - a possibilistic logic approach with symbolic priorities	en_US
dc.type	Journal Article
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0102 Applied 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 Software
pubs.organisational-group	/University of Technology Sydney/Strength - CAI - Centre for Artificial Intelligence
utslib.copyright.status	closed_access
pubs.publication-status	Accepted	en_US

Abstract:

This note corrects a claim made in the above-mentioned paper about the exact representation of a conditional preference network by means of a possibilistic logic base with partially ordered symbolic weights. We provide a counter-example that shows that the possibilistic logic representation is indeed not always exact. This is the basis of a short discussion on the difficulty of obtaining an exact representation.

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

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