#### Filter Results:

- Full text PDF available (65)

#### Publication Year

1987

2017

- This year (2)
- Last 5 years (34)
- Last 10 years (57)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Key Phrases

#### Organism

Learn More

- Philippe Codognet, Daniel Diaz
- J. Log. Program.
- 1996

We present the clp(FD) system: a Constraint Logic Programming language with finite domain constraints. We detail its implementation and present an abstract instruction set for the constraint solver that can be smoothly integrated into the WAM architecture. It is based on the use of a single primitive constraintX in r that embeds the core propagation… (More)

- Daniel Diaz, Philippe Codognet
- ICLP
- 1993

We present an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive constraint X in r which embeds the core propagation mechanism. Complex user constraints such as linear equations or inequations are compiled into X in r expressions which… (More)

- Daniel Diaz, Philippe Codognet
- SAC
- 2000

We describe in this paper the GNU-Prolog system, a free system consisting of a Prolog compiler and a constraint solver on finite domains. GNU-Prolog is based on a low-level mini-assembly platform-independent language that makes it possible for efficient compilation time, and allows to produce small stand alone executable files as the result of the… (More)

- Daniel Diaz, Philippe Codognet
- Journal of Functional and Logic Programming
- 2001

In this paper we describe the design and the implementation of the GNU Prolog system. This system draws on our previous experience of compiling Prolog to C in the wamcc system and of compiling finite domain constraints in the clp(FD) system. The compilation scheme has however been redesigned in order to overcome the drawbacks of compiling to C. In… (More)

- Philippe Codognet, Daniel Diaz
- SAGA
- 2001

We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advantage of the structure of the problem in terms of constraints and variables and can guide the search more precisely than a global cost function to optimize (such as for instance the… (More)

- Philippe Codognet, Daniel Diaz
- Journal of Automated Reasoning
- 1996

We study in this paper the use of consistency techniques and local propagation methods, originally developed for constraints over finite domains, for solving boolean constraints in Constraint Logic Programming (CLP). To this aim, we first present a boolean CLP language clp(B/FD) built upon a CLP language over finite domains clp(FD) which uses a… (More)

- Philippe Codognet, Daniel Diaz
- ICLP
- 1995

We present the wamcc system, a Prolog compiler that translates Prolog to C via the WAM. This approach has some interesting consequences: simplicity, efficiency, portability, extensibility and modularity. Indeed the system does not incorporate complex optimizations but is as efficient as Quintus Prolog 2.5 (based on an emulator written in assembly language)… (More)

- Peter Sawyer, Raúl Mazo, Daniel Diaz, Camille Salinesi, Danny Hughes
- Computer
- 2012

Combining goal-modeling techniques with constraint programming provides the means to identify the variants best suited to the environmental contexts that a self-adaptive software system might encounter at runtime.

- Shawn P Jones, Omid Rahimi, Michael P O'Boyle, Daniel L Diaz, Brenda J Claiborne
- Hippocampus
- 2003

Most granule neurons in the rat dentate gyrus are born over the course of the first 2 postnatal weeks. The resulting heterogeneity has made it difficult to define the relationship between dendritic and axonal maturation and to delineate a time course for the morphological development of the oldest granule neurons. By depositing crystals of the fluorescent… (More)

- Björn Carlson, Mats Carlsson, Daniel Diaz
- ICLP
- 1994

Using a glass-box theory of nite domain constraints, FD, we show how the entailment of user-deened constraints can be expressed by anti-monotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough to allow the deenition of arithmetical constraints, as well as… (More)