Negative Boolean constraints

Systems of Boolean constraints which allow negative constraints such as f ⊊︀ g are investigated. The results form a basis for algorithms to determine satisfiability, validity, implication, equivalence and variable elimination for such systems. These algorithms have applications in spatial query decomposition, machine reasoning and constraint logic programming. Proofs of the results rely on independence of inequations, which enables results for systems with a single inequation to be lifted to systems with many inequations.

Authors

• Kim Marriott
• Martin Odersky

Keywords

No keywords are indexed for this paper.