A Game-Theoretic Approach to Constraint Satisfaction

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 175-181

  Kolaitis, Phokion G ^a   Vardi, Moshe Y ^b  

^a University of California Santa Cruz   (United States)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT SATISFACTION PROBLEMS;

BASIC RESULTS; CONDITION; CONSISTENCY PROPERTY; CONSTRAINT SATISFACTION; DATALOG; GAME-THEORETIC; GLOBAL CONSISTENCY; PEBBLE GAME; WINNING STRATEGY;

GAME THEORY;

EID: 85158103978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Abiteboul, S.; Hull, R.; and Vianu, V. 1995. Foundations of databases. Addison-Wesley.
2. Apt, K. 1997. The essence of constraint propagation. Theoretical Computer Science 221(1-2):179-210.
3. Cooper, M. 1989. An optimal k-consistency algorithm. Artificial Intelligence 41(1):89-95.
4. Dechter, R. 1992. From local to global consistency. Artificial Intelligence 55(1):87-107.
5. Ebbinghaus, H.-D.; Flum, J.; and Thomas, W. 1994. Mathematical Logic. Springer-Verlag, 2nd edition.
6. Feder, T., and Vardi, M. 1999. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. on Computing 28:57-104. Preliminary version in Proc. 25th ACM Symp. on Theory of Computing, May 1993, pp. 612-622.
7. Freuder, E. 1978. Synthesizing constraint expressions. Communications of the ACM 21(11):958-966.
8. Freuder, E. 1982. A sufficient condition for backtrack-free search. Journal of the Association for Computing Machinery 29(1):24-32.
9. Güsgen, H., and Ladkin, P. 1995. An algebraic approach to general Boolean constraints problem. Technical report, University of Bielfeld. RVS-RR-96-04.
10. Jeavons, P.; Cohen, D.; and Cooper, M. 1998. Constraints, consistency and closure. Artificial Intelligence 101(1-2):251-65.
11. Jeavons, P.; Cohen, D.; and Gyssens, M. 1995. A unifying framework for tractable constraints. In Montanari, U., and Rossi, F., eds., Proceedings of 1st International Conference on Principles and Practice of Constraint Programming, CP95, 276-291. Springer-Verlag.
12. Jeavons, P.; Cohen, D.; and Gyssens, M. 1996. A test for tractability. In Freuder, E., ed., Proceedings of 2nd International Conference on Principles and Practice of Constraint Programming, CP96, 267-281. Springer-Verlag.
13. Jeavons, P.; Cohen, D.; and Gyssens, M. 1997. Closure properties of constraints. Journal of the ACM 44(4):527-48.
14. Kolaitis, P. G., and Vardi, M. Y. 1995. On the expressive power of Datalog: tools and a case study. Journal of Computer and System Sciences 51(1):110-134.
15. Kolaitis, P., and Vardi, M. 1998. Conjunctive-query containment and constraint satisfaction. In Proc. 17th ACM Symp. on Principles of Database Systems, 205-213. Full version at http://www.cs.rice.edu/~vardi/papers.
16. Mackworth, A., and Freuder, E. 1993. The complexity of constraint satisfaction revisited. Artificial Intelligence 59(1-2):57-62.
17. Ullman, J. D. 1989. Database and Knowledge-Base Systems, Volumes I and II. Computer Science Press.
18. van Beek, P., and Dechter, R. 1997. Constraint tightness and looseness versus local and global consistency. Journal of the ACM 44(4):549-566.
19. van Beek, P. 1994. On the inherent tightness of local consistency in constraint networks. In Proc. of National Conference on Artificial Intelligence (AAAI-94), 368-373.