TY - GEN
T1 - Soft constraints with partially ordered preferences
AU - Wilson, Nic
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/85017392193
M3 - Conference proceeding
AN - SCOPUS:85017392193
T3 - Frontiers in Artificial Intelligence and Applications
SP - 1111
EP - 1112
BT - ECAI 2004 - 16th European Conference on Artificial Intelligence, including Prestigious Applications of Intelligent Systems, PAIS 2004 - Proceedings
A2 - de Mantaras, Ramon Lopez
A2 - Saitta, Lorenza
PB - IOS Press BV
T2 - 16th European Conference on Artificial Intelligence, ECAI 2004
Y2 - 22 August 2004 through 27 August 2004
ER -