Skip to main content
Conference Proceedings

Preference revision via declarative debugging

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3808 LNCS 18-28
DOI: 10.1007/11595014_3
3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Preference criteria are rarely static. Often they are subject to modification and aggregation. The resulting preference criteria may not satisfy the properties of the original ones and must therefore be revised. This paper investigates the problem of revising such preference criteria by means of declarative debugging techniques. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Dell’Acqua, P., & Pereira, L. M. (2005). Preference revision via declarative debugging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3808 LNCS, pp. 18–28). https://doi.org/10.1007/11595014_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free