Skip to main content
SpringerLink
Log in

Involution Narrowing Algebra

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

The narrowing algebra formalism underlying CLP(intervals) consists of lattice-ordered monoids of monotone contractions on the lattice of states; these are generated by the canonical idempotent operators of the primitive relations of the constraint system used for the problem. This mathematical structure has some similarities with that of some classical operator rings, even though the underlying states form a non-Boolean lattice instead of a linear space. In this paper we show that in the restricted case of certain binary interval convex primitives, there is a broken symmetry which can be restored by generalizing the state lattice to produce an involution on the important fragment of the narrowing algebra. This involution allows some basic theorems of classical *-rings to be ported into this domain.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • F. Benhamou & W.J. Older. (1997). “Applying Interval Arithmetic to Real, Integer and Boolean Constraints,” Journal of Logic Programming, 32(1): 1-24.

    Google Scholar 

  • S.K. Berberian. (1972). Baer*-rings, Springer Verlag, Berlin.

    Google Scholar 

  • J.C. Cleary. (1987). “Logical Arithmetic,” Future Computing Systems, 2(2): 125-149.

    Google Scholar 

  • P. Girodias, E. Cerny & W.J. Older. (1995). “Solving Linear, Min and Max Constraint Systems Using CLP based on Relational Interval Arithmetic,” Proc. First International Conference on Principles and Practice of Constraint Programming (CP' 95), Cassis, France.

  • P. Girodias, E, Cerny & W.J. Older. (1997). “Solving Linear, Min and Max Constraint Systems Using CLP based on Relational Interval Arithmetic,” Journal on Theoretical Computer Science.

  • J.H. M. Lee & M.H. Van Emden. (1992). “Adapting CLP(R) to Floating Point Aritmetic,” Proc. of the Fifth Generation Computer System Conference, Tokyo, Japan.

  • W.J. Older. (1993). “Progress in Relational Interval Arithmetic,” Proceedings of Workshp on Constraint Logic Programming (WCLP' 93), Marseille.

  • W.J. Older & A. Vellino. (1993). “Constraint Arithmetic on Real Intervals,” Constraint Logic Programming: Selected Research, ed. by F. Benhamou and A. Colmerauer, MIT Press, Cambridge, pp. 175–195.

    Google Scholar 

  • W.J. Older. (1995). “Involution Narrowing Algebra,” roceedings of Constraint Workshop, International LogicProgramming Symposium, Portland, Oregon.

  • G.F. Simmons. (1963). Introduction to Topology and Modern Analysis, McGraw-Hill.

  • M.H. Van Emden. (1995). “Value Constraints in the CLP Scheme,”Workshop on Interval Constraints, ILPS' 95, Portland, Oregon.

Download references

Author information

Authors and Affiliations

  1. Bell Northern Research Ltd., P. O. Box 3511, Station C, Ottawa, Ontario, Canada, K1Y 4H7

    William J. Older

Authors
  1. William J. Older
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Older, W.J. Involution Narrowing Algebra. Constraints 2, 113–130 (1997). https://doi.org/10.1023/A:1009701608825

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009701608825

Search

Navigation