175 search results - page 3 / 35 » Generalizing stable semantics by preferences |
JAIR
2012
11 years 7 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
ALGORITHMICA
2010
13 years 5 months ago
2010
We consider the following version of the stable matching problem. Suppose that men have preferences for women, women have preferences for dogs, and dogs have preferences for men. T...
KR
2000
Springer
13 years 9 months ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
JAIR
2007
13 years 5 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...