#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1985

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gérard Ferrand
- J. Log. Program.
- 1987

- Francisco Bueno, Pierre Deransart, +4 authors Germán Puebla
- AADEBUG
- 1997

- Gérard Ferrand
- AADEBUG
- 1993

- Romuald Debruyne, Gérard Ferrand, Narendra Jussien, Willy Lesaint, Samir Ouis, Alexandre Tessier
- FLAIRS Conference
- 2003

In this paper, we present a general scheme for incremental constraint retraction algorithms that encompasses all existing algorithms. Moreover, we introduce some necessary conditions to ensure the correctness of any new incremental constraint retraction algorithms. This rather theoretical work is based on the notion of explanation for constraint programming… (More)

- Pierre Deransart, Gérard Ferrand, Michel Téguia
- ISLP
- 1991

- Gérard Ferrand, Willy Lesaint, Alexandre Tessier
- ArXiv
- 2003

The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical framework for domain reduction, explanations are proof trees explaining value removals. These proof trees are defined by… (More)

- Gérard Ferrand, Arnaud Lallouet
- ILPS
- 1995

This report presents a new proof method of partial correctness for logic programs with negation based on a proof modularity. We prove in a com-positional way that Fitting's or the well-founded semantics of the program is included in a speciication. We give conditions for an abstract semantics to be compositional and we base our proof method on this… (More)

- Gérard Ferrand, Willy Lesaint, Alexandre Tessier
- ExaCt
- 2005

Introduction This paper proposes a model for explanations in a set theoretical framework using the notions of closure or fixpoint. In this approach, sets of rules associated with monotonic operators allow to define proof trees (Aczel 1977). The proof trees may be considered as a declarative view of the trace of a computation. We claim they are explanations… (More)

- Gérard Ferrand, Willy Lesaint, Alexandre Tessier
- AADEBUG
- 2000

This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, constraint solving amounts to domain reduction. A computation is formalized by a chaotic iteration. The computed result is described as a closure. This model is well suited to the… (More)

- Gérard Ferrand
- ICLP
- 1991