Their general satisfiability problem is known to be NP-complete. Here we identify normal dominance constraints and present an efficient graph algorithm for ...

We present an efficient graph algorithm that decides satisfiability of normal dominance constraints in deterministic polynomial time. Previously, no polynomial.

Here we identify normal dominance constraints and present an efficient graph algorithm for testing their satisfiability in deterministic polynomial time ...

A new and simpler graph algorithm solving dominance constraints more efficiently, in quadratic time per solved form is presented, which applies to weakly ...

Their general satisfiability problem is known to be NP-complete. Here we identify normal dominance constraints and present an efficient graph algorithm for ...

Their general satisfiability problem is known to be NP-complete. Here we identify normal dominance constraints and present an efficient graph algorithm for ...

The basic idea behind it is to derive for a sentence that exhibits a scope ambiguity a compact underspecified representation (USR) that describes the set of ...

Here we identify normal dominance constraints and present an efficient graph algorithm for testing their satisfiablity in deterministic polynomial time.

Abstract. Dominance constraints are logical descriptions of trees. Effi- cient algorithms for the subclass of normal dominance constraints were.

In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints).