Linear datalog and bounded path duality of relational structures

Logical Methods in Computer Science

Volumn 1, Issue 1, 2005, Pages

  Dalmau, Víctor ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

Constraint satisfaction problem; Linear datalog; NL; Path duality

Indexed keywords

CONSTRAINT THEORY;

DATALOG; DATALOG PROGRAMS; FINITE NUMBER; PATH DUALITY; PATHWIDTH; RELATIONAL STRUCTURES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 69949162338     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-1(1:5)2005     Document Type: Article

References (38)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In 9th Symp. on Theory of Computing (STOC’77), pages 77-90, 1977.
3. S.A. Cook. The Complexity of Theorem-Proving Procedures. In 3rd Annual ACM Symposium on Theory of Computing, (STOC’71), pages 151-158, 1971.
4. M.C. Cooper, D.A. Cohen, and P.G. Jeavons. Characterizing Tractable Constraints. Artificial Intelligence, 65:347-361, 1994.
5. N. Creignou, S. Khanna, and M. Sudan. Complexity Classification of Boolean Constraint Satisfaction Problems, volume 7 of Monographs on Discrete Mathematics and Applications. SIAM, 2001.
6. V. Dalmau. A New Tractable Class of Constraint Satisfaction Problems. In 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
7. V. Dalmau. Constraint satisfaction problems in non-deterministic logarithmic space. In 29th International Colloquium on Automata, Languages, and Programming (ICALP’02), pages 414-425, 2002.
8. V. Dalmau, P.G. Kolaitis, and M. Vardi. Constraint Satisfaction Problems, Bounded Treewidth, and Finite-Variable Logics. In 8th International Conference on Principles and Practice of Constraint Programming (CP’02), pages 310-326.
9. 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.
10. R. Dechter and J. Pearl. Network-based Heuristics for Constraint Satisfaction Problems. Artificial Intelligence, 34(1):1-38, 1988.
11. T. Feder and M. Vardi. Homomorphism closed vs. existential positive. In 18th IEEE Symposium on Logic in Computer Science (LICS’03), pages 311-320, 2003.
12. 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.
13. E.C. Freuder. A Sufficient Condition for Backtrack-bounded Search. Journal of the ACM, 32:755-761, 1985.
14. E. Grädel. Capturing Complexity Classes by Fragments of Second-Order Logic. Theoretical Computer Science, 101(1):35-57, 1992.
15. 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.
16. P. Hell and J. Nešetřil. On the Complexity of H-coloring. J. Comb. Theory, Series B, 48:92-110, 1990.
17. P. Hell, J. Nešetřil, and X. Zhu. Duality and polynomial testing of graph homomorphisms. Trans. Amer. Math. Soc., 348:1281-1297, 1996.
18. P. Hell and X. Zhu. Homomorphisms to oriented paths. Discrete Mathematics, 132:107-114, 1994.
19. P. Hell and X. Zhu. The Existence of Homomorphisms to Oriented Cycles. SIAM J. Discrete Math., 8, 1995.
20. P. Jeavons. On the Algebraic Structure of Combinatorial Problems. Theoretical Computer Science, 200:185-204, 1998.
21. P. Jeavons, D. Cohen, and M.C. Cooper. Constraints, Consistency and Closure. Artificial Intelligence, 101:251-265, 1998.
22. P. Jeavons, D. Cohen, and M. Gyssens. Closure Properties of Constraints. Journal of the ACM, 44(4):527-548, July 1997.
23. L. Kirousis. Fast Parallel Constraint Satisfaction. Artificial Intelligence, 64:147-160, 1993.
24. 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.
25. P.G. Kolaitis and M. Vardi. A Game-Theoretic Approach to Constraint Satisfaction. In 17th National Conference on Artificial Intelligence (AAAI’00), pages 175-181.
26. 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.
27. P.G. Kolaitis and M. Vardi. Conjunctive-Query Containment and Constraint Satisfaction. Journal of Computer and System Sciences, 61(2):302-332, 2000.
28. A. K. Krokhin and B. Larose. Solving order constraints in logarithmic space. In 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS’03), pages 379-390, 2003.
29. A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
30. U. Montanari. Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences, 7:95-132, 1974.
31. U. Montanari and F. Rossi. Constraint Relaxation may be Perfect. Artificial Intelligence, 48:143-170, 1991.
32. C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences, 43:425-440, 1991.
33. N. Robertson and P. Seymour. Graph minors. i. excluding a forest. J. Comb. Theory Series B, 35:39-61, 1983.
34. 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.
35. A. Szendrei. Idempotent algebras with restrictions in subalgebras. Acta Sci. Math., 51:251-268, 1987.
36. J.D. Ullman. Principles of Database and Knowledge-Base Systems, volume II. Computer Science Press, 1989.
37. P. van Beek and R. Dechter. On the Minimality and Decomposability of Row-convex Constraint Networks. Journal of the ACM, 42:543-561, 1995.
38. P. van Hentenryck, Y. Deville, and C-M. Teng. A Generic Arc-consistency Algorithm and its Specializations. Artificial Intelligence, 1992