ACCLAIM Deliverables per work package

• Work Package 1, Foundations and Methodology
• Work Package 2a, Non-numerical Constraints
• Work Package 2b, Numerical Constraints
• Work Package 3, Static Program Analysis and Optimisation
• Work Package 4, Implementation and Architecture

Software deliverables

• Half_Life
• AKL(FD)
• Multisolver($\cal Q$)
• Partial Cylindrical Algebraic Composition
• RISC-CLP(Real)
• RISC-CLP(Tree$(\Delta)$)
• Prototype of a Solver over Intervals
• Solver of Pseudo-Boolean Constraints
• CIAO Compiler -- Analysis Subsystem
• CIAO Compiler -- CLP Transformation Subsystem
• CIAO Compiler -- CC Transformation Subsystem
• Penny (SICS) parallel AKL system
• ParAKL (KUL) parallel AKL system
• CIAO Compiler -- Distributed Execution and Low Level Support Subsystem

Work Package 1, Foundations and Methodology

• Task 1.1: Logic and Algebraic views of CCP
• Task 1.2: Higher-Order Concurrent Constraint Programming
• Task 1.3: True-concurrency semantics for cc programs
• Task 1.4: Atomicity control
• Task 1.5: Unified Calculus

Task 1.1: Logic and Algebraic views of CCP

D1.1/1 - First Report on Views of CC Programs (Pisa)

• CHARM: Concurrency and Hiding in an Abstract Rewriting Machine
  Andrea Corradini, Ugo Montanari, Francesca Rossi
• Constraint Programming
  Francesca Rossi, Vijay Saraswat

D1.1/2 - Report on views of cc programs (Pisa)

• NMCC Programming: A Nonmonotonic Declarative Extension of CC Programming
  Philippe Codognet, Francesca Rossi
• CC Programs with both In- and Non-Determinism: A Concurrent Semantics
  Ugo Montanari, Francesca Rossi, Vijay Saraswat

D1.1/3 - Final report on views of cc programs (Pisa and INRIA)

• NMCC Programming: Constraint Enforcement and Retraction in CC Programming.
  Philippe Codognet and Francesca Rossi

Task 1.2: Higher-Order Concurrent Constraint Programming

D1.2/1 - First Report on Higher-Order CC Languages (PRL)

• Order-Sorted Feature Theory Unification
  Hassan Aït-Kaci, Andreas Podelski, Seth Copen Goldstein

D1.2/2 - Final Report on Higher-Order CC Languages (PRL/MPI and DFKI)

• Operational Semantics of Constraint Logic Programs with Coroutining
  Andreas Podelski and Gert Smolka

Task 1.3: True-concurrency semantics for cc programs

D1.3/1 - First Report on True Concurrency (Pisa)

• Contextual Nets
  Ugo Montanari and Francesca Rossi
• Contextual Occurence Nets and Concurrent Constraint Programming
  Ugo Montanari, Francesca Rossi
• Contextual Nets for Modelling In- and Non-Determinate Concurrent Constraint Programs
  Ugo Montanari, Francesca Rossi

D1.3/2 - Report on true concurrency (Pisa)

• Concurrent Semantics for Concurrent Constraint Programming
  Ugo Montanari, Francesca Rossi
• Graph Processes
  Andrea Corradini, Ugo Montanari, Francesca Rossi

D1.3/3 - Final report on true concurrency (Pisa)

• Graph Processes, 2nd version
  Andrea Corradini, Ugo Montanari, Francesca Rossi

Task 1.4: Atomicity control

D1.4/1 - First report on atomicity (Pisa)

• From Eventual to Atomic and Locally Atomic CC Programs: A Concurrent Semantics
  F. Bueno, M. García de la Banda, M. Hermenegildo, U. Montanari, F. Rossi

D1.4/2 - Final report on atomicity (Pisa)

• Eventual, Atomic, and Locally Atomic CC Programs: A Concurrent Semantics
  F. Bueno, M. Hermenegildo, U. Montanari, F. Rossi

Task 1.5: Unified Calculus

D1.5/1 - Report on Unified Calculus (DFKI)

• A Calculus for Higher-Order Concurrent Constraint Programming
  Gert Smolka
• Object-Oriented Concurrent Constraint Programming in Oz
  Gert Smolka, Martin Henz, Jörg Würtz

