Abstract
Cspcons is a programming language that supports program execution over multiple Prolog processes with constraints. The language is an extended version of Csp-ii, a version of Prolog that supports, among other features, channel-based communicating processes and TCP/IP communication and is based on the CSP model introduced by Hoare. Cspcons inherits all the advanced features of Csp-ii and extends it by introducing constraint solving capabilities to the processes. In Cspcons each Prolog process has one or more solvers attached and each solver is independent from the others, following the original Csp-ii model, thus resulting to a communicating sequential constraint logic programming system. Such a model can facilitate greatly the implementation of distributed CLP applications. Currently Cspcons offers a finite domain constraint solver, but the addition of new solvers is supported as they can be integrated in the system in the form of linkable C libraries. This paper briefly describes the original Csp-ii system along with the extensions that resulted to the Cspcons system.
This work was supported by the Bilateral Cooperation Program Greece-Hungary 2000-2002
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Cabeza and M. Hermenegildo. Distributed Concurrent Constraint Execution in the CIAO System. In Proceedings of the 1995 COMPULOG-NET Workshop on Parallelism and Implementation Technologies, U. Utrecht / T.U. Madrid, September 1995.
Ivan Futo. Prolog with Communicating Processes: From T-Prolog to CSR-Prolog. In D.S. Warren, editor, Proceedings of the 10th International Conference on Logic Programming, pages 3–17. The MIT Press, 1993.
Ivan Futo. A Distributed Network Prolog System. In Proceedings of the 20th International Conference on Information Technology Interfaces, ITI 99, pages 613–618, 1998.
Y. Hamadi, C. Bessière, and J. Quinqueton. Backtracking in Distributed Constraint Networks. In Henri Prade, editor, Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), pages 219–223, Chichester, August 23–28 1998. John Wiley & Sons.
M. Hermenegildo, F. Bueno, D. Cabeza, M. Garcia de la Banda, P. Lopez, and G. Puebla. The CIAO Multi-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems. pages 65–85, April 1999.
M. Hermenegildo, D. Cabeza, and M. Carro. Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems. In Leon Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 631–646, Cambridge, June 13–18 1995. MIT Press.
C. A. R. Hoare. Communicating Sequential Processes. Communications of the ACM, 21(8):666–677, August 1978.
Alan K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99–118, 1977.
T. Nguyen and Y. Deville. A distributed arc-consistency algorithm. Science of Computer Programming, 30(1–2):227–250, January 1998. Concurrent constraint programming (Venice, 1995).
Marius Calin Silaghi, Djamila Sam-Haroud, and Boi Faltings. Asynchronous Search with Aggregations. In Proceedings of the 7th Conference on Artificial Intelligence (AAAI-00) and of the 12th Conference on Innovative Applications of Artificial Intelligence (IAAI-00), pages 917–922, Menlo Park, CA, July 30-3 2000. AAAI Press.
M.C. Silaghi, D. Sam-Haroud, and B.V. Faltings. Maintaining hierachical distributed consistency. In EPFL, editor, Proceedings of the CP2000 Workshop on Distributed Constraint Satisfaction, Tech. Report # 00/338, 2000.
Bo-Ming Tong and Ho-Fung Leung. Data-parallel concurrent constraint programming. The Journal of Logic Programming, 35:103–150, 1998.
I. Vlahavas, N. Bassiliades, I. Sakellariou, M. Molina, S. Ossowski, I. Futo, Z. Pasztor, J. Szeredi, I. Velbitskiy, S. Yershov, S. Golub, and I. Netesin. System Architecture of a Distributed Expert System for the Management of a National Data Network. In Fausto Giunchiglia, editor, Proceedings of the 8th International Conference on Artificial Intelligence: Methodology, Systems, and Applications (AIMSA-98), volume 1480 of LNAI, pages 438–451, Berlin, September 21-23 1998. Springer.
Makoto Yokoo, Edmund H. Durfee, Toru Ishida, and Kazuhiro Kuwabara. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms. IEEE Trans. on Knowledge and Data Engineering, 10(5):673–685, 1998.
Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed ConstraintSatisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185–207, June 2000.
Ying Zhang and Alan K. Mackworth. Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments. Technical Report TR-92-30, Department of Computer Science, University of British Columbia, November 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vlahavas, I.P., Sakellariou, I., Futo, I., Pasztor, Z., Szeredi, J. (2002). Cspcons: A Communicating Sequential Prolog with Constraints. In: Vlahavas, I.P., Spyropoulos, C.D. (eds) Methods and Applications of Artificial Intelligence. SETN 2002. Lecture Notes in Computer Science(), vol 2308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46014-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-46014-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43472-6
Online ISBN: 978-3-540-46014-5
eBook Packages: Springer Book Archive