Tractable Set Constraints

First Page		Document Content
Date: 2011-06-29 07:09:50 Mathematical logic Constraint satisfaction Complexity of constraint satisfaction Function Entailment Envelope Horn clause Constraint programming Logic Mathematics		Tractable Set Constraints Add to Reading List Source URL: ijcai.org Download Document from Source Website File Size: 680,80 KB Share Document on Facebook

	A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu DocID: 1uD4W - View Document
	A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu DocID: 1s7WT - View Document
	A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan∗ Department of EECS UC Berkeley DocID: 1ryuK - View Document
	Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester DocID: 1ruap - View Document
	Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science DocID: 1qQq0 - View Document