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 normal dominance constraints and present an efficient graph algorithm for testing their satisfiablity in deterministic polynomial time. Previously, no polynomial time algorithm was known
AbstractDominance constraints are a language of tree descriptions. Tree descriptions are widely used...
AbstractWe present an efficient algorithm that decides the consistency of partial descriptions of or...
We establish for the first time a formal relationship between dominance graphs, used for modeling se...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Special Issue of SODA 2001.ISSN: 0196-6774International audienceDominance constraints are logical de...
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...
Dominance constraints are logical tree descriptions originating from automata theory that have multi...
Dominance constraints are a logical language for describing trees that is widely used in computation...
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 for finite tree structures are widely used in several areas of computational l...
We present the first ever algorithm for solving unrestricted dominance graphs. The algorithm extends...
Dominance based tree descriptions are widely used in computational linguistics. Many practical probl...
AbstractDominance constraints are a language of tree descriptions. Tree descriptions are widely used...
AbstractWe present an efficient algorithm that decides the consistency of partial descriptions of or...
We establish for the first time a formal relationship between dominance graphs, used for modeling se...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Special Issue of SODA 2001.ISSN: 0196-6774International audienceDominance constraints are logical de...
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...
Dominance constraints are logical tree descriptions originating from automata theory that have multi...
Dominance constraints are a logical language for describing trees that is widely used in computation...
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 for finite tree structures are widely used in several areas of computational l...
We present the first ever algorithm for solving unrestricted dominance graphs. The algorithm extends...
Dominance based tree descriptions are widely used in computational linguistics. Many practical probl...
AbstractDominance constraints are a language of tree descriptions. Tree descriptions are widely used...
AbstractWe present an efficient algorithm that decides the consistency of partial descriptions of or...
We establish for the first time a formal relationship between dominance graphs, used for modeling se...