Logic Programs with Ordered Disjunction

Brewka, Gerhard; Niemelä, Ilkka; Syrjänen, Tommi

doi:10.1111/j.0824-7935.2004.00241.x

Cited by 79 publications

(130 citation statements)

References 34 publications

Supporting

Mentioning

130

Contrasting

Order By: Relevance

“…Besides the approaches to introducing preferences over rules and literals, Brewka [ 2002 ] in-9 Cf. [Geffner and Pearl,1992] for another approach to preferences on literals.…”

Section: Logic Programs With Preferencementioning

confidence: 99%

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning

Delgrande

Schaub

Tompits

et al. 2004

Computational Intelligence

View full text Add to dashboard Cite

In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles.

show abstract

“…Besides the approaches to introducing preferences over rules and literals, Brewka [ 2002 ] in-9 Cf. [Geffner and Pearl,1992] for another approach to preferences on literals.…”

Section: Logic Programs With Preferencementioning

confidence: 99%

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning

Delgrande

Schaub

Tompits

et al. 2004

Computational Intelligence

View full text Add to dashboard Cite

show abstract

“…First systems that relied on the relaxation of constraints if no perfect matches could be found are presented in [16] and [5] for the area of cooperative retrieval. Theoretical properties of these relaxation techniques and operators for building complex preference expressions are in detail addressed in [4] and [12].…”

Section: Related Work On Preference Frameworkmentioning

confidence: 99%

Preference‐based session management for IP‐based mobile multimedia signaling

Kellerer

Wagner

Balke

et al. 2004

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Abstract. The increasing variety of mobile multimedia services raises the need for mechanisms to select those services whose capabilities best match individual user requirements. In this paper we present an advanced concept for service personalization in next-generation IP-based mobile systems based on the notion of user preferences. The described concept features several enhancements for personalization, including the intuitive modeling of user preferences, the construction of complex preference terms from basic preference expressions and a stepwise refinement of profiles and preferences. We describe this solution applied to the signaling mechanism of the Session Initiation Protocol (SIP), which is the protocol suite for application control in current IP-based mobile communication systems such as UMTS. In particular, our preference concept for personalized service management extends the conventional SIP preference modeling methods proposed so far: a preference order on the available service features is introduced that accounts for the specific demands of a user without a numerical ranking of features. We show how base preferences can be intuitively combined to complex preference expressions and explain how these relate to standard SIP feature preferences.

show abstract

“…#minimize statements or weak constraints [2,3]). On the other hand, such quantitative ways of optimization are often insufficient for applications and in stark contrast to the vast literature on qualitative and hybrid means of optimization [4][5][6][7][8]8].…”

Section: Introductionmentioning

confidence: 99%

“…In particular, we detail how answer set optimization [5], minimization directives [2], strict partially ordered set [8], and the non-temporal part of the preference language in [7] can be implemented with asprin. Moreover, we sketch how the implementations of ordered disjunctions [4] and penalty-based answer set optimization [6] are obtained. In fact, asprin's simple interface and easy methodology reduce the implementation of customized preferences to defining whether one model is preferred to another.…”

Section: Introductionmentioning

confidence: 99%

Implementing Preferences with asprin

Brewka

Delgrande

Romero

et al. 2015

Logic Programming and Nonmonotonic Reasoning

Self Cite

View full text Add to dashboard Cite

Abstract. asprin offers a framework for expressing and evaluating combinations of quantitative and qualitative preferences among the stable models of a logic program. In this paper, we demonstrate the generality and flexibility of the methodology by showing how easily existing preference relations can be implemented in asprin. Moreover, we show how the computation of optimal stable models can be boosted by using declarative heuristics. We empirically evaluate our contributions and contrast them with dedicated implementations. Finally, we detail key aspects of asprin's implementation.

show abstract

Logic Programs with Ordered Disjunction

Cited by 79 publications

References 34 publications

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning

A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning

Preference‐based session management for IP‐based mobile multimedia signaling

Implementing Preferences with asprin

Contact Info

Product

Resources

About