The expressive rate of constraints

Annals of Mathematics and Artificial Intelligence

Volumn 44, Issue 4, 2005, Pages 341-352

  Chen, Hubie ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

Constraints; Dichotomy theorem; Expressiveness; Logic

Indexed keywords

EID: 25444470460     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-005-7031-4     Document Type: Article

References (13)

1. E. Böhler, E. Hemaspaandra, S. Reith and H. Vollmer, Playing with Boolean blocks, Part I: Post's lattice with applications to complexity theory, ACM-SIGACT Newsletter 34 (4) (2003) 38-52.
2. A. Bulatov, H. Chen and V. Dalmau, Learnability of relatively quantified generalized formulas, in: The 15th International Conference on Algorithmic Learning Theory (ALT) (2004).
3. M. Cadoli and P.M. Donini, A survey on knowledge compilation, AI Communications 10(3/4) (1997) 137-150.
4. N. Creignou, S. Khanna and M. Sudan, Complexity Classification of Boolean Constraint Satisfaction Problems, SIAM Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia, PA, 2001).
5. V. Dalmau and P. Jeavons, Learnability of quantifed formulas, Theoretical Computer Science 306(1-3) (2003) 485-511.
6. P. Jeavons, On the algebraic structure of combinatorial problems, Theoretical Computer Science 200 (1998) 185-204.
7. P. Jeavons, D. Cohen and M. Cooper, Constraints, consistency, and closure, Articial Intelligence 101(1/2) (1998) 251-265.
8. P.O. Jeavons, D.A. Cohen and M. Gyssens, Closure properties of constraints, Journal of the ACM 44 (1997) 527-548.
9. P. Jeavons, D. Cohen and J. Pearson, Constraints and universal algebra, Annals of Mathematics and Artificial Intelligence 24(1-4) (1998) 51-67.
10. G. Nordh and P. Jonsson, An algebraic approach to the complexity of prepositional circumscription, in: Proc. of the 19th IEEE Symposium on Logic in Computer Science (LICS-2004), Turku, Finland (2004), pp. 367-376.
11. R. Pöschel and L.A. Kalužnin, Funktionen- und Relationenalgebren (DVW, Berlin, 1979).
12. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. of the ACM Symposium on Theory of Computing (STOC) (1978) pp. 216-226.
13. A. Szendrei, Clones in Universal Algebra, Séminaires de Mathématiques Supérieures, Vol. 99 (Presses Univ. Montréal, Montreal, PQ, 1986).