Constraint Logic: A Uniform Framework for Modeling Computation as Games

@article{Demaine2008ConstraintLA,
  title={Constraint Logic: A Uniform Framework for Modeling Computation as Games},
  author={Erik D. Demaine and Robert A. Hearn},
  journal={2008 23rd Annual IEEE Conference on Computational Complexity},
  year={2008},
  pages={149-162}
}
We introduce a simple game family, called constraint logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be interpreted in many different game-theoretic settings, ranging from zero-player automata to a more economic setting of team multiplayer games with hidden information. Each setting gives rise to a model of computation that we show corresponds to a classic complexity class. In this way we obtain a uniform framework for… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 50 references

Planar Formulae and Their Uses

SIAM J. Comput. • 1982
View 5 Excerpts
Highly Influenced

Multiple-person alternation

20th Annual Symposium on Foundations of Computer Science (sfcs 1979) • 1979
View 11 Excerpts
Highly Influenced

On the complexity of some two-person perfect-information games

T. J. Schaefer
Journal of Computer and System Sciences, 16:185–225 • 1978
View 13 Excerpts
Highly Influenced

Provably Difficult Combinatorial Games

SIAM J. Comput. • 1978
View 15 Excerpts
Highly Influenced

Mathematical games: The fantastic combinations of John Conway’s new solitaire game ‘Life

M. Gardner
Scientific American, • 1970
View 5 Excerpts
Highly Influenced

SOKOBAN and other motion planning problems

Comput. Geom. • 1999
View 11 Excerpts
Highly Influenced

Sokoban is PSPACE-complete

J. C. Culberson
In Proceedings International Conference on Fun with Algorithms (FUN’98), • 1998
View 11 Excerpts
Highly Influenced

The Othello game on an n*n board is PSPACE-complete

Theor. Comput. Sci. • 1994
View 11 Excerpts
Highly Influenced

N by N Checkers is Exptime Complete

SIAM J. Comput. • 1984
View 9 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…