D1.5/2 - Report on semantics of unified calculus (DFKI)

• A Foundation for Higher-Order Concurrent Constraint Programming
  Gert Smolka

D1.5/3 - Report on relation of unified calculus to LL (DFKI)

• The Definition of Kernel Oz
  Gert Smolka.

Work Package 2a, Non-numerical Constraints

• Task 2.1: Incremental Constraint Solving
• Task 2.2: Constraint Meta-Solver
• Task 2.3: Abductive CCP and Constraint Maintenance
• Task 2.4: Finite Domain Constraints
• Task 2.5: Perfect relaxation for finite domain constraints
• Task 2.6: Feature Constraints
• Task 2.7: Constraints over Lists

Task 2.1: Incremental Constraint Solving

D2.1/1 - First Report on Reactive Primitives (INRIA)

• A Minimal Extension of the WAM for clp(FD)
  Daniel Diaz, Philippe Codognet
• Defeasible Constraint Solving over Finite Domains
  Philippe Codognet, Daniel Diaz

D2.1/2 - Report on reactive primitives implementation (INRIA)

• Compiling Constraints in clp(FD)
  P. Codognet, D. Diaz
• Local Propagation Methods for Solving Boolean Constraints in Constraint Logic Programming
  P. Codognet, D. Diaz
• NMCC Programming: A Nonmonotonic Declarative Extension of CC Programming
  Philippe Codognet, Francesca Rossi

Task 2.2: Constraint Meta-Solver

D2.2/1 - First report on meta-compilation (PRL)

• The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees
  Andreas Podelski, Peter Van Roy

D2.2/2 - Final report on meta-compilation (MPI)

• Situated Simplification
  Andreas Podelski and Gert Smolka

D2.2/3 - Implementation of meta-compilation scheme (PRL/MPI)

• Half-life (software)
  Richard Meyer, Bruno Dumant, Peter Van Roy
  
  • Half_Life 0.1 more on the compiler at uni-sb
    
  • Half_Life 0.1 tar file at uni-sb, (software)
    

Task 2.3: Abductive CCP and Constraint Maintenance

D2.3/1 - First report on abductive cc (INRIA)

• Abduction in Concurrent Constraint Programming
  P. Codognet, V. Saraswat
• Abduction and Concurrent Logic Languages
  P. Codognet, C. Codognet

D2.3/2 - Final report on abductive cc(FD) (INRIA)

• Abductive CCP and Constraint Maintenance
  P. Codognet

Task 2.4: Finite Domain Constraints

D2.4/1 - Report on cc(FD) Algorithms (SICS)

• Constraint Solving and Entailment Algorithms for cc(FD)
  Björn Carlson, Mats Carlsson

D2.4/2 - Report on cc(FD) implementation (SICS and INRIA)

• AKL(FD) - A Concurrent Language for FD Programming
  Björn Carlson, Seif Haridi, Sverker Janson
• Entailment of Finite Domain Constraints
  Björn Carlson, Mats Carlsson, Daniel Diaz

D2.4/3 - Final report on cc(FD) (SICS)

• Compiling and Executing Finite Domain Constraints
  Björn Carlson

D2.4/4 - Implementation of cc(FD) (SICS)

• AKL(FD) (software)
  Programming Systems Group, SICS.

Task 2.5: Perfect relaxation for finite domain constraints

D2.5/1 - First Report on Perfect Relaxation (Pisa)

• Constraint Satisfaction and Local Consistency in Concurrent Constraint Programming
  Francesca Rossi, Vijay Saraswat

D2.5/2 - Final report on perfect relaxation (Pisa)

• Redundant Hidden Variables in Finite Domain Constraint Problems
  Francesca Rossi
• Constraint Solving over Semirings
  Stefano Bistarelli, Ugo Montanari, Francesca Rossi

D2.5/3 - Final report on perfect relaxation (Pisa)

• Redundant Hidden Variables in Finite Domain Constraint Problems
  Francesca Rossi
• Constraint Solving over Semirings
  Stefano Bistarelli, Ugo Montanari, Francesca Rossi

Task 2.6: Feature Constraints

D2.6/1 - Report on the Tree Constraint System (DFKI)

• Records for Logic Programming
  Gert Smolka, Ralf Treinen
