Qualitative choice logic

Brewka, Gerhard; Benferhat, Salem; Berre, Daniel Le

doi:10.1016/j.artint.2004.04.006

Cited by 87 publications

(99 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A more detailed comparison of multi-attribute preference logic with other preference logics such as Qualitative Choice Logic [5] is planned. Other areas for future work concern the representation of dependent properties and the relation of multi-attribute preference logic to e.g.…”

Section: Resultsmentioning

confidence: 99%

“…As it is difficult to obtain such quantitative utility values and weights, however, several qualitative approaches have been proposed instead, see e.g. [2,4,5,6,11]. There is also extensive literature on preference logic following the seminal work of Von Wright [12,9], but such logics are not specifically suited for the multi-attribute case.…”

Section: Introductionmentioning

confidence: 99%

“…The preference orderings thus obtained are not expressed in a logic, however. Brewka et al [5] propose a non-monotonic logic called qualitative choice logic to reason about multi-attribute preferences. An alternative approach towards a logic of multi-attribute preferences is presented in Liu [11] where property rankings called priority sequences are encoded in first-order logic.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multi-attribute Preference Logic

Hindriks

Visser

Jonker

2012

Principles and Practice of Multi-Agent Systems

View full text Add to dashboard Cite

Preferences for objects are commonly derived from ranked sets of properties or multiple attributes associated with these objects. There are several options or strategies to qualitatively derive a preference for one object over another from a property ranking. We introduce a modal logic, called multi-attribute preference logic, that provides a language for expressing such strategies. The logic provides the means to represent and reason about qualitative multiattribute preferences and to derive object preferences from property rankings. The main result of the paper is a proof that various well-known preference orderings can be defined in multi-attribute preference logic.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multi-attribute Preference Logic

Hindriks

Visser

Jonker

2012

Principles and Practice of Multi-Agent Systems

View full text Add to dashboard Cite

show abstract

“…For the semantics, [18] maps the program to an extended logic program. [6,9,7] use yet an other approach. They define preferences between the head atoms of a disjunction.…”

Section: Relationship To Other Approachesmentioning

confidence: 99%

“…To avoid this, we need to make sure that credulous defeaters are not only applicable, but also applied. 6 is the reflexive closure of ≺.…”

Section: Example 6 Consider the Oclp {Pmentioning

confidence: 99%

Implementing Ordered Choice Logic Programming Using Answer Set Solvers

Vos

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This complete absence of negation does not weaken the language as both forms (classical and as-failure) can be intuitively simulated in the language and eliminated using a simple pre-processor, making it also an easy language for users less familiar with logic programming. The semantics of the language is based on the preference between alternatives, yielding both a skeptical and a credulous approach. In this paper we demonstrate how OCLPs can be translated to semi-negative logic programs such that, depending on the transformation, the answer sets of the latter correspond with the skeptical/credulous answer sets of the former. By providing such a mapping, we have a mechanism for implementing OCLP using answer set solvers like Smodels or dlv. We end with a discussion of the complexity of our system and the reasoning tasks it can perform.

show abstract

Logical formalisms for representing bipolar preferences

Kaci

2008

Int. J. Intell. Syst.

View full text Add to dashboard Cite

Bipolar preferences distinguish between negative preferences inducing what is acceptable by complementation and positive preferences representing what is really satisfactory. This article provides a review of the main logics for preference representation. Representing preferences in a bipolar logical way has the advantage of enabling us to reason about them, while increasing their expressive power in a cognitively meaningful way. In the article, we first focus on the possibilistic logic setting and then discuss two other logics: qualitative choice logic and penalty logic. Finally, an application of bipolar preferences querying systems is outlined. C 2008 Wiley Periodicals, Inc.

show abstract

Qualitative choice logic

Cited by 87 publications

References 19 publications

Multi-attribute Preference Logic

Multi-attribute Preference Logic

Implementing Ordered Choice Logic Programming Using Answer Set Solvers

Logical formalisms for representing bipolar preferences

Contact Info

Product

Resources

About