4218 search results - page 136 / 844 » Complete sets of cooperations |
ENDM
2007
13 years 10 months ago
2007
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
CIAC
2010
Springer
14 years 7 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 ...
LPNMR
2005
Springer
14 years 3 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 ...
AAAI
2006
13 years 11 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...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...