• Feature Constraints with First-Class Features
  Ralf Treinen
• Equational and Membership Constraints for Infinite Trees
  Joachim Nieren, Ralf Treinen, Andreas Podelski
• A Complete and Recursive Feature Theory
  Rolf Backofen, Gert Smolka

D2.6/2 - Report on tree constraint solving algorithms (DFKI)

• Encapsulated Search and Constraint Programming in Oz
  Christian Schulte, Gert Smolka, Jörg Würtz
• Encapsulated Search for Higher-Order Concurrent Constraint Programming
  Christian Schulte, Gert Smolka

• Situated Simplification - Report on tree constraint solving algorithms (DFKI)
  Andreas Podelski and Gert Smolka

Task 2.7: Constraints over Lists

D2.7/1 - Report on List Constraint Solving Algorithms (UML)

• Naive Concatenation in Trees
  Alain Colmerauer

Work Package 2b, Numerical Constraints

• Task 2.8: Linear Constraints
• Task 2.9: Algebraic Constraints
• Task 2.10: Constraints Over Intervals
• Task 2.11: Combining Constraint Domains

Task 2.8: Linear Constraints

D2.8/1 - First Report on Linear Constraint Solving (UML)

• Variable Elimination for Disequations in Generalised Linear Constraint Sets
  J. L. Imbert

D2.8/2 - First Report on Piece-Wise Linear Constraints (SICS)

• Piecewise Linear Constraints and Entailment
  Martin Nilsson

D2.8/3 - Solver for linear constraints (UML)

• Multisolver($\cal Q$) prototype (software)
  ### final version will be delivered at end of project ###
  UML

D2.8/6 - Final Report on Linear Constraint solving (UML)

• Redundancy, Variable Elimination, and Linear Disequations
  Jean-Louis Imbert

Task 2.9: Algebraic Constraints

D2.9/1 - Report on non-linear constraints for reals (RISC)

• Heuristic Search and Pruning in Polynomial Constraint Satisfaction
  Hoon Hong
• Quantifier Elimination for Formulas Constrained by Quadratic Equations
  Hoon Hong
• Computation of Variant Results
  Hoon Hong, Rafael Sendar
• Safe Start Region by Fixed Points and Tightening
  Hoon Hong, Volker Stahl
• Bernstein Form is Inclusion Monotone
  Hoon Hong, Volker Stahl
• Interval Horner Evaluation of Univariate Polynomials Gives Sometimes the Range
  Volker Stahl
• The Overestimation Error of the Centered Form for Univariate Polynomials Can Be Reduced by Half
  Volker Stahl
• Extending RISC-CLP(real) to Handle Symbolic Functions
  Olga Caprotti
• RISC-CLP(CF): Constraint Logic Programming over Functions
  Hoon Hong

D2.9/2 - Solver of non-linear constraints for reals (RISC)

• Partial Cylindrical Algebraic Composition (software)
  Hoon Hong
• RISC-CLP(Real) (software)
  Hoon Hong

D2.9/3 - Report on non-linear constraints for complexes(RISC)

• Satisfiability of constraints: Attachment 1
  • The Quadratic Form Method for Counting Real Zeros
    Hoon Hong and Wolfgang Stöcher
• Approximate solutions of constraints: Attachments 2, 3
  • Interval Methods for Bounding the Range of Univariate Polynomials
    Volker Stahl
  • Interval Methods for Bounding the Range of Multivariate Polynomials
    Volker Stahl
• Exact solutions of constraints: Attachment 4, 5
  • Implementation of an Involutive Method for Computing Gröbner Bases of Zero-dimensional Ideals
    Hoon Hong and Andreas Neubacher
  • On the Search of the Maximum of a Polynomial
    A.Y. Uteshev, T.M. Cherkasov
• CLP applications: Attachment 6
  • RISC-CLP(Tree($\Delta$)) A Constraint Logic Programming System with Parametric Domain
    Hoon Hong and Stefan Ratschan

D2.9/4 - Solver of non-linear constraints for complexes (RISC)

• RISC-CLP(Tree$(\Delta)$) (software)
  Stefan Ratschan, Hoon Hong

D2.9/5 - Report on integrating non-linear solvers (RISC)

D2.9/6 - Integrated solver of non-linear constraints (RISC)

