#### Filter Results:

- Full text PDF available (88)

#### Publication Year

2001

2017

- This year (4)
- Last 5 years (36)
- Last 10 years (76)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

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)

- Manuel Bodirsky, Jan Kára
- J. ACM
- 2008

A <i>temporal constraint language</i> is a set of relations that has a first-order definition in(Q;<), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint language is contained in one out of nine temporal… (More)

- Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
- ICALP
- 2003

We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that count all such graphs with vertices and edges, based on a decomposition into 1-, 2-, and 3-connected components. For 3-connected graphs we apply a recent random generation algorithm by… (More)

- Manuel Bodirsky, Martin Grohe
- ICALP
- 2008

We show that every computational decision problem is polynomialtime equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem L an ω-categorical template Γ such that L reduces to CSP(Γ ) and CSP(Γ ) is in coNP (i.e., the class coNP with an oracle for L). CSPs with ω-categorical templates… (More)

- Manuel Bodirsky
- ArXiv
- 2012

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)

- Manuel Bodirsky, Hubie Chen
- 22nd Annual IEEE Symposium on Logic in Computer…
- 2007

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)

- Manuel Bodirsky, Jan Kára
- Theory of Computing Systems
- 2006

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)

- Manuel Bodirsky, Víctor Dalmau
- J. Comput. Syst. Sci.
- 2006

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)

- Manuel Bodirsky
- 2004

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)