Incremental Satisfiability and Implication for UTVPI Constraints

Details Incremental Satisfiability and Implication for UTVPI Constraints Incremental Satisfiability and Implication for UTVPI Constraints

2007-09-19

arxiv.org/abs/0709.2961v1

Computer Science

Data Structures and Algorithms

14 pages, 1 figure

Scientific paper

Unit two-variable-per-inequality (UTVPI) constraints form one of the largest class of integer constraints which are polynomial time solvable (unless P=NP). There is considerable interest in their use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop a new incremental algorithm for UTVPI constraint satisfaction and implication checking that requires O(m + n log n + p) time and O(n+m+p) space to incrementally check satisfiability of m UTVPI constraints on n variables and check implication of p UTVPI constraints.

Affiliated with

Also associated with

No associations

Rating

Incremental Satisfiability and Implication for UTVPI Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Incremental Satisfiability and Implication for UTVPI Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Incremental Satisfiability and Implication for UTVPI Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-336371