A possibilistic logic view of preference queries to an uncertain database

Bosc, P; Pivert, O; Prade, H

A possibilistic logic view of preference queries to an uncertain database

Bosc, P Pivert, O Prade, H

Permalink

Publication Type:: Conference Proceeding
Citation:: 2010 IEEE World Congress on Computational Intelligence, WCCI 2010, 2010
Issue Date:: 2010-11-25

Closed Access

	Filename	Description	Size
	2013007800OK.pdf	Published version	1.16 MB	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	Bosc, P	en_US
dc.contributor.author	Pivert, O	en_US
dc.contributor.author	Prade, H https://orcid.org/0000-0003-4586-8527	en_US
dc.date.issued	2010-11-25	en_US
dc.identifier.citation	2010 IEEE World Congress on Computational Intelligence, WCCI 2010, 2010	en_US
dc.identifier.isbn	9781424469208	en_US
dc.identifier.uri	http://hdl.handle.net/10453/30600
dc.description.abstract	The paper shows how three different types of hierarchical queries involving qualitative preference and leading to totally ordered results, which have been recently considered in the setting of division operation, can be conveniently encoded in possibilistic logic. This enables such a handling of preference queries to be interfaced with a recently proposed approach for dealing with pieces of data associated with certainty levels represented in the framework of possibilistic logic. © 2010 IEEE.	en_US
dc.relation.ispartof	2010 IEEE World Congress on Computational Intelligence, WCCI 2010	en_US
dc.relation.isbasedon	10.1109/FUZZY.2010.5584028	en_US
dc.title	A possibilistic logic view of preference queries to an uncertain database	en_US
dc.type	Conference Proceeding
utslib.for	0801 Artificial Intelligence and Image Processing	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	Published	en_US

Abstract:

The paper shows how three different types of hierarchical queries involving qualitative preference and leading to totally ordered results, which have been recently considered in the setting of division operation, can be conveniently encoded in possibilistic logic. This enables such a handling of preference queries to be interfaced with a recently proposed approach for dealing with pieces of data associated with certainty levels represented in the framework of possibilistic logic. © 2010 IEEE.

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

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