Task 2.10: Constraints Over Intervals

D2.10/1 - Report on Interval Constraint Solving (UML)

• Applying Interval Arithmetic to Real, Integer, and Boolean Constraints
  F. Benhamou, W. Older

D2.10/2 - Solver of interval constraints (UML)

• Prototype of a Solver over Intervals (software)
  Stephane N'Dong
• Technical Documentation on the Interval Solver Prototype
  Stephane N'Dong
• CLP(Intervals) Revisited
  Frederic Benhamou, David McAllester, Pascal Van Hentenryck

Task 2.11: Combining Constraint Domains

D2.11/1 - Report on Pseudo-Boolean Constraints (UML, MPI)

• Solving 0-1 Problems in CLP(B)
  P. Barth, A. Bockmayr
• Boolean Pseudo-Equations in CLP
  F. Benhamou, J. L. Massat

D2.11/2 - Solver of pseudo-boolean constraints (MPI)

• Cutting Planes in Constraint Logic Programming
  Alexander Bockmayr
• Linear 0-1 Inequalities and Extended Clauses
  Peter Barth
• Solver of Pseudo-Boolean Constraints (software) (latest version)

D2.11/3 - Report on global mathematical structure (UML and MPI)

• Combining Constraint Domains
  Alain Colmerauer, UML.
  two extra reports provided by MPI
  • Finite Domain and Cutting Plane Techniques in CLP(PB), bib-entry
    P. Barth, A. Bockmayr
  • Solving Pseudo-Boolean Constraints, bib-entry
    A. Bockmayr

Work Package 3, Static Program Analysis and Optimisation

• Task 3.1: Abstract Interpretation Frameworks
• Task 3.2: Program Analysis Algorithms
• Task 3.3: Partial Evaluation and Program Transformation

Task 3.1: Abstract Interpretation Frameworks

D3.1/1 - Report on Abstract Interpretation Framework (INRIA)

• Abstract Interpretation Frameworks for Concurrent Constraint Languages
  Christian Codognet, Philippe Codognet

D3.1/2 - Report on Abstract Interpretation Framework (INRIA)

extra deliverable:
• Guarded Constructive Disjunction : Angel or Demon ?
  Philippe Codognet, Christian Codognet

Task 3.2: Program Analysis Algorithms

D3.2/1 - Report on Analysis Requirements (UPM)

• Compile-time Optimizations and Analysis Requrements for CC Programs
  F. Bueno, M. J. García de la Banda, M. Hermenegildo
• Analyzing Logic Programs with Dynamic Scheduling
  K. Marriott, M. J. García de la Banda, M. Hermenegildo

D3.2/3 - report on implementation of analyzer (UPM)

• Efficient Analysis of Constraint Logic Programs with Dynamic Scheduling
  M. García de la Banda, K. Marriott, and Peter Stuckey
• Analysis of Concurrent Constraint Logic Programs with a Fixed Scheduling Rule
  F. Bueno and M. Hermenegildo
• Independence, Global Analysis, and Parallelism in Dynamically Scheduled Constraint Logic Programming (Abstract)
  M. García de la Banda
• The CIAO Multi-paradigm Compiler: A User's Manual
  F. Bueno
• CIAO Compiler -- Analysis Subsystem UPM, (software)
  Final version can be found at the UPM CLIP repository.

Task 3.3: Partial Evaluation and Program Transformation

D3.3/1 - Report on Translation Techniques (UPM)

• Towards True Concurrency Semantics Based Program Transformation between CLP and CC
  F. Bueno, M. J. García de la Banda, M. Hermenegildo, F. Rossi, U. Montanari
• Independence in Constraint Logic Programs
  M. J. García de la Banda, M. Hermenegildo, K. Marriott

D3.2/2 and D3.3/2 - First report on analysis and transformation of CC languages(UPM)

• Concurrent Semantics-Based Optimisations of CC and CLP
  F. Bueno, F. Rossi, M. Hermenegildo
• Concurrent Semantics Based Optimizations of CC and CLP
  F. Bueno, F. Rossi
• Search Space Preservation in CLP Languages
  M. García de la Banda, M. Hermenegildo, K. Marriott
• Independence and Search Space Preservation in Dynamically Scheduled Languages
  M. García de la Banda, M. Hermenegildo, K. Marriott

