Add to ORKGDominance 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 identify the natural fragment of normal dominance constraints and show that its satisfiability problem is in deterministic polynomial time.
Dominance based tree descriptions are widely used in computational linguistics. Many practical probl...
The exploitation of dominance relations in constraint optimization problems can lead to dramatic red...
AbstractWe present an efficient algorithm that decides the consistency of partial descriptions of or...
Dominance constraints are a logical language for describing trees that is widely used in computation...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Abstract. Dominance constraints logically describe trees in terms of their adjacency and dominance, ...
Abstract. We present an efficient algorithm that checks the satisfiability of pure dominance constra...
Dominance constraints are logical tree descriptions originating from automata theory that have multi...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Dominance constraints for finite tree structures are widely used in several areas of computational l...
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of n...
ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Ef...
AbstractDominance constraints are a language of tree descriptions. Tree descriptions are widely used...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDominan...
Dominance based tree descriptions are widely used in computational linguistics. Many practical probl...
The exploitation of dominance relations in constraint optimization problems can lead to dramatic red...
AbstractWe present an efficient algorithm that decides the consistency of partial descriptions of or...
Dominance constraints are a logical language for describing trees that is widely used in computation...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Abstract. Dominance constraints logically describe trees in terms of their adjacency and dominance, ...
Abstract. We present an efficient algorithm that checks the satisfiability of pure dominance constra...
Dominance constraints are logical tree descriptions originating from automata theory that have multi...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Dominance constraints for finite tree structures are widely used in several areas of computational l...
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of n...
ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Ef...
AbstractDominance constraints are a language of tree descriptions. Tree descriptions are widely used...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDominan...
Dominance based tree descriptions are widely used in computational linguistics. Many practical probl...
The exploitation of dominance relations in constraint optimization problems can lead to dramatic red...
AbstractWe present an efficient algorithm that decides the consistency of partial descriptions of or...