✦ LIBER ✦

Logical formalisms for representing bipolar preferences

✍ Scribed by Souhila Kaci

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 113 KB
Volume: 23
Category: Article
ISSN: 0884-8173
DOI: 10.1002/int.20303

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Difference logics for preference

✍ Dennis J. Packard 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 269 KB

Preferred answer sets for extended logic

Preferred answer sets for extended logic programs

✍ Gerhard Brewka; Thomas Eiter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 442 KB

In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules is used to express preferences. We show how this ordering can be used to defi

Knowledge systems for island problems: U

Knowledge systems for island problems: Using systems thinking and knowledge formalisms for eliciting and representing task knowledge

✍ John Darzentas 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 411 KB

On consistency in probabilistic logic fo

On consistency in probabilistic logic for logical formulas represented by B-hypertrees

✍ Kim Allan Andersen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 983 KB

One of the problems (mainly unsolved) in probabilistic logic is to consistently assign probabilities to logical formulas. In this paper we consider Horn formulas represented by B-hypertrees. We give a set of necessary conditions that any valid assignment of probabilities to the logical formulas shou

Formal Analysis of Coupling Hypothesis f

Formal Analysis of Coupling Hypothesis for Logical Faults

✍ Kalpesh Kapoor 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 203 KB

Quantification for Peirce's preferred sy

Quantification for Peirce's preferred system of triadic logic

✍ Atwell R. Turquette 📂 Article 📅 1981 🏛 Springer Netherlands 🌐 English ⚖ 610 KB

Without introducing quantifiers, minimal axiomatic systems have already been constructed for l%irce's triadic logics. The present paper constructs a dual pair of axiomatic systems which can be used to introduce quantifiers into Peirce's preferred system of triadic logic. It is assumed (on the basis