D3.3/3 - Final report on Translation Tool (UPM)

• Automatic Compile-Time Parallelization of CLP Programs by Analysis and Transformation to a Concurrent Constraint Language
  F. Bueno, M. García de la Banda, and M. Hermenegildo
• An Automatic Translation Scheme from CLP to AKL
  F. Bueno and M. Hermenegildo
• Automatic Optimisation and Parallelisation of Logic Programs through Program Transformation (Abstract)
  F. Bueno
• CIAO Compiler -- CLP Transformation Subsystem UPM, (software) Final version can be found at the UPM CLIP repository.

D3.3/4 - Final report on CC transformation and specialization (UPM)

• Transformation-based Implementation and Optimization of Programs Exploiting the Basic Andorra Model
  F. Bueno, S. K. Debray, M. García de la Banda, and M. Hermenegildo
• Specialization and Optimization of Constraint Programs with Dynamic Scheduling
  G. Puebla and M. Hermenegildo
• CIAO Compiler -- CC Transformation Subsystem UPM, (software)
  Final version can be found at the UPM CLIP repository.

Work Package 4, Implementation and Architecture

• Task 4.1: Parallel Abstract Machines
• Task 4.2: Scheduling
• Task 4.3: Compilation Techniques

Task 4.1: Parallel Abstract Machines

D4.1/1 - First Report on Parallel AKL (SICS and KUL)

• A Parallel Implementation for AKL
  Remco Moolenaar, Bart Demoen
• A Constraint Store Scheme for a Parallel Implementation of AKL
  Johan Montelius, Khayri A. M. Ali

D4.1/2 - Report on design of parallel AKL (SICS and KUL)

• An And/Or-Parallel Implementation of AKL
  Johan Montelius, Khayri A. M. Ali
• A Parallel Copying Garbage Collection Scheme for Shared-Memory Multiprocessors
  Khayri A. M. Ali
• Full Parallel Search in AKL
  Remco Moolenaar, Bart Demoen

D4.1/3 - Report on parallel implementation of AKL (SICS and KUL)

• The Penny Abstract Machine, an overview
  Johan Montelius and Haruyasu Ueda
• A parallel garbage collector for a CCP language
  Galal Atlam and Johan Montelius
• A Parallel Real-time Garbage Collection Scheme for Shared-memory Multiprocessors
  Khayri Ali
• ParAKL: The parallel AKL implementation
  Remco Moolenaar, KUL

D4.1/4 - Parallel implementation of AKL (SICS and KUL)

• Penny (SICS, Public software) SOFTWARE
  Info about Penny, a parallel implementation of AKL
  Johan Montelius, Haruyasu Ueda, Galal Atlam

ParAKL, KUL, (software)
### final version will be delivered at the end of the project ###
ParAKL at KUL, a parallel implementation of AKL
Remco Molenaar

---

Task 4.2: Scheduling

---

D4.2/1 - Report on scheduling strategies for AKL

This deliverable is also provided in attachments 1 and 3 of D4.1/3.

---

Task 4.3: Compilation Techniques

---

D4.3/1 - First report on compilation techniques for AKL (SICS and UPM)

• A Decision Graph Algorithm for CCP Languages
  Per Brand
• On the Uses of Attributed Variables in Parallel and Concurrent Logic Programming Systems
  M. Hermenegildo, D. Cabeza, M. Carro
• QE-Andorra: A Quiche-Eating Implementation of the Basic Andorra Model
  F. Bueno, S. Debray, M. García de la Banda, M. Hermenegildo

D4.3/2 - Final report on compilation techniques for AKL (UPM, DFKI and SICS)

• Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming
  M. Hermenegildo, D. Cabeza, and M. Carro
• Distributed Concurrent Constraint Execution in the CIAO System
  D. Cabeza and M. Hermenegildo
• CIAO Compiler -- Distributed Execution and Low Level Support Subsystem, UPM, (software)
  Final version can be found at the UPM CLIP repository.
• A Decision Graph Algorithm for CCP Languages
  Per Brand, SICS
• An Abstract Machine for Oz
  Michael Mehl, Ralf Scheidhauer and Christian Schulte, DFKI
  

(Send comments to thomas.sjoland@sics.se)