45 search results - page 2 / 9 » A SAT-based polynomial space algorithm for answer set progra... |
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
ICLP
2010
Springer
13 years 8 months ago
2010
Springer
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
CPAIOR
2009
Springer
13 years 11 months ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...