Results

**1 - 3**of**3**### ESPRIT Basic Research project Acclaim - Final Report

, 1996

"... Interpretation Frameworks Partner Responsible. INRIA The work in this task was intented to propose an abstract interpretation framework for the family of Concurrent Constraint (cc) languages proposed by Saraswat. Our framework is based on a denotational semantics of concurrent constraint languages, ..."

Abstract
- Add to MetaCart

Interpretation Frameworks Partner Responsible. INRIA The work in this task was intented to propose an abstract interpretation framework for the family of Concurrent Constraint (cc) languages proposed by Saraswat. Our framework is based on a denotational semantics of concurrent constraint languages, where each agent is seen as a closure operator over the lattice defined by the ACCLAIM Final Report 33 constraint system. In this framework the closure operators are defined directly as functions over stores instead of defining them via the set of their fixpoints. This will make it possible to derive a practical algorithm reusing and only slightly modifying a reexecution-based framework for Prolog. Deliverables due 2Q93. D3.1/1 D3.1/1 A report describing a framework for the abstract interpretation of cc languages. This deliverable will provide the basis for several applications to program analysis and optimisation. (INRIA, public report). Deliverables due 2Q95. None An extra deliverable o...

### ACCLAIM - Periodic Progress Report of RISC

, 1995

"... Machine (WAM) for this implementation are presented. Further Use. Attachments 1 -- 5 describe algorithms and methods for constraint solving. The Attachment 6 describes a prototype application (a CLP system). Some of the algorithms in attachments 1 -- 5 are used in the implementation of the prototy ..."

Abstract
- Add to MetaCart

(Show Context)
Machine (WAM) for this implementation are presented. Further Use. Attachments 1 -- 5 describe algorithms and methods for constraint solving. The Attachment 6 describes a prototype application (a CLP system). Some of the algorithms in attachments 1 -- 5 are used in the implementation of the prototype system. It is planned to use all the algorithms in a final version of the system described in the Attachment 6. Further work is required for integrating these methods into professional CLP systems such as PROLOG IV, Oz, AKL developed by other partners of ACCLAIM. Impact. Currently the main impacts of these deliverable are ffl publication, the dissemination of scientific ideas to public (Attachments 5 and 6); ffl implementation, gaining insight into the runtime behavior and realworld applicability of the new methods. D2.9/4: An incremental non-linear constraint solver for complexes Partner Responsible. RISC Other Partners. UML, SICS Attachment 1. Title. RISC-CLP(Tree(\Delta)) Autho...

### Determining the Relationship among Sets

, 1996

"... Doing entailment/disentailment checks on sets is an important operation in constraint programming. This problem is generalized to the problem of answering queries about arbitrary sets using a certain query language. Furthermore an efficient algorithm for solving this problem for sets described by ar ..."

Abstract
- Add to MetaCart

Doing entailment/disentailment checks on sets is an important operation in constraint programming. This problem is generalized to the problem of answering queries about arbitrary sets using a certain query language. Furthermore an efficient algorithm for solving this problem for sets described by arbitrary non-linear polynomials is presented. 1 Introduction One often wants to know how given sets relate to each other. For example one might ask: Is the set S 1 a subset of S 2 ? Are the sets S 1 and S 2 disjoint? In this paper we will devise algorithms for answering such queries where the sets are described by polynomial inequalities over the real numbers. In fact, most of the algorithms can be easily generalized to sets described in other ways. However we will not do this here, because it would needlessly complicate the presentation. An important application of this problem arises in constraint logic programming ([6],[7], [8], [2]), where consistency and redundancy (entailment/disentail...