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 deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
We consider the question "How much strong generative power can be squeezed out of a formal system without increasing its weak generative power?" and propose some theoret...