308 search results - page 56 / 62 » Answer Set Programming Based on Propositional Satisfiability |
APPROX
2010
Springer
13 years 9 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...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
CP
2003
Springer
14 years 25 days ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
AAAI
2007
13 years 10 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
SPLC
2000
13 years 9 months ago
2000
: We consider a set of programs a family when it pays to look at their common aspects before looking at their differences. For commercial software developers the implications are t...