zinc is the first modelling language which supports solver and technique independence. this means that a high level conceptual model can be automatically mapped into an appropriate low level design model for a specific solver or technique. to date, zinc uses three different techniques to solve a model: constraint programming (cp), local search (ls), and mixed integer programming (mip). in this ...

FLOPC++ is an open source algebraic modeling language implemented as a C++ class library. It allows linear optimization problems to be modeled in a declarative style, similar to algebraic modeling languages, such as GAMS and AMPL, within a C++ program. The project is part of COmputational INfrastructure for Operations Research (COIN-OR) and uses its Open Solver Interface (OSI) to achieve solver...

The Constraint Logic Programming (CLP) Scheme was introduced by Jaaar and Lassez. The scheme gave a formal framework, based on constraints , for the basic operational, logical and algebraic semantics of an extended class of logic programs. This paper presents for the rst time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, w...

Developing accurate solvers for the Poisson Boltzmann (PB) model is the first step to make the PB model suitable for implicit solvent simulation. Reducing the grid size influence on the performance of the solver benefits to increasing the speed of solver and providing accurate electrostatics analysis for solvated molecules. In this work, we explore the accurate coarse grid PB solver based on th...

The Constraint Logic Programming (CLP) Scheme was introduced by Ja€ar and Lassez. The scheme gave a formal framework, based on constraints, for the basic operational, logical and algebraic semantics of an extended class of logic programs. This paper presents for the ®rst time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, w...

Studying independence of literals, variables, and substitutions has proven very useful in the context of logic programming (LP). Here we study independence in the broader context of constraint logic programming (CLP). We show that a naive extrapolation of the LP definitions of independence to CLP is unsatisfactory (in fact, wrong) for two reasons. First, because interaction between variables th...

This article deals with the computation of guaranteed lower bounds of the error in the framework of finite element (FE) and domain decomposition (DD) methods. In addition to a fully parallel computation, the proposed lower bounds separate the algebraic error (due to the use of a DD iterative solver) from the discretization error (due to the FE), which enables the steering of the iterative solve...

In this study, we started to investigate how the Partitioned Global Address Space (PGAS) programming language X10 would suit the implementation of a Constraint-Based Local Search solver. We wanted to code in this language because we expect to gain from its ease of use and independence from specific parallel architectures. We present our implementation strategy, and quest for different sources o...

Interpretation with Unfoldings⋆ Marcelo Sousa, César Rodŕıguez, Vijay D’Silva and Daniel Kroening 1 University of Oxford, United Kingdom 2 Université Paris 13, Sorbonne Paris Cité, LIPN, CNRS, France 3 Google Inc., San Francisco Abstract. We present and evaluate a technique for computing pathsensitive interference conditions during abstract interpretation of concurrent programs. In lieu of fixe...

Modeling constraint problems is a very important issue and a good model formulation is essential for finding a solution in an efficient way. However, modeling becomes difficult if the formulation process involves dealing with lowlevel issues in order to interface with the constraint solver. The idea behind this thesis is to design a simple but expressive modeling language to formulate Constrain...