4066 search results - page 98 / 814 » Almost Complete Sets |
176
click to vote
PKC
2007
Springer
16 years 12 days ago
2007
Springer
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
157
click to vote
TARK
2007
Springer
16 years 11 days ago
2007
Springer
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
163
click to vote
CIAC
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
146
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
181
Voted
AAAI
2006
15 years 7 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...