Generalized majority-minority operations are tractable

Logical Methods in Computer Science

Volumn 2, Issue 4, 2006, Pages

  Dalmau, Víctor ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

Complexity; Constraint satisfaction; Mal tsev; Near unanimity

Indexed keywords

POLYNOMIAL APPROXIMATION;

COMPLEXITY; CONSTRAINT RELATIONS; CONSTRAINT SATISFACTION; FINITE SET; NEAR-UNANIMITY; NEAR-UNANIMITY OPERATIONS; POLYNOMIAL-TIME;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84994608759     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-2(4:1)2006     Document Type: Article

References (26)

1. A. Bulatov. A Dichotomy Theorem for Constraints on a Three-element Set. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, (FOCS’02), pages 649-658, 2002.
2. A. Bulatov. Mal’tsev Constraints are Tractable. Technical Report PRG-02-05, Computing Laboratory, Oxford University, 2002.
3. A. Bulatov. Tractable Conservative Constraint Satisfaction Problems. In Proceedings of the 18th Annual IEEE Simposium on Logic in Computer Science, (LICS’03), pages 321-330, 2003.
4. A. Bulatov. A Graph of a Relational Structure and Constraint Satisfaction Problems. In Proceedings of the 19th IEEE Annual Symposium on Logic in Computer Science, (LICS’04), pages 448-457, 2004.
5. A. Bulatov. Combinatorial problems raised from 2-semilattices. Journal of Algebra, to appear.
6. A. Bulatov, H. Chen, and V. Dalmau. Learnability of Relatively Quantified Generalized Formulas. In Proceedings of 15th International Conference on Algorithmic Learning Theory, (ALT ’04), number 3244 in Lecture Notes in Computer Science, pages 365-379, 2004.
7. A. Bulatov and V. Dalmau. A Simple Algorithm for Mal’tev Constraints To appear in SIAM J. Computing.
8. A. Bulatov, P. Jeavons, and M. Volkov. Finite Semigroups Imposing Tractable Constraints. In School on Algorithmic Aspects of the Theory of Semigroups, 2001.
9. A. Bulatov, A. Krokhin, and P. Jeavons. Constraint Satisfaction Problems and Finite Algebras. In Proceedings of the 27th International Colloquium on Automata Languages, and Programming, (ICALP’00), volume 1853 of Lecture Notes in Computer Science, pages 160-171, 2000.
10. A. Bulatov, A. Krokhin, and P. Jeavons. The Complexity of Maximal Constraint Languages. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, (STOC’01), pages 667-674, 2001.
11. H.M. Chen and V. Dalmau. (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, (CP’04), 2004.
12. S.A. Cook. The Complexity of Theorem-Proving Procedures. In 3rd Annual ACM Symposium on Theory of Computing, (STOC’71), pages 151-158, 1971.
13. M.C. Cooper, D.A. Cohen, and P.G. Jeavons. Characterizing Tractable Constraints. Artificial Intelligence, 65:347-361, 1994.
14. V. Dalmau. A New Tractable Class of Constraint Satisfaction Problems. Ann. Math. Artif. Intell., 44(1-2):61-85, 2005
15. V. Dalmau, P. Kolaitis, and M. Vardi. Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics In 8th International Conference on Principles and Practice of Constraint Programming, (CP’02), volume 2470 of Lecture Notes in Computer Science, pages 310-326, Berlin/New York, 2002. Springer-Verlag.
16. V. Dalmau, R. Gavaldà, P. Tesson, and D. Therien. Tractable Clones of Polynomials over Semigroups In 11th International Conference on Principles and Practice of Constraint Programming, (CP’05), volume 3709 of Lecture Notes in Computer Science, pages 196-210, Berlin/New York, 2005. Springer-Verlag.
17. V. Dalmau and J. Pearson. Set Functions and Width 1. In 5th International Conference on Principles and Practice of Constraint Programming, (CP’99), volume 1713 of Lecture Notes in Computer Science, pages 159-173, Berlin/New York, 1999. Springer-Verlag.
18. T. Feder. Constraint satisfaction on finite groups with near subgroups. Manuscript.
19. T. Feder and M.Y. Vardi. The Computational Structure of Monotone Monadic SNP and Contraint Satisfaction: A Study through Datalog and Group Theory. SIAM J. Computing, 28(1):57-104, 1998.
20. M. Grohe. The Complexity of Homomorphism and Constraint Satisfaction Problems seen from the Other Side. In Proceedings of the 44th IEEE Symposium on Foundations of Comupter Science, (FOCS’03), pages 552-561, 2003.
21. P. Jeavons. On the Algebraic Structure of Combinatorial Problems. Theoretical Computer Science, 200:185-204, 1998.
22. P. Jeavons, D. Cohen, and M.C. Cooper. Constraints, Consistency and Closure. Artificial Intelligence, 101:251-265, 1998.
23. P. Jeavons, D. Cohen, and M. Gyssens. Closure Properties of Constraints. Journal of the ACM, 44(4):527-548, July 1997.
24. L. Kirousis. Fast Parallel Constraint Satisfaction. Artificial Intelligence, 64:147-160, 1993.
25. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
26. T.J. Schaefer. The Complexity of Satisfiability Problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, (STOC’78), pages 216-226, 1978.