ACCLAIM Deliverables per partner

• Max-Planck-Institut, Saarbrücken and DEC Paris Lab
• INRIA
• DFKI
• SICS
• RISC
• Universidad Politécnica de Madrid (UPM)
• Università di Pisa
• Marseille Luminy
• Katholieke universiteit Leuven

Max-Planck-Institut, Saarbrücken and DEC Paris Lab

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

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

• The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees
  Andreas Podelski, Peter Van Roy
• Situated Simplification
  Andreas Podelski and Gert Smolka
• 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
    

• Solving 0-1 Problems in CLP(B)
  P. Barth, A. Bockmayr
• Cutting Planes in Constraint Logic Programming
  Alexander Bockmayr
• Linear 0-1 Inequalities and Extended Clauses
  Peter Barth
• Solver of Pseudo-Boolean Constraints (latest version) SOFTWARE
• Finite Domain and Cutting Plane Techniques in CLP(PB), bib-entry
  P. Barth, A. Bockmayr
• Solving Pseudo-Boolean Constraints, bib-entry
  A. Bockmayr

INRIA

• NMCC Programming: A Nonmonotonic Declarative Extension of CC Programming
  Philippe Codognet, Francesca Rossi
• NMCC Programming: Constraint Enforcement and Retraction in CC Programming.
  Philippe Codognet and Francesca Rossi

• A Minimal Extension of the WAM for clp(FD)
  Daniel Diaz, Philippe Codognet
• Defeasible Constraint Solving over Finite Domains
  Philippe Codognet, Daniel Diaz
• Compiling Constraints in clp(FD)
  P. Codognet, D. Diaz
• Local Propagation Methods for Solving Boolean Constraints in Constraint Logic Programming
  P. Codognet, D. Diaz

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

• Entailment of Finite Domain Constraints
  Björn Carlson, Mats Carlsson, Daniel Diaz

• Abstract Interpretation Frameworks for Concurrent Constraint Languages
  Christian Codognet, Philippe Codognet
• Guarded Constructive Disjunction : Angel or Demon ?
  Philippe Codognet, Christian Codognet

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
• A Foundation for Higher-Order Concurrent Constraint Programming
  Gert Smolka
• The Definition of Kernel Oz
  Gert Smolka.

• 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
• 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

• An Abstract Machine for Oz
  Michael Mehl, Ralf Scheidhauer and Christian Schulte, DFKI
  

SICS

• Constraint Solving and Entailment Algorithms for cc(FD)
  Björn Carlson, Mats Carlsson
• 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
• Compiling and Executing Finite Domain Constraints
  Björn Carlson
• AKL(FD) SOFTWARE
  Programming Systems Group, SICS.

• Piecewise Linear Constraints and Entailment
  Martin Nilsson

• A Constraint Store Scheme for a Parallel Implementation of AKL
  Johan Montelius, Khayri A. M. Ali
• 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
• 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
• Penny (SICS, Public software) SOFTWARE
  Info about Penny, a parallel implementation of AKL
  Johan Montelius, Haruyasu Ueda, Galal Atlam

• A Decision Graph Algorithm for CCP Languages
  Per Brand
• A Decision Graph Algorithm for CCP Languages, 2nd version
  Per Brand, SICS

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
• Partial Cylindrical Algebraic Composition SOFTWARE
  Hoon Hong
• RISC-CLP(Real) SOFTWARE
  Hoon Hong
• The Quadratic Form Method for Counting Real Zeros
  Hoon Hong and Wolfgang Stöcher
• Interval Methods for Bounding the Range of Univariate Polynomials
  Volker Stahl
• Interval Methods for Bounding the Range of Multivariate Polynomials
  Volker Stahl
• 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
• RISC-CLP(Tree($\Delta$)) A Constraint Logic Programming System with Parametric Domain
  Hoon Hong and Stefan Ratschan
• RISC-CLP(Tree$(\Delta)$) SOFTWARE
  Stefan Ratschan, Hoon Hong

Universidad Politécnica de Madrid (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
• 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 SOFTWARE
  Final version can be found at the UPM CLIP repository.

• 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

• 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

• 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 SOFTWARE
  Final version can be found at the UPM CLIP repository.
• 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 SOFTWARE
  Final version can be found at the UPM CLIP repository.

• 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
• 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, SOFTWARE
  Final version can be found at the UPM CLIP repository.

Università di Pisa

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

• 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
• NMCC Programming: Constraint Enforcement and Retraction in CC Programming.
  Philippe Codognet and Francesca Rossi

• 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

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

• 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
• Eventual, Atomic, and Locally Atomic CC Programs: A Concurrent Semantics
  F. Bueno, M. Hermenegildo, U. Montanari, F. Rossi

• Constraint Satisfaction and Local Consistency in Concurrent Constraint Programming
  Francesca Rossi, Vijay Saraswat
• Redundant Hidden Variables in Finite Domain Constraint Problems
  Francesca Rossi
• Constraint Solving over Semirings
  Stefano Bistarelli, Ugo Montanari, Francesca Rossi
• Redundant Hidden Variables in Finite Domain Constraint Problems
  Francesca Rossi
• Constraint Solving over Semirings
  Stefano Bistarelli, Ugo Montanari, Francesca Rossi

Marseille Luminy

• Naive Concatenation in Trees
  Alain Colmerauer

• Variable Elimination for Disequations in Generalised Linear Constraint Sets
  J. L. Imbert
• Multisolver($\cal Q$) prototype SOFTWARE
  ### final version will be delivered at end of project ###
• Redundancy, Variable Elimination, and Linear Disequations
  Jean-Louis Imbert

• Applying Interval Arithmetic to Real, Integer, and Boolean Constraints
  F. Benhamou, W. Older
• 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

• Boolean Pseudo-Equations in CLP
  F. Benhamou, J. L. Massat
• Combining Constraint Domains
  Alain Colmerauer, UML.

Katholieke Universiteit Leuven

• A Parallel Implementation for AKL
  Remco Moolenaar, Bart Demoen
• Full Parallel Search in AKL
  Remco Moolenaar, Bart Demoen
• ParAKL: The parallel AKL implementation
  Remco Moolenaar, KUL
• ParAKL SOFTWARE
  ### final version will be delivered at the end of the project ###
  ParAKL at KUL, a parallel implementation of AKL
  Remco Molenaar