Skip to main content

Extensional Set Library for ECLiPSe

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1755))

Abstract

Extensional Set (XS) library is an extension of ECLiPSe which solves set-theoretical constraints over extensional sets containing variables with numeric domains. To efficiently process such a class of set domains, XS library employs a constraint programming method called Subdefinite Computations. Within that framework, a domain representation and an approximate unification algorithm are proposed. The abilities of the library are illustrated by a geometric application.

This project is supported by grant 98-06 from Institut Franco-Russe A. M. Liapunov d’informatique et de mathématiques appliquées.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alexander Aiken and Edward L. Wimmers. Solving systems of set constraints. In IEEE Symp. on Logic in Comput. Sci., June 1992.

    Google Scholar 

  2. L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Proc. of the LICS’93, 1993.

    Google Scholar 

  3. Nicolos Christofides. Graph theory: an Algorithmic Approach. Management Science. Academic Press, Imperial College, London, 1975.

    Google Scholar 

  4. Agustino Dovier and G. Rossi. Embedding extensional finite sets in CLP. In Proc. 3rd Int. Logic Programming Symp., Vancouver, Canada, 1993.

    Google Scholar 

  5. Carmen Gervet. Conjunto: Constraint logic programming with finite set domains. In M. Bruynooghe, editor, ILPS’94: Proc. 4th Int. Logic Programming Symp., pages 339–358, 1994.

    Google Scholar 

  6. N. Heintze and J. Jaffar. A decision procedure for a class of set constraints. In IEEE Symp. on Logic in Comput. Sci., July 1991.

    Google Scholar 

  7. P. M. Hill and J. W. LLoyd. The GÅ‘del programming language (CSTR 92-27). Bristol University, 1992.

    Google Scholar 

  8. S. V. Konyagin, G. A. Tonoyan, I. F. Sharygin, I. A. Kopylov, M. B. Cevryuk, M. L. Sitnikov, O. A. Baiborodin, V. P. Burichenko, G. V. Golovin, D. O. Orlov, L. B. Parnovski, T. A. Sokova, I. V. Stetsenko, V. V. Titenko, and S. A. Filippov. International Mathematical Contests. Moskva: Nauka, 1987.

    Google Scholar 

  9. Bruno Legeard and E. Legros. Short overview of the CLPS system. In Proc. PLILP’91, Passau, Germany, August 1991.

    Google Scholar 

  10. Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  11. Alexander S. Narinyani. Subdefiniteness and basic means of knowledge representation. Computers and Artificial Intelligence, 2(5):443–452, 1983.

    Google Scholar 

  12. J.T. Schwartz, R.B.K. Dewar, E. Dubinsky, and E. Schonberg. Programming with Sets. An Introduction to SETL. Texts and Monographs in Computer Science. Springer-Verlag, 1986.

    Google Scholar 

  13. Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica: a Modelling Language for Global Optimization. The MIT Press, Cambridge, MA, 1997.

    Google Scholar 

  14. Clifford Walinsky. CLP(Σ*): Constraint logic programming with regular sets. In Giorgio Levi and Maurizio Martelli, editors, Proc.6th Int.Conf. on Logic Programming, pages 181–196, Lisbon, Portugal, June 1989. The MIT Press.

    Google Scholar 

  15. Tatyana M. Yakhno and Evgueni S. Petrov. LogiCalc: integrating constraint programming and subdefinite models. In Practical Application of Constraint Technology, pages 357–372, Westminster Central Hall, London, UK, April 1996.

    Google Scholar 

  16. Tatyana M. Yakhno, Vyatcheslav Z. Zilberfaine, and Evgueni S. Petrov. Applications of ECLiPSe: Interval Domain library. The ICL Systems Journal, pages 35–50, November 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yakhno, T., Petrov, E. (2000). Extensional Set Library for ECLiPSe . In: Bjøner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 1999. Lecture Notes in Computer Science, vol 1755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46562-6_39

Download citation

  • DOI: https://doi.org/10.1007/3-540-46562-6_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67102-2

  • Online ISBN: 978-3-540-46562-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics