Sciweavers

119 search results - page 2 / 24
» Complex Preferences for Answer Set Optimization
Sort
View
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 4 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
13 years 10 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
EDBTW
2006
Springer
13 years 8 months ago
Preference-Driven Querying of Inconsistent Relational Databases
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowsk...
ICDE
2007
IEEE
119views Database» more  ICDE 2007»
13 years 11 months ago
Practical Preference Relations for Large Data Sets
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
Kenneth A. Ross, Peter J. Stuckey, Amélie M...
ASP
2003
Springer
13 years 10 months ago
Implementing OCLP as a front-end for Answer Set Solvers: From Theory to Practice
Abstract. Ordered Choice Logic Programming (OCLP) allows for preferencebased decision-making with multiple alternatives and without the burden of any form of negation. This complet...
Martin Brain, Marina De Vos