Tractable constraints in finite semilattices

https://doi.org/10.1016/S0167-6423(99)00011-8Get rights and content
Under an Elsevier user license
open archive

Abstract

We introduce the notion of definite inequality constraints involving monotone functions in a finite meet-semilattice, generalizing the logical notion of Horn-clauses, and we give a linear time algorithm for deciding satisfiability. We characterize the expressiveness of the framework of definite constraints and show that the algorithm uniformly solves exactly the set of all meet-closed relational constraint problems, running with small linear time constant factors for any fixed problem. We give an alternative technique for reducing inequalities to satisfiability of Horn-clauses (HORNSAT) and study its efficiency. Finally, we show that the algorithm is complete for a maximal class of tractable constraints, by proving that any strict extension will lead to NP-hard problems in any meet-semilattice.

Keywords

Finite semilattices
Constraint satisfiability
Program analysis
Tractability
Algorithms

Cited by (0)

1

This work was done while the first author was at DIKU.