This paper presents the Constraint Language for Lambda Structures (CLLS), a first-order
language for semantic underspecification thatconservatively extends dominance constraints …

In this paper, we investigate the complexity of deciding the satisfiability of XPath 2.0
expressions, ie, whether there is an XML document for which their result is nonempty …

This paper sets up a framework for Lexicalized Tree Adjoining Grammar (LTAG) semantics
that brings together ideas from different recent approaches addressing some shortcomings …

The μ-calculus is a powerful tool for specifying and verifying transition systems, including
those with demonic (universal) and angelic (existential) choice; its quantitative …

In this thesis, two requirements on Underspecified Representation Formalisms are
investigated in detail in the context of underspecification of scope. The requirement on …

Many constraint satisfaction problems have a natural formulation as a homomorphism
problem. For a fixed relational structure Gamma we consider the following computational …

Dominance constraints are logical descriptions of trees that are widely used in
computational linguistics. Their general satisfiability problem is known to be NP-complete …

We describe the evolution of solvers for dominance constraints, a formalism used in
underspecified semantics, and present a new graph-based solver using charts. An …

Dominance constraints are widely used in computational linguistics as a language for
talking and reasoning about trees. In this paper, we extend dominance constraints by …

The maximum detour and spanning ratio of an embedded graph G are values that measure
how well G approximates Euclidean space and the complete Euclidean graph, respectively …