ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of normal dominance constraints were recently proposed. We present a new and simpler graph algorithm solving these constraints more efficiently, in quadratic time per solved form. It also applies to weakly normal dominance constraints as needed for an application to computational linguistics. Subquadratic running time can be achieved employing decremental graph biconnectivity algorithms
We establish for the first time a formal relationship between dominance graphs, used for modeling se...
International audienceWe express dominance constraints in the once-only nesting fragment of stratifi...
International audienceMinimal Recursion Semantics (MRS) is the standard formalism used in large-scal...
ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Ef...
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of n...
Special Issue of SODA 2001.ISSN: 0196-6774International audienceDominance constraints are logical de...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Dominance constraints are a logical language for describing trees that is widely used in computatio...
Abstract. Dominance constraints logically describe trees in terms of their adjacency and dominance, ...
International audienceDominance constraints for finite tree structures are widely used in several ar...
Dominance constraints are logical tree descriptions originating from automata theory that have multi...
We present the first ever algorithm for solving unrestricted dominance graphs. The algorithm extends...
Abstract. We present an efficient algorithm that checks the satisfiability of pure dominance constra...
AbstractDominance constraints are a language of tree descriptions. Tree descriptions are widely used...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDominan...
We establish for the first time a formal relationship between dominance graphs, used for modeling se...
International audienceWe express dominance constraints in the once-only nesting fragment of stratifi...
International audienceMinimal Recursion Semantics (MRS) is the standard formalism used in large-scal...
ISBN: 0-89871-558-XInternational audienceDominance constraints are logical descriptions of trees. Ef...
Dominance constraints are logical descriptions of trees. Efficient algorithms for the subclass of n...
Special Issue of SODA 2001.ISSN: 0196-6774International audienceDominance constraints are logical de...
Dominance constraints are logical descriptions of trees that are widely used in computational lingui...
Dominance constraints are a logical language for describing trees that is widely used in computatio...
Abstract. Dominance constraints logically describe trees in terms of their adjacency and dominance, ...
International audienceDominance constraints for finite tree structures are widely used in several ar...
Dominance constraints are logical tree descriptions originating from automata theory that have multi...
We present the first ever algorithm for solving unrestricted dominance graphs. The algorithm extends...
Abstract. We present an efficient algorithm that checks the satisfiability of pure dominance constra...
AbstractDominance constraints are a language of tree descriptions. Tree descriptions are widely used...
Article dans revue scientifique avec comité de lecture. internationale.International audienceDominan...
We establish for the first time a formal relationship between dominance graphs, used for modeling se...
International audienceWe express dominance constraints in the once-only nesting fragment of stratifi...
International audienceMinimal Recursion Semantics (MRS) is the standard formalism used in large-scal...
Add to ORKG