Soft constraints with partially ordered preferences

Thumbnail Image
Files
SoftPrefnwilsonECAI04.pdf(82.74 KB)
Accepted version
Date
2004-08
Authors
Wilson, Nic
Journal Title
Journal ISSN
Volume Title
Publisher
IOS Press
Published Version
Research Projects
Organizational Units
Journal Issue
Abstract
This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, this reduces to the idempotent semiring-based CSP approach, and the lattice operations can be used to define a sound and complete proof theory. For the general case, it is shown how sound and complete deduction can be performed by using a particular embedding of a partially ordered set in a distributive lattice.
Description
Keywords
Preferences , Constraints , Soft constraints , Distributive lattice
Citation
Wilson, N. (2004) 'Soft Constraints with Partially Ordered Preferences' ECAI' 04: Proceedings of the 16th European Conference on Artificial Intelligence, 22- 27 August, Valencia, Spain: IOS Press, pp. 1111-1112
Link to publisher’s version
https://www.iospress.nl/book/ecai-2004/
URI
https://hdl.handle.net/10468/10761
Collections
Computer Science - Conference Items
Insight Centre for Data Analytics - Conference Items
Copyright
© 2004 IOS Press