A polynomial-time fragment of dominance constraints

被引：0
|
作者：
Koller, A [1 ]
Mehlhorn, K [1 ]
Niehren, J [1 ]
机构：
[1] Univ Saarland, Max Planck Inst Comp Sci, Saarbrucken, Germany
来源：
38TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE | 2000年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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 the natural fragment of normal dominance constraints and show that its satisfiability problem is in deterministic polynomial time.
引用
收藏
页码：368 / 375
页数：8
相关论文
共 50 条
12345