Presentations (Communicative Events)

Solving Unrestricted Dominance Graphs

Koller, Alexander; Thater, Stefan

We present the first ever algorithm for solving unrestricted dominance graphs. The algorithm extends existing polynomial solvers for restricted classes of dominance graphs, which are not sufficient to model newer theories of scope ambiguity. Using the new solver, these theories now have access to an efficient solver for the first time. The solver runs in cubic time; for those graph classes that could be solved in the past, the runtime is reduced to the same quadratic time that the most efficient previous solvers achieved.


More About This Work

Academic Units
Computer Science
12th Conference on Formal Grammar
Published Here
July 14, 2013