Paper: A constraint sequent calculus (at LICS 1990)

Authors: Jean-Louis Lassez Ken McAloon

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

BibTeX

  @InProceedings{LassezMcAloon-Aconstraintsequentc,
    author = 	 {Jean-Louis Lassez and Ken McAloon},
    title = 	 {A constraint sequent calculus},
    booktitle =  {Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science (LICS 1990)},
    year =	 {1990},
    month =	 {June}, 
    pages =      {52--61},
    location =   {Philadelphia, PA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }