English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A Polynomial-Time Fragment of Dominance Constraints

Koller, A., Mehlhorn, K., & Niehren, J. (2000). A Polynomial-Time Fragment of Dominance Constraints. In Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00) (pp. 368-375). San Francisco, USA: Morgan Kaufmann.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3355-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3356-B
Genre: Conference Paper

Files

show Files
hide Files
:
Mehlhorn151.pdf (Any fulltext), 225KB
 
File Permalink:
-
Name:
Mehlhorn151.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-
:
151.pdf (Any fulltext), 243KB
 
File Permalink:
-
Name:
151.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Koller, Alexander1, Author
Mehlhorn, Kurt2, Author           
Niehren, Joachim, Author
Affiliations:
1Max Planck Society, ou_persistent13              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: Dominance constraints are a logical language for describing trees that is widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we identify \emph{normal} dominance constraints, a natural fragment whose satisfiability problem we show to be in polynomial time. We present a quadratic satisfiability algorithm and use it in another algorithm that enumerates solutions efficiently. Our result is useful for various applications of dominance constraints and related formalisms.

Details

show
hide
Language(s): eng - English
 Dates: 2008-01-222000
 Publication Status: Issued
 Pages: -
 Publishing info: San Francisco, USA : Morgan Kaufmann
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344451
Other: Local-ID: C1256428004B93B8-5D11991BA7D77D47C12569DC003C0D17-Koller-et-al:dominance-constraints
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Hong-Kong
Start-/End Date: -

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: San Francisco, USA : Morgan Kaufmann
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 368 - 375 Identifier: ISBN: 1-558-60729-3