175 search results - page 1 / 35 » Generalizing stable semantics by preferences |
COMMA
2010
12 years 11 months ago
2010
Different proposals have been made in the literature for refining Dung's argumentation framework by preferences between arguments. The idea is to ignore an attack if the atta...
ALGORITHMICA
2010
13 years 4 months ago
2010
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...
ACL
1992
13 years 5 months ago
1992
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...
AI
2007
Springer
13 years 4 months ago
2007
Springer
The increasing variety of semantics proposed in the context of Dung’s theory of argumentation makes more and more inadequate the example-based approach commonly adopted for eval...
COMMA
2006
13 years 6 months ago
2006
In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every st...