Observational semantics of the Prolog Resolution Box Model

Autor: Deransart, Pierre, Ducassé, Mireille, Ferrand, Gérard

This paper specifies an observational semantics and gives an original presentation of the Byrd box model. The approach accounts for the semantics of Prolog tracers independently of a particular Prolog implementation. Prolog traces are, in general, co

Externí odkaz: http://arxiv.org/abs/0711.4071

Towards declarative diagnosis of constraint programs over finite domains

Autor: Ferrand, Gerard, Lesaint, Willy, Tessier, Alexandre

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 d

Externí odkaz: http://arxiv.org/abs/cs/0309032

Étude de l'hémagglutination passive inverse appliquée à la recherche de l'antigène HBs (antigène Australia)...

Autor: Ferrand, Gérard

Thèse--Méd.--Lyon 1, 1975. N°: N° 345.
Bibliogr. ff. 97-112.

Externí odkaz: http://catalogue.bnf.fr/ark:/12148/cb358935263

Explanations and Proof Trees

Autor: Ferrand, Gérard, Lesaint, Willy, Tessier, Alexandre

Publikováno v: COMPUTING AND INFORMATICS; Vol 25, No 2-3 (2006): Computing and Informatics; 105-122
International Symposium on Explanation-Aware Computing, ExaCt 2005
International Symposium on Explanation-Aware Computing, ExaCt 2005, 2005, United States. pp.76-85
Computing and Informatics
Computing and Informatics, Slovak University Press, Bratislava, 2006, 25, pp.105-125

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. The proof trees may be considered a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c4a42a3424164a6e05d1c2ee0ba78e67
http://www.cai.sk/ojs/index.php/cai/article/view/335

Explanations to Understand the Trace of a Finite Domain Constraint Solver

Autor: Ferrand, Gérard, Lesaint, Willy, Tessier, Alexandre

Publikováno v: 14th Workshop on Logic Programming Environments
14th Workshop on Logic Programming Environments, 2004, Saint-Malo, France. pp.19-33

Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU-Prolog, PaLM, CHIP). Because of the large size of traces, even for small toy pr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8c6ab08211620f398f16650c6dc4810d
https://hal.archives-ouvertes.fr/hal-00085550