Dominance Constraints and Dominance Graphs
نویسنده
چکیده
Dominance constraints logically describe trees in terms of their adjacency and dominance, i.e. reachability, relation. They have important applications in computational linguistics. Unfortunately, the satisfiability problem of dominance constraints is NP-complete. In this extended abstract we describe efficient algorithms for natural subclasses of dominance constraints [BDNM03]. The instances of these subclasses are more appropriately formulated as configuration problems of so called dominance graphs. We show that for one particular subclass satisfiability can be characterized in terms of forbidden subgraphs in the corresponding dominance graph [ADKMNT]. These forbidden subgraphs can be found in linear time [Th04].
منابع مشابه
Electricity Procurement for Large Consumers with Second Order Stochastic Dominance Constraints
This paper presents a decision making approach for mid-term scheduling of large industrial consumers based on the recently introduced class of Stochastic Dominance (SD)- constrained stochastic programming. In this study, the electricity price in the pool as well as the rate of availability (unavailability) of the generating unit (forced outage rate) is considered as uncertain parameters. Th...
متن کاملRelationship between Iranian EFL Teachers' Brain Dominance, Teaching Experience and their Teaching Style
The present study sought to explore the relationship between Iranian EFL teachers' brain dominance, teaching experience and their teaching style. The study population consisted of all EFL teachers of high schools in Shiraz holding a B.A degree, with the sample consisting of 100 participants recruited through convenience sampling. The study employed a descriptive correlational design. To collect...
متن کاملRelationship between Iranian EFL Teachers' Brain Dominance, Teaching Experience and their Teaching Style
The present study sought to explore the relationship between Iranian EFL teachers' brain dominance, teaching experience and their teaching style. The study population consisted of all EFL teachers of high schools in Shiraz holding a B.A degree, with the sample consisting of 100 participants recruited through convenience sampling. The study employed a descriptive correlational design. To collect...
متن کاملConstraint-based and graph-based resolution of ambiguities in natural language
This thesis develops the theory of dominance constraints, a family of logical languages that describe trees, and applies them as a formalism for the underspecified description of scope ambiguities in natural language. In underspecification approaches to ambiguity resolution, all readings of a sentence at once are represented in an underspecified description, and are only enumerated by need. On ...
متن کاملDD* Lite: Efficient Incremental Search with State Dominance
This technical report presents DD* Lite, an efficient incremental search algorithm for problems that can capitalize on state dominance. Dominance relationships between nodes are used to prune graphs in search algorithms. Thus, exploiting state dominance relationships can considerably speed up search problems in large state spaces, such as mobile robot path planning considering uncertainty, time...
متن کامل