Abstract
Origins of the subdefinite approach lie aside from constraint programming, however, the approach essentially is a consistency technique which works with abstract domains and procedurally given semantics of constraints. The approach generalizes many constraint programming techniques. We present LogiCalc, a system which uses subdefinite models for solving arbitrary equations over atoms, integers, tuples, and extensional and intentional sets. We describe its input language and some details of set processing.
Supported in part by Russian Foundation for Fundamental Research under grant 96-01-01608
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Jacques Cohen. Constraint logic programming languages. Communications of the ACM, 33(7):52–68, July 1990.
Alain Colmerauer. An introduction to Prolog III. Communications of the ACM, 33(7):69–90, July 1990.
Y. Caseau and J.-F. Puget. Constraints on order-sorted domains. In Thomas Schiex, editor, Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, Amsterdam, August 1994.
A. Dovier and G. Rossi. Embedding extensional finite sets in CLP. In ILPS'93: Proceedings 3rd International Logic Programming Symposium, Vancouver, 1993.
M. Dincbas, H. Simonis, A. Aggoun P. Van Hentenryck, T. Graf, and E. Berthier. The constraint logic programming language CHIP. In FGCS'88, Tokyo, November 1988. ICOT.
ECRC. ECLiPSe 3.5 ECRC Common Logic Programming System, 1995.
Eugene C. Freuder and Richard J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992.
Carmen Gervet. Conjunto: Constraint logic programming with finite set domains. In M. Bruynooghe, editor, ILPS'94, pages 339–358, 1994.
Eero Hyvönen. Constraint reasoning based on interval arithmetic: the tolerance propagation approach. Artificial Intelligence, 58:71–112, 1992.
B. Legeard and E. Legros. Short overview of the CLPS system. In Proceedings of PLILP'91, Passau, Germany, August 1991.
Alan K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977.
B. Mayoh, E. Tyugu, and J. Penjaam, editors. Constraint Programming: Proceedings 1993 NATO ASI Parnu, Estonia, NATO Advanced Science Institute Series. Springer-Verlag, 1994.
Alexander S. Narinyani. Subdefiniteness and basic means of knowledge representation. Computers and Artificial Intelligence, 2(5):443–452, 1983.
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.
Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, 1989.
Clifford Walinsky. CLP(Σ *): Constraint logic programming with regular sets. In Giorgio Levi and Maurizio Martelli, editors, ICLP'89: Proceedings 6th International Conference on Logic Programming, pages 181–196, Lisbon, Portugal, June 1989. MIT Press.
T.M. Yakhno. Constraint programming: survey and classification of approaches and methods, volume 4 of System Informatics, pages 160–193. Nauka, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yakhno, T.M., Petrov, E.S. (1996). Application of subdefinite models for solving constraint satisfaction problems. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Perspectives of System Informatics. PSI 1996. Lecture Notes in Computer Science, vol 1181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62064-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-62064-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62064-8
Online ISBN: 978-3-540-49637-3
eBook Packages: Springer Book Archive