Solving order constraints in logarithmic space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2607, Issue , 2003, Pages 379-390

  Krokhin, Andrei ^a   Larose, Benoit ^b,c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b Champlain Regional College   (Canada)

^c Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SET THEORY;

COMBINATORIAL PROBLEM; CONSTRAINT SATISFACTION; FINITE MODEL THEORY; FINITE POSET; ORDER THEORY; ORDERING CONSTRAINTS; UNIVERSAL ALGEBRA;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248886662     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36494-3_34     Document Type: Article

References (46)

1. M. Alvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space. Computational Complexity, 9(2):123-145, 2000.
2. M. Benke. Some complexity bounds for subtype inequalities. Theoretical Computer Science, 212:3-27, 1999.
3. A.A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS'02, pages 649-658, 2002.
4. A.A. Bulatov, A.A. Krokhin, and P.G. Jeavons. Constraint satisfaction problems and finite algebras. In Proceedings 27th International Colloquium on Automata, Languages and Programming, ICALP'00, volume 1853 of Lecture Notes in Computer Science, pages 272-282. Springer-Verlag, 2000.
5. A.A. Bulatov, A.A. Krokhin, and P.G. Jeavons. The complexity of maximal constraint languages. In Proceedings 33rd ACM Symposium on Theory of Computing, STOC'01, pages 667-674, 2001.
6. E. Corominas. Sur les ensembles ordonnés projectif et la propriétré du point fixe. C. R. Acad. Sci. Paris Serie I Math., 311:199-204, 1990.
7. N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems, volume 7 of SIAM Monographs on Discrete Mathematics and Applications. 2001.
8. V. Dalmau. Constraint satisfaction problems in non-deterministic logarithmic space. In Proceedings 29th International Colloquium, on Automata, Languages and Programming, ICALP'02, volume 2380 of Lecture Notes in Computer Science, pages 414-425. Springer-Verlag, 2002.
9. V. Dalmau and J. Pearson. Set functions and width 1 problems. In Proceedings 5th International Conference on Constraint Programming, CP'99, volume 1713 of Lecture Notes in Computer Science, pages 159-173. Springer-Verlag, 1999.
10. J. Demetrovics, L. Hannák, and L. Rónyai. Near-unanimity functions of partial orders. In Proceedings 14th International Symposium on Multiple-Valued Logic, ISMVL'84, pages 52-56, 1984.
11. D. Duffus and I. Rival. A structure theory for ordered sets. Discrete Mathematics, 35:53-118, 1981.
12. T. Feder and M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal of Computing, 28:57-104, 1998.
13. G. Gottlob, L. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124:243-282, 2000.
14. G. Gottlob, L. Leone, and F. Scarcello. Hypertree decomposition and tractable queries. Journal of Computer and System Sciences, 64(3):579-627, 2002.
15. E. Grädel. Capturing complexity classes by fragments of second-order logic. Theoretical Computer Science, 101:35-57, 1992.
16. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In Proceedings 33rd ACM Symposium on Theory of Computing, STOC'01, pages 657-666, 2001.
17. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Ser.B, 48:92-110, 1990.
18. M. Hoang and J.C. Mitchell. Lower bounds on type inference with subtypes. In Proceedings 22nd ACM Symposium on Principles of Programming Languages, POPL'95, pages 176-185, 1995.
19. N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935-939, 1988.
20. P.G. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
21. P.G. Jeavons, D.A. Cohen, and M.C. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1-2):251-265, 1998.
22. P.G. Jeavons, D.A. Cohen, and M. Gyssens. A unifying framework for tractable constraints. In Proceedings 1st International Conference on Constraint Programming, CP'95, volume 976 of Lecture Notes in Computer Science, pages 276-291. Springer-Verlag, 1995.
23. P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
24. L. Kirousis. Fast parallel constraint satisfaction. Artificial Intelligence, 64:147-160, 1993.
25. J. Köbler and J. Torán. The complexity of graph isomorphism for colored graphs with color classes of size 2 and 3. In Proceedings 19th Symposium on Theoretical Aspects of Computer Science, STACS'02, pages 121-132, 2002.
26. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61:302-332, 2000.
27. V. Kumar. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 13(1):32-44, 1992.
28. G. Kun and Cs. Szabó. Order varieties and monotone retractions of finite posets. Order, 18:79-88, 2001.
29. B. Larose and L. Zádori. The complexity of the extendibility problem for finite posets. manuscript, obtainable from http://cicma.mathstat.concordia.ca/faculty/larose/.
30. B. Larose and L. Zádori. Algebraic properties and dismantlability of finite posets. Discrete Mathematics, 163:89-99, 1997.
31. H. Lewis and C. Papadimitriou. Symmetric space bounded computation. Theoretical Computer Science, 19:161-188, 1982.
32. K. Lodaya and P. Weil. Series-parallel posets: algebra, automata and languages. In Proceedings 15th Symposium on Theoretical Aspects of Computer Science, STACS'98, pages 555-565, 1998.
33. R.H. Möhring. Computationally tractable classes of ordered sets. In Algorithms and Order (Ottawa, 1987), pages 105-193. Kluwer, Dordrecht, 1989.
34. R.H. Möhring and M.W. Schäffter. Scheduling series-parallel orders subject to 0/1-communication delays. Parallel Computing, 25:23-40, 1999.
35. U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7:95-132, 1974.
36. N. Nisan and A. Ta-Shma. Symmetric logspace is closed under complementation. Chicago Journal on Theoretical Computer Science, 1, 1995. (electronic).
37. C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
38. V. Pratt and J. Tiuryn. Satisfiabilty of inequalities in a poset. Fundamenta Informaticae, 28:165-182, 1996.
39. R.W. Quackenbush, I. Rival, and I.G. Rosenberg. Clones, order varieties, near-unaminity functions and holes. Order, 7:239-248, 1990.
40. J.H. Reif. Symmetric complementation. In Proceedings 14th ACM Symposium on Theory of Computing, STOC'82, pages 201-214, 1982.
41. T.J. Schaefer. The complexity of satisfiability problems. In Proceedings 10th ACM Symposium on Theory of Computing, STOC'78, pages 216-226, 1978.
42. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, London, 1993.
43. J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume 1 & 2. Computer Science Press, 1989.
44. J. Valdes, R.E. Tarjan, and E.L. Lawler. The recognition of series-parallel digraphs. SIAM Journal on Computing, 11:298-313, 1982.
45. L. Zádori. Posets, near-unanimity functions and zigzags. Bulletin of Australian Mathematical Society, 47:79-93, 1993.
46. L. Zádori. Series parallel posets with nonfinitely generated clones. Order, 10:305-316, 1993.