First-order definable retraction problems for posets and reflexive graphs

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 232-241

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

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITY OF WARWICK   (United Kingdom)

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FINITE ELEMENT METHOD; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

FINITE MODEL THEORY; HOMOMORPHISM; REFLEXIVE GRAPHS;

COMPUTER SCIENCE;

EID: 4544388583     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319617     Document Type: Conference Paper

References (34)

1. M. Ajtai and Y. Gurevich. Datalog vs. first-order logic. Journal of Computer and System Sciences, 49:562-588, 1994.
2. A. Atserias, A. Dawar, and P. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries. In Proc. 23rd Symp. on Principles of Database Systems, PODS'04.
3. M. Benke. Some complexity bounds for subtype inequalities, Theoretical Computer Science, 212:3-27, 1999.
4. G. Bredon. Topology and Geometry. Springer-Verlag, third edition, 1995.
5. R. Brewster, T. Feder, P. Hell, J. Huang, and G. MacGillavray. Near-unanimity functions and varieties of graphs. submitted, 2004.
6. A. Bulatov. Tractable conservative constraint satisfaction problems. In Proc. 18th IEEE Symp. on Logic in Computer Science, LICS'03, pages 321-330, 2003.
7. A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th ACM Symp. on Theory of Computing, STOC'77, pages 77-90, 1977.
8. 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.
9. V. Dalmau. Constraint satisfaction problems in non-deterministic logarithmic space. In Proc. 29th Int. Colloq. on Automata, Languages and Programming, ICALP'02, volume 2380 of LNCS, pages 414-425, 2002.
10. V. Dalmau, P. Kolaitis, and M. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Proc. 8th Int. Conf. on Constraint Programming, CP'02, volume 2470 of LNCS, pages 310-326, 2002.
11. J. Demetrovics, L. Hannák, and L. Rónyai. Near-unanimity functions of partial orders. In Proc. 14th Int. Symp. on Multiple-Valued Logic, ISMVL'84, pages 52-56, 1984.
12. D. Duffus and I. Rival. A structure theory for ordered sets. Discrete Mathematics, 35:53-118, 1981.
13. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer-Verlag, 1999.
14. T. Feder and P. Hell. List homomorphisms to reflexive graphs. Journal of Combinatorial Theory, Ser.B, 72:236-250, 1998.
15. T. Feder and M. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing, 28:57-104, 1998.
16. T. Feder and M. Vardi. Homomorphism closed vs. existential positive. In Proc. 18th IEEE Symp. on Logic in Computer Science, LICS'03, pages 311-320, 2003.
17. M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. In Proc. 44th IEEE Symp. on Foundations of Computer Science, FOCS'03, pages 552-561, 2003.
18. P. Hell. Algorithmic aspects of graph homomorphisms. In C. Wensley, editor, Surveys in Combinatorics 2003, volume 307 of LMS Lecture Note Series, pages 239-276. Cambridge University Press, 2003.
19. P. Hell and I. Rival. Absolute retracts and varieties of reflexive graphs. Canadian Journal of Mathematics, 39:544-567, 1987.
20. M. Jawhari, D. Misane, and M. Pouzet. Retracts: graphs and ordered sets from metric point of view. Contemporary Mathematics, 57:175-226, 1986.
21. P. Jeavons, D. Cohen, and M. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1-2):251-265, 1998.
22. P. Kolaitis. On the expressive power of logics on finite models. In Finite Model Theory and its Applications, EATCS Series: Texts in Theoretical Computer Science. Springer, 2004. to appear.
23. P. Kolaitis and M. Vardi. On the expressive power of Datalog: tools and a case study. Journal of Computer and System Sciences, 51:110-134, 1995.
24. P. Kolaitis and M. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61:302-332, 2000.
25. A. Krokhin and B. Larose. Solving order constraints in logarithmic space. In Proc. 20th Int. Symp. on Theoretical Aspects of Computer Science, STACS'03, volume 2607 of LNCS, pages 379-390, 2003.
26. G. Kun and C. Szabó. Order varieties and monotone retractions of finite posets. Order, 18:79-88, 2001.
27. B. Larose, C. Loten, and L. Zádori. A polynomial-time algorithm to recognise near-unanimity graphs. submitted.
28. B. Larose and L. Zádori. Algebraic properties and dismantlability of finite posets. Discrete Mathematics, 163:89-99, 1997.
29. B. Larose and L. Zádori. The complexity of the extendibility problem for finite posets. SIAM Journal on Discrete Mathematics, 17(1):114-121, 2003.
30. P. Lincoln and J. Mitchell. Algorithmic aspects of type interference with subtypes. In Proc. 19th ACM Symp. on Principles of Programming Languages, POPL'92, pages 293-304, 1992.
31. J. Nešetřil and C. Tardif. Duality theorems for finite structures (characterising gaps and good characterisations). Journal of Combinatorial Theory, Ser.B, 80:80-97, 2000.
32. R. Pöschel and L. Kalužnin. Funktionen- und Relationenalgebren. DVW, Berlin, 1979.
33. V. Pratt and J. Tiuryn. Satisfiabilty of inequalities in a poset. Fundamenta Informaticae, 28:165-182, 1996.
34. L. Zádori. Relational sets and categorical equivalence of algebras. Int. Journal of Algebra and Computation, 7:561-576, 1997.