A constraint sequent calculus

Abstract

An axiomatic approach that accounts for examples that come up in logic programming, symbolic computation, affine geometry, and elsewhere is presented. It is shown that if disjunction behaves in an intuitionistic fashion, notions of canonical form for positive constraints can be systematically extended to include negative constraints. As a consequence, completeness theorems involving positive and negative constraints can be proven in a general setting for constraint propagation.