Manuel Bodirsky

Learn More
This paper investigates drawings (totally ordered forests) as models of syntactic structure. It offers a new model-based perspective on lexicalised Tree Adjoining Grammar by characterising a class of drawings structurally equivalent to tag derivations. The drawings in this class are distinguished by a restricted form of non-projectivity (gap degree at most(More)
appeared in the proceedings of ICDT’10. [44] M. Bodirsky and J. Nešetřil. Constraint satisfaction with countable homogeneous templates. In Proceedings of CSL, pages 44–57, Vienna, 2003. [45] M. Bodirsky and J. Nešetřil. Constraint satisfaction with countable homogeneous templates. Journal of Logic and Computation, 16(3):359–373, 2006. [46] M. Bodirsky and(More)
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: these problems are in L (decidable in logarithmic(More)
We classify the computational complexity of all constraint satisfaction problems where the constraint language is preserved by all permutations of the domain. A constraint language is preserved by all permutations of the domain if and only if all the relations in the language can be defined by boolean combinations of the equality relation. We call the(More)
On finite structures, there is a well-known connection between the expressive power of Datalog, finite variable logics, the existential pebble game, and bounded hypertree duality. We study this connection for infinite structures. This has applications for constraint satisfaction with infinite templates. If the template Γ is ω-categorical, we present various(More)
Constraint satisfaction problems occur in many areas of computer science, most prominently in artificial intelligence including temporal or spacial reasoning, belief maintenance, machine vision, and scheduling (for an overview see [Kumar, 1992,Dechter, 2003]). Other areas are graph theory, boolean satisfiability, type systems for programming languages,(More)
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of <i>normal dominance constraints</i> were recently proposed. We present a new and simpler graph algorithm solving these constraints more efficiently, in quadratic time per solved form. It also applies to weakly normal dominance constraints as needed for an(More)