Abstract
We study which constraint satisfaction problems (CSPs) are solvable in NL. In particular, we identify a general condition called bounded path duality, that explains all the families of CSPs previously known to be in NL. Bounded path duality captures the class of constraint satisfaction problems that can be solved by linear Datalog programs, i.e., Datalog programs with at most one IDB in the body of each rule. We obtain several alternative characterizations of bounded path duality. We also address the problem of deciding which constraint satisfaction problems have bounded path duality. In this direction we identify a subclass of bounded path duality problems, called (1, k)-path duality problems for which membership is decidable. Finally, we study which closure operations guarantee bounded path duality. We show that closure under any operation in the pseudovariety generated by the class of dual discriminator operations is a sufficient condition for bounded path duality.
Research conducted whilst the author was visiting the University of California, Santa Cruz, supported by NSF grant CCR-9610257.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Bulatov, P. Jeavons, and M. Volkov. Finite Semigroups Imposing Tractable Constraints. In School on Algorithmic Aspects of the Theory of Semigroups, 2001.
A. Bulatov, A. Krokhin, and P. Jeavons. Constraint Satisfaction Problems and Finite Algebras. In 27th International Colloquium on Automata Languages, and Programming, ICALP’00, volume 1853 of Lecture Notes in Computer Science, pages 160–171, 2000.
A. Bulatov, A. Krokhin, and P. Jeavons. The Complexity of Maximal Constraint Languages. In 33rd Annual ACM Symposium on Theory of Computing, STOC’01, pages 667–674, 2001.
S.A. Cook. The Complexity of Theorem-Proving Procedures. In 3rd Annual ACM Symposium on Theory of Computing STOC’71, pages 151–158, 1971.
M.C. Cooper, D.A. Cohen, and P.G. Jeavons. Characterizing Tractable Constraints. Artificial Intelligence, 65:347–361, 1994.
V. Dalmau. A New Tractable Class of Constraint Satisfaction Problems. In 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
V. Dalmau. Computational Complexity of Problems over Generalized Formulas. PhD thesis, Universitat Politècnica de Catalunya, 2001.
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.
R. Dechter and J. Pearl. Network-based Heuristics for Constraint Satisfaction Problems. Artificial Intelligence, 34(1):1–38, 1988.
T. Feder. Removing Inequalities and Negation for Homomorphism-Closed Problems, manuscript.
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.
E.C. Freuder. A Sufficient Condition for Backtrack-bounded Search. Journal of the ACM, 32:755–761, 1985.
E. Grädel. Capturing Complexity Classes by Fragments of Second-Order Logic. Theoretical Computer Science, 101(1):35–57, 1992.
P. Hell and J. Nesetril. On the Complexity of H-coloring. J. Comb. Theory, Series B, 48:92–110, 1990.
P. Hell and X. Zhu. Homomorphisms to oriented paths. Discrete Mathematics, 132:107–114, 1994.
P. Hell and X. Zhu. The Existence of Homomorphisms to Oriented Cycles. SIAM J. Discrete Math., 8, 1995.
P. Jeavons. On the Algebraic Structure of Combinatorial Problems. Theoretical Computer Science, 200:185–204, 1998.
P. Jeavons, D. Cohen, and M.C. Cooper. Constraints, Consistency and Closure. Artificial Intelligence, 101:251–265, 1998.
P. Jeavons, D. Cohen, and M. Gyssens. Closure Properties of Constraints. Journal of the ACM, 44(4):527–548, July 1997.
L. Kirousis. Fast Parallel Constraint Satisfaction. Artificial Intelligence, 64:147–160, 1993.
P. G. Kolaitis and M. Vardi. On the Expressive Power of Datalog: Tools and a Case Study. Journal of Computer and System Sciences, 51(1):110–134, 1995.
P.G. Kolaitis and M. Vardi. The Decision Problem for the Probabilities of Higher-Order Properties. In 19th Annual ACM Symposium on Theory of Computing, pages 425–435, 1987.
A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
R.N. McKenzie, G.F. McNulty, and W.F. Taylor. Algebras, Lattices and Varieties, volume 1. Wadsworth and Brooks, 1987.
U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences, 7:95–132, 1974.
U. Montanari and F. Rossi. Constraint Relaxation may be Perfect. Artificial Intelligence, 48:143–170, 1991.
S. Khanna N. Creignou and M. Sudan. Complexity Classification of Boolean Constraint Satisfaction Problems, volume 7 of Monographs on Discrete Mathematics and Applications. SIAM, 2001.
C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences, 43:425–440, 1991.
T.J. Schaefer. The Complexity of Satisfiability Problems. In 10th Annual ACM Symposium on Theory of Computing, pages 216–226, 1978.
A. Szendrei. Idempotent algebras with restrictions in subalgebras. Acta Sci. Math., 51:251–268, 1987.
J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume II. Computer Science Press, 1989.
P. van Beek and R. Dechter. On the Minimality and Decomposability of Row-convex Constraint Networks. Journal of the ACM, 42:543–561, 1995.
P. van Hentenryck, Y. Deville, and C-M. Teng. A Generic Arc-consistency Algo-rithm and its Specializations. Artificial Intelligence, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dalmau, V. (2002). Constraint Satisfaction Problems in Non-deterministic Logarithmic Space. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_36
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive