Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

KR
2004
Springer

favoriteEmaildiscussreport

151views Automated Reasoning» more KR 2004»

Complex Preferences for Answer Set Optimization

13 years 9 months ago

Complex Preferences for Answer Set Optimization

Download www.informatik.uni-leipzig.de

The main contribution of this paper is the deﬁnition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty based preferences in a ﬂexible way. This makes it possible to express complex preferences which are needed in many realistic optimization settings. We show that several preference handling methods described in the literature are special cases of our approach. We also demonstrate that ¡¢ expressions can be compiled to logic programs which can be used as tester programs in a generate-and-improve method for ﬁnding optimal answer sets.

Gerhard Brewka

Real-time Traffic

Artificial Intelligence | KR 2004 | Penalty Based Preferences | Preference Description Language | Preference Handling Methods |

claim paper

Related Content

» Answer Set Optimization

» Answer Set Optimization for andor Composition of CPNets A Security Scenario

» On the Semantics of Logic Programs with Preferences

» Analyzing Security Scenarios Using Defence Trees and Answer Set Programming

» Preference SQL Design Implementation Experiences

» Automated mechanism design complexity results stemming from the singleagent setting

» PreferenceDriven Querying of Inconsistent Relational Databases

» Practical Preference Relations for Large Data Sets

» Implementing OCLP as a frontend for Answer Set Solvers From Theory to Practice

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	KR
Authors	Gerhard Brewka

Comments (0)