Linear Concurrent Constraint Programming over Reals

Authors:
Vincent Schächter
Affiliations:
-
Venue:
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Year:
1998

Citing 6
Cited 1

Linear logic

Theoretical Computer Science
The semantic foundations of concurrent constraint programming

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A canonical form for generalized linear constraints

Journal of Symbolic Computation
Confluence and Semantics of Constraint Simplification Rules

Constraints
Independence of Negative Constraints

TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Phase Semantics and Verification of Concurrent Constraint Programs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science

Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

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.