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 条

[1] A Polynomial-time Fragment of Epistemic Probabilistic Argumentation
Potyka, Nico
AAMAS '19: PROCEEDINGS OF THE 18TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2019, : 2165 - 2167
[2] A polynomial-time fragment of epistemic probabilistic argumentation
Potyka, Nico
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2019, 115 : 265 - 289
[3] BANDWIDTH CONSTRAINTS ON PROBLEMS COMPLETE FOR POLYNOMIAL-TIME
SUDBOROUGH, IH
THEORETICAL COMPUTER SCIENCE, 1983, 26 (1-2) : 25 - 52
[4] A POLYNOMIAL-TIME ALGORITHM FOR FRACTIONAL PROGRAMS WITH CONVEX CONSTRAINTS
FREUND, RW
JARRE, F
ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1994, 74 (06): : T523 - T525
[5] Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Joshua A. Grochow
Theory of Computing Systems, 2023, 67 : 627 - 669
[6] An auction mechanism for polynomial-time execution with combinatorial constraints
Andersson, A
Holmström, J
Willman, M
CEC 2005: SEVENTH IEEE INTERNATIONAL CONFERENCE ON E-COMMERCE TECHNOLOGY, PROCEEDINGS, 2005, : 17 - 24
[7] Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Grochow, Joshua A.
THEORY OF COMPUTING SYSTEMS, 2023, 67 (03) : 627 - 669
[8] Polynomial-Time Updates of Epistemic States in a Fragment of Probabilistic Epistemic Argumentation
Potyka, Nico
Polberg, Sylwia
Hunter, Anthony
SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2019, 2019, 11726 : 74 - 86
[9] Polynomial-time normalizers
Luks, Eugene M.
Miyazaki, Takunari
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2011, 13 (04): : 61 - 96
[10] AN EXPLICIT SEPARATION OF RELATIVISED RANDOM POLYNOMIAL-TIME AND RELATIVISED DETERMINISTIC POLYNOMIAL-TIME
ZIPPEL, R
INFORMATION PROCESSING LETTERS, 1989, 33 (04) : 207 - 212

← 1 2 3 4 5 →