Abstract
We introduce a constraint system LC that handles arithmetic constraints over reals within the linear concurrent constraint programming (lcc) framework. This approach provides us with a general, extensible foundation for linear programming algorithm design that comes with a (linear) logical semantics. In particular, it allows us to build a ’glass-box’ version of the (constraint solver) simplex algorithm by defining (monotone) cc ask and tell agents over a higher-level constraint system as lcc(LC) programs. We illustrate at the same time the use of the lccframework as a non-trivial concurrent algorithm specification tool.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
E. Best, F.S. de Boer, and C. Palamidessi. Concurrent constraint programming with information removal. In Proceedings of Coordination, LNCS. Springer-Verlag, 1997.
P. Borovansky, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. Elan: a logical framework based on computational system. In Proceedings of the First International Workshop on Rewriting Logic, volume Volume 4 of electronic notes in TCS, 1996.
C. Kirchner and C. Ringeissen. Rule-based constraint programming. Preprint, 1998.
F. Fages, P. Ruet, and S. Soliman. Phase semantics and verification of concurrent constraint programs. In LICS, 1998.
J.Y. Girard. Linear logic. Theoretical Computer Science, 50(1), 1987.
P. Van Hentenryck, V.A. Saraswat, and Y. Deville. Constraint processing in cc(FD). Draft, 1991.
J-L. Lassez and K. McAloon. Independance of negative constraints. In Springer, editor, Proceedings of TAPSOFT, LNCS, 1989.
J.L. Lassez and K. McAloon. A canonical form for generalized linear constraints. Journal of Symbolic Computation, 1989.
J.R. Shoenfield. Mathematical Logic. Addison-Wesley, 1967.
K. Fukuda and T. Terlaky. Criss-cross methods: a fresh view on pivot algorithms. Submitted to Elsevier Preprint, 1997.
P. Lincoln and V.A. Saraswat. Proofs as concurrent processes. Draft, 1991.
P. Refalo. Resolution et implication de contraintes lineaires en programmation logique par contraintes. PhD thesis, Universite de la Mediterrannee, 1997.
P. Ruet. Logique non-commutative et programmation concurrente par contraintes. PhD thesis, Université Denis Diderot, Paris 7, 1997.
V.A. Saraswat and P. Lincoln. Higher-order linear concurrent constraint programming. Technical report, Xerox Parc, 1992.
V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constraint programming. In POPL’91: Proceedings 18th ACM Symposium on Principles of Programming Languages, 1991.
T. Fruhwirth, S. Abdennadher, and H. Meuss. Conuence and semantics of constraint handling rules. Constraint Journal (submitted), 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schachter, V. (1998). Linear concurrent constraint programming over reals. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_29
Download citation
DOI: https://doi.org/10.1007/3-540-49481-2_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65224-3
Online ISBN: 978-3-540-49481-2
eBook Packages: Springer Book Archive