Sciweavers

175 search results - page 4 / 35
» Generalizing stable semantics by preferences
Sort
View
AUSAI
2005
Springer
14 years 28 days ago
Structure-Based Algorithms for Computing Preferred Arguments of Defeasible Knowledge Bases
In this paper we present several efficient computational procedures for defeasible reasoning while the plausible and well-defined semantics, viz. preferred models and stable mode...
Quoc Bao Vo
AAAI
1990
13 years 8 months ago
The Generalized Theory of Model Preference
In this paper we present a purely semantic view on non-monotonic reasoning. We follow the direction pointed in [16] and claim that any non-monotonic logic can be viewed as a resul...
Piotr Rychlik
WWW
2009
ACM
14 years 8 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
AI
2002
Springer
13 years 7 months ago
On the computational complexity of assumption-based argumentation for default reasoning
ko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, th...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
JELIA
2000
Springer
13 years 11 months ago
A Logic for Modeling Decision Making with Dynamic Preferences
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
Marina De Vos, Dirk Vermeir