论文信息 - Caterpillar Dualities and Regular Languages

Caterpillar Dualities and Regular Languages

We characterize obstruction sets in caterpillar dualities in terms of regular languages and give a construction of the dual of a regular family of caterpillars. In particular, we prove that every monadic linear Datalog program with at most one extensional database per rule defines the complement of a contraint satisfaction problem.

[1] Libor Barto,et al. Constraint Satisfaction Problems of Bounded Width , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[2] P. Pálfy,et al. ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS, HUNGARIAN ACADEMY OF SCIENCES , 2014 .

[3] A. Pultr,et al. The right adjoints into the categories of relational systems , 1970 .

[4] Eitan M. Gurari,et al. Introduction to the theory of computation , 1989 .

[5] Claude Tardif,et al. Adjoint functors and tree duality , 2009, Discret. Math. Theor. Comput. Sci..

[6] Gábor Tardos,et al. On Infinite–finite Duality Pairs of Directed Graphs , 2013, Order.

[7] Andrei A. Bulatov,et al. Dualities for Constraint Satisfaction Problems , 2008, Complexity of Constraints.

[8] Andrei A. Krokhin,et al. Caterpillar Duality for Constraint Satisfaction Problems , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[9] Gábor Tardos,et al. On infinite-finite tree-duality pairs of relational structures , 2012, ArXiv.

[10] Jaroslav Nesetril,et al. Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations) , 2000, J. Comb. Theory, Ser. B.

[11] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..