Alexander Koller Joachim Niehren, Ralf Treinen  Home/Search
Context Related
| coli.unisb.de/~koll...domnplang.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: coli.unisb.de/~kolle...shortinfo (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Dominance constraints for finite 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 first-order theory. The main result of this paper is that the satisfiability problem of dominance constraints is NP-complete. We present two NP algorithms for solving dominance constraints, which have been implemented in the concurrent... (Update)
Context of citations to this paper: More
...the ecient computational treatment of tree descriptions. Recently, two algorithms were proposed for solving dominance constraints: [KNT98] proposed a saturation based method motivated by an application to underspeci ed semantics, while [DG99] described an encoding into...
...ability testing does the constraint describe a tree and enumerating solutions, i.e. the described trees. But as shown recently [13], testing satis ability is an NP complete problem. Earlier attempts at processing dominance constraints [14 16] all su er from this fact....
Cited by: More
A Polynomial-Time Fragment of Dominance Constraints - Koller, Mehlhorn, Niehren (2000) (Correct)
A New Algorithm for Normal Dominance Constraints - Bodirsky, Duchier, Niehren.. (2003) (Correct)
Constraint Programming for Natural Language Processing - Duchier (2000) (Correct)
Similar documents (at the sentence level):
64.0%: Dominance Constraints: Algorithms and Complexity - Koller, Niehren, Treinen (1998) (Correct)
Active bibliography (related documents): More All
0.7: Dominance Constraints in Context Unification - Niehren, Koller (1998) (Correct)
0.6: Processing Underspecified Semantic Representations in the.. - Erk, Koller (2002) (Correct)
0.4: Solving Dominance Constraints with Finite Set Constraint.. - Duchier, Niehren (1999) (Correct)
Similar documents based on text: More All
1.5: An Efficient Algorithm for the Configuration.. - Althaus, Duchier, .. (Correct)
1.5: Scope Underspecification and Processing - Koller, Niehren (Correct)
1.3: Dominance Constraints with Set Operators - Duchier, Niehren (2000) (Correct)
Related documents from co-citation: More All
18: Describing discourse semantics - Gardent, Webber - 1998
17: Constraints over lambda-structures in semantic underspecification - Egg, Niehren et al. - 1998
17: theory: Talking about talking about trees (context) - Marcus, Hindle et al. - 1983
BibTeX entry: (Update)
Alexander Koller, Joachim Niehren, and Ralf Treinen. Dominance constraints: Algorithms and complexity. In Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, Grenoble, 1998. http://citeseer.ist.psu.edu/article/koller98dominance.html More
@article{ koller01dominance,
author = "Alexander Koller and Joachim Niehren and Ralf Treinen",
title = "Dominance Constraints: Algorithms and Complexity",
journal = "Lecture Notes in Computer Science",
volume = "2014",
pages = "106+",
year = "2001",
url = "citeseer.ist.psu.edu/article/koller98dominance.html" }
Citations (may not include all citations):274 A catalog of complexity classes (context) - Johnson - 1990
271 The Oz Programming Model - Smolka - 1995
241 Decidability of second-order theories and automata on innite.. (context) - Rabin - 1969
105 Word problems requiring exponential time (context) - Stockmeyer, Meyer - 1973
65 Predicate logic unplugged - Bos - 1996
56 theory: Talking about talking about trees (context) - Marcus, Hindle et al. - 1983
54 Using descriptions of trees in a tree adjoining grammar (context) - Vijay-Shanker - 1992
36 Constraints over Lambda-Structures in Semantic Underspecicat.. - Egg, Niehren et al. - 1998
27 Describing discourse semantics - Gardent, Webber - 1998
27 Studies in the Logic of Trees with Applications to Grammar F.. (context) - Rogers - 1994
23 A constraint-based treatment of descriptions - Duchier, Gardent - 1999
21 Dealing with ambiguities by underspecication: construction (context) - Reyle - 1993
19 Obtaining trees from their descriptions: An application to t.. - Rogers, Vijay-Shanker - 1994
16 Fundamental properties of innite trees (context) - Courcelle - 1983
12 Generalized nite automata with an application to a decision .. (context) - Thatcher, Wright - 1968
12 A rst-order axiomatization of the theory of nite trees (context) - Backofen, Rogers et al. - 1995
7 Underspecied semantics - Muskens - 1998
6 Sequential construction of logical forms (context) - Meyer-Viol, Kempson - 1998
4 Constraint languages for semantic underspecication (context) - Koller - 1999
4 Relaxing underspeci ed semantic representations for reinterp.. (context) - Koller, Niehren et al. - 1999
2 The Mozart Programming System web pages (context) - Team - 1999
1 Finite set constraints in Oz - uller, uller - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.coli.uni-sb.de/~koller/papers/shortinfo):
Relaxing Underspecified Semantic Representations for.. - Koller, Niehren.. (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC