Dominance Constraints: Algorithms and Complexity
نویسندگان
چکیده
Dominance constraints for nite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their rst-order theory. We present two NP algorithms for solving dominance constraints, which have been implemented in the concurrent constraint programming language Oz. The main result of this paper is that the satissability problem of dominance constraints is NP-complete. Despite this intractability result, the more sophisticated of our algorithms performs well in an application to scope underspeciication. We also show that the existential fragment of the rst-order theory of dominance constraints is NP-complete and that the full rst-order theory has non-elementary complexity.
منابع مشابه
An efficient graph algorithm for dominance constraints
Dominance 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.
متن کاملSatellite Conceptual Design Multi-Objective Optimization Using Co Framework
This paper focuses upon the development of an efficient method for conceptual design optimization of a satellite. There are many option for a satellite subsystems that could be choice, as acceptable solution to implement of a space system mission. Every option should be assessment based on the different criteria such as cost, mass, reliability and technology contraint (complexity). In this rese...
متن کامل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 o...
متن کامل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...
متن کاملProcessing Underspecified Semantic Representations in the Constraint Language for Lambda Structures
The constraint language for lambda structures (CLLS) is an expressive language of tree descriptions which combines dominance constraints with powerful parallelism and binding constraints. CLLS was introduced as a uniform framework for defining underspecified semantics representations of natural language sentences, covering scope, ellipsis, and anaphora. This article presents saturation-based al...
متن کامل