• Refine your search:
  • 
    Keyword:
    
    • complexity (6)
    • computational linguistics (6)
    • underspeci (3)
    • constraint programming (2)
    • underspeci cation (2)
  • 
    Creator / Publisher:
    
    • Alexander Koller (6)
    • Joachim Niehren (6)
    • Ralf Treinen (6)
    • The Pennsylvania State University CiteSeerX Archives (6)
    • Alexander Koller Joachim Niehren (1)
  • 
    Year
  • 
    Medium
  • 
    Type:
    
    • Article (6)
  • 
    BLLDB-Access:
    • free (6)
    • subject to license (0)

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 6 of 6 1 Dominance Constraints: Algorithms and Complexity Alexander Koller; Joachim Niehren; Ralf Treinen In: ftp://ftp.lri.fr/LRI/articles/treinen/lacl-short.ps.gz (1998) BASE Show details 2 Dominance Constraints: Algorithms and Complexity Alexander Koller Joachim Niehren; Alexander Koller; Joachim Niehren; Ralf Treinen In: http://www.coli.uni-sb.de/~koller/papers/domnp-lang.ps.gz (1998) 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 constraint programming language Oz. Despite the intractability result, the more sophisticated of our algorithms performs well in an application to scope underspecification. We also show that the positive existential fragment of the first-order theory of dominance constraints is NP-complete and that the full first-order theory has non-elementary complexity. Keyword: complexity; computational linguistics; constraint programming; underspeci cation URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.5410 http://www.coli.uni-sb.de/~koller/papers/domnp-lang.ps.gz BASE Hide details 3 Dominance Constraints: Algorithms and Complexity Alexander Koller; Joachim Niehren; Ralf Treinen In: http://www.coli.uni-sb.de/~koller/papers/domnp.ps.gz (1998) BASE Show details 4 Dominance Constraints: Algorithms and Complexity Alexander Koller; Joachim Niehren; Ralf Treinen In: http://www.coli.uni-sb.de/sfb/psfiles/KollerNiehrenTreinen1998.ps.gz (1998) BASE Show details 5 Dominance Constraints: Algorithms and Complexity Alexander Koller; Joachim Niehren; Ralf Treinen In: http://www.ps.uni-sb.de/Papers/abstracts/DominanceNP98-abs.ps (1998) BASE Show details 6 Dominance Constraints: Algorithms and Complexity Alexander Koller; Joachim Niehren; Ralf Treinen In: http://www.ps.uni-sb.de/Papers/abstracts/DominanceNP98.ps (1998) BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 6 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0