Extensional set library for ECLiPSe

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1755, Issue , 2000, Pages 434-444

  Yakhno, Tatyana ^a   Petrov, Evgueni ^a  

^a A P ERSHOV INSTITUTE OF INFORMATICS SYSTEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CONSTRAINT PROGRAMMING; EXTENSIONAL SETS; GEOMETRIC APPLICATIONS; UNIFICATION ALGORITHMS;

INFORMATION SCIENCE;

EID: 84943278762     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46562-6_39     Document Type: Article

References (16)

1. Alexander Aiken and Edward L. Wimmers. Solving systems of set constraints. In IEEE Symp. on Logic in Comput. Sci., June 1992.
2. L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Proc. of the LICS'93, 1993.
3. Nicolos Christofides. Graph theory: an Algorithmic Approach. Management Sci-ence. Academic Press, Imperial College, London, 1975.
4. Agustino Dovier and G. Rossi. Embedding extensional finite sets in CLP. In Proc. 3rd Int. Logic Programming Symp., Vancouver, Canada, 1993.
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.
6. N. Heintze and J. Jafiar. A decision procedure for a class of set constraints. In IEEE Symp. on Logic in Comput. Sci., July 1991.
7. P. M. Hill and J. W. LLoyd. The G}odel programming language (CSTR 92-27). Bristol University, 1992.
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.
9. Bruno Legeard and E. Legros. Short overview of the CLPS system. In Proc. PLILP'91, Passau, Germany, August 1991.
10. Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99-118, 1977.
11. Alexander S. Narinyani. Subdefiniteness and basic means of knowledge represen-tation. Computers and Artificial Intelligence, 2(5):443-452, 1983.
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.
13. Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica: a Modelling Language for Global Optimization. The MIT Press, Cambridge, MA, 1997.
14. Clifford Walinsky. CLP(∑*): Constraint logic programming with regular sets. In Giorgio Levi and Maurizio Martelli, editors, Proc. 6th Int. Conf. on Logic Program-ming, pages 181-196, Lisbon, Portugal, June 1989. The MIT Press.
15. Tatyana M. Yakhno and Evgueni S. Petrov. LogiCalc: integrating constraint programming and subdefinite models. In Practical Application of Constraint Tech-nology, pages 357-372, Westminster Central Hall, London, UK, April 1996.
16. Tatyana M. Yakhno, Vyatcheslav Z. Zilberfaine, and Evgueni S. Petrov. Appli-cations of ECLiPSe: Interval Domain library. The ICL Systems Journal, pages 35-50, November 1997.