ML p(r)ior | Nested satisfiability

Nested satisfiability

9301111 | cs.CC
A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations