292 search results - page 34 / 59 » Model-checking agent refinement |
63
Voted
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
We introduce a Game Logic with Preferences (GLP), which makes it possible to reason about how information or assumptions about the preferences of other players can be used by agen...
AAAI
2008
15 years 18 hour ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...
73
Voted
AAAI
2007
15 years 18 hour ago
2007
Over the past half decade, we have been exploring the use of logic in the specification and analysis of computational economic mechanisms. We believe that this approach has the p...
AAAI
2000
14 years 11 months ago
2000
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
84
Voted
ML
2006
ACM
14 years 9 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...