Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
Geometric constraints solving often relies on graphbased methods to decompose systems of geometric constraints. These methods have intrinsic and unavoidable limitations which are ...
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
This paper reports a pilot study, in which Constraint Grammar inspiredruleswere learnt using the Progol machine-learning system. Rules discarding faulty readings of ambiguously ta...