54 search results - page 4 / 11 » Efficient Solution of Language Equations Using Partitioned R... |
170
Voted
CP
2009
Springer
16 years 8 days ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
ATAL
2010
Springer
15 years 23 days ago
2010
Springer
We consider the issue of representing coalitional games in multiagent systems that exhibit externalities from coalition formation, i.e., systems in which the gain from forming a c...
EACL
2009
ACL Anthology
14 years 9 months ago
2009
ACL Anthology
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
UAI
2004
15 years 1 months ago
2004
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamica...
100
click to vote
AAAI
1990
15 years 24 days ago
1990
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...