From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction

Hubie Chen, Víctor Dalmau. From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. In C.-H. Luke Ong, editor, Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings. Volume 3634 of Lecture Notes in Computer Science, pages 232-247, Springer, 2005. [doi]

@inproceedings{ChenD05:1,
  title = {From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction},
  author = {Hubie Chen and Víctor Dalmau},
  year = {2005},
  doi = {10.1007/11538363_17},
  url = {http://dx.doi.org/10.1007/11538363_17},
  tags = {constraints, consistency},
  researchr = {https://researchr.org/publication/ChenD05%3A1},
  cites = {0},
  citedby = {0},
  pages = {232-247},
  booktitle = {Computer Science Logic, 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings},
  editor = {C.-H. Luke Ong},
  volume = {3634},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-28231-9},
}