A Polynomial-Time Fragment of Dominance Constraints

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.

• Type: Conference
• Year: 2000
• Where: ACL
• Authors: Alexander Koller, Kurt Mehlhorn, Joachim Niehren
• Keywords: ACL 2000, ACL 2007, Dominance Constraints, General Satisfiability Problem, Satisfiability Problem