Encoding preference queries to an uncertain database in possibilistic answer set programming

Confalonieri, R; Prade, H

Encoding preference queries to an uncertain database in possibilistic answer set programming

Confalonieri, R Prade, H

Permalink

Publication Type:: Conference Proceeding
Citation:: Communications in Computer and Information Science, 2012, 297 CCIS (PART 1), pp. 511 - 520
Issue Date:: 2012-11-02

Closed Access

	Filename	Description	Size
	2013007829OK.pdf	Published version	350.89 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	Confalonieri, R	en_US
dc.contributor.author	Prade, H https://orcid.org/0000-0003-4586-8527	en_US
dc.date.issued	2012-11-02	en_US
dc.identifier.citation	Communications in Computer and Information Science, 2012, 297 CCIS (PART 1), pp. 511 - 520	en_US
dc.identifier.isbn	9783642317088	en_US
dc.identifier.issn	1865-0929	en_US
dc.identifier.uri	http://hdl.handle.net/10453/32850
dc.description.abstract	The representation of preference queries to an uncertain data-base requires a framework capable of dealing with preferences and uncertainty in a separate way. Possibilistic logic has shown to be a suitable setting to support different kinds of preference queries. In this paper, we propose a counterpart of the possibilistic logic-based preference query encoding within a possibilistic logic programming framework. Our approach is capable of dealing with the same interplay of preferences and uncertainty as in possibilistic logic. © 2012 Springer-Verlag Berlin Heidelberg.	en_US
dc.relation.ispartof	Communications in Computer and Information Science	en_US
dc.relation.isbasedon	10.1007/978-3-642-31709-5_52	en_US
dc.title	Encoding preference queries to an uncertain database in possibilistic answer set programming	en_US
dc.type	Conference Proceeding
utslib.citation.volume	PART 1	en_US
utslib.citation.volume	297 CCIS	en_US
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.issue	PART 1	en_US
pubs.publication-status	Published	en_US
pubs.volume	297 CCIS	en_US

Abstract:

The representation of preference queries to an uncertain data-base requires a framework capable of dealing with preferences and uncertainty in a separate way. Possibilistic logic has shown to be a suitable setting to support different kinds of preference queries. In this paper, we propose a counterpart of the possibilistic logic-based preference query encoding within a possibilistic logic programming framework. Our approach is capable of dealing with the same interplay of preferences and uncertainty as in possibilistic logic. © 2012 Springer-Verlag Berlin Heidelberg.

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

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