Sciweavers

175 search results - page 13 / 35
» Generalizing stable semantics by preferences
Sort
View
FLAIRS
2007
13 years 9 months ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
LPNMR
2004
Springer
14 years 26 days ago
Logic Programs With Monotone Cardinality Atoms
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
V. Wiktor Marek, Ilkka Niemelä, Miroslaw Trus...
ECAI
2000
Springer
13 years 12 months ago
Logic Programs with Compiled Preferences
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
James P. Delgrande, Torsten Schaub, Hans Tompits
NMR
2004
Springer
14 years 26 days ago
A recursive approach to argumentation: motivation and perspectives
In the context of Dung’s argumentation framework, we propose a general recursive schema for argumentation semantics, based on decomposition along the strongly connected componen...
Pietro Baroni, Massimiliano Giacomin
CORR
2011
Springer
189views Education» more  CORR 2011»
13 years 2 months ago
Peer Effects and Stability in Matching Markets
Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college st...
Elizabeth Bodine-Baron, Christina Lee, Anthony Cho...