Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGérard Ferrand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[i3]Pierre Deransart, Mireille Ducassé, Gérard Ferrand:
Une sémantique observationnelle du modèle des boîtes pour la résolution de programmes logiques (version étendue). CoRR abs/0706.3159 (2007)- [i2]Pierre Deransart, Mireille Ducassé, Gérard Ferrand:
Observational semantics of the Prolog Resolution Box Model. CoRR abs/0711.4071 (2007) - 2006
- [j4]Gérard Ferrand, Willy Lesaint, Alexandre Tessier:
Explanations and Proof Trees. Comput. Artif. Intell. 25(2-3): 105-122 (2006) - 2005
- [c30]Gérard Ferrand, Willy Lesaint, Alexandre Tessier:
Explanations and Proof Trees. ExaCt 2005: 76-85 - 2004
- [c29]Gérard Ferrand, Arnaud Lallouet:
Une représentation déclarative des consistances de CSPs. JFPLC 2004 - [c28]Gérard Ferrand, Willy Lesaint, Alexandre Tessier:
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis. JFPLC 2004 - [c27]Gérard Ferrand, Willy Lesaint, Alexandre Tessier:
Explanations to Understand the Trace of a Finite Domain Constraint Solver. WLPE 2004 - 2003
- [c26]Romuald Debruyne, Gérard Ferrand, Narendra Jussien, Willy Lesaint, Samir Ouis, Alexandre Tessier:
Correctness of Constraint Retraction Algorithms. FLAIRS 2003: 172-176 - [i1]Gérard Ferrand, Willy Lesaint, Alexandre Tessier:
Towards declarative diagnosis of constraint programs over finite domains. CoRR cs.SE/0309032 (2003) - 2002
- [c25]Gérard Ferrand, Arnaud Lallouet:
A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs. ICLP 2002: 478-479 - [c24]Julien Arsouze, Gérard Ferrand, Arnaud Lallouet:
Arbre d'itérations chaotiques pour décrire la résolution des CSP. JFPLC 2002: 289- - [c23]Gérard Ferrand, Willy Lesaint, Alexandre Tessier:
Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction. WFLP 2002: 99-114 - 2000
- [c22]Gérard Ferrand, Willy Lesaint, Alexandre Tessier:
Value Withdrawal Explanation in CSP. AADEBUG 2000 - [c21]Alexandre Tessier, Gérard Ferrand:
Declarative Diagnosis in the CLP Scheme. Analysis and Visualization Tools for Constraint Programming 2000: 151-174 - [c20]Julien Arsouze, Gérard Ferrand, Arnaud Lallouet:
Une sémantique co-inductive pour la propagation de contraintes et de labeling. JFPLC 2000: 17-32
1990 – 1999
- 1998
- [c19]Gérard Ferrand, Alexandre Tessier:
Correction et complétude des sémantiques PLC revisitée par (co)-induction. JFPLC 1998: 19- - 1997
- [c18]Gérard Ferrand, Alexandre Tessier:
Positive And Negative Diagnosis for Constraint Logic Programs in Terms of Proof Skeletons. AADEBUG 1997: 141-153 - [c17]Francisco Bueno, Pierre Deransart, Wlodzimierz Drabent, Gérard Ferrand, Manuel V. Hermenegildo, Jan Maluszynski, Germán Puebla:
On the Role of Semantic Approximations on Validation and Diagnosis of Contraint Logic Programs. AADEBUG 1997: 155-169 - 1995
- [c16]Gérard Ferrand, Arnaud Lallouet:
A Compositional Proof Method of Partial Correctness for Normal Logic Programs. ILPS 1995: 209-223 - [c15]Bernard Malfon, Gérard Ferrand:
Type Correct programs: A semantic approach. ILPS 1995: 576-590 - 1994
- [c14]Michel Bergère, Gérard Ferrand, Jean-Hugues Réty:
Indipendence of the Computation Rule for SLD-derivation with delay. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994 - [c13]Michel Bergère, Gérard Ferrand, Jean-Hugues Réty:
Indépendance de la règle de calcul pour la résolution SLD avec retard. JFPLC 1994: 31-46 - 1993
- [j3]Gérard Ferrand, Pierre Deransart:
Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. J. Log. Program. 17(2/3&4): 265-278 (1993) - [c12]Gérard Ferrand:
The Notions of Symptom and Error in Declarative Diagnosis of Logic Programs. AADEBUG 1993: 40-57 - 1992
- [j2]Pierre Deransart, Gérard Ferrand:
An Operational Formal Definition of PROLOG: A Specification Method and Its Application. New Gener. Comput. 10(2): 121-172 (1992) - [c11]Gérard Ferrand, Pierre Deransart:
Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. JICSLP 1992: 161-174 - 1991
- [c10]Gérard Ferrand:
Basic Concepts of Logic Programming and Prolog. ICLP 1991: 942 - [c9]Pierre Deransart, Gérard Ferrand, Michel Téguia:
NSTO Programs (Not Subject to Occur-Check). ISLP 1991: 533-547 - [e1]Mireille Ducassé, Gérard Ferrand:
Proceedings of the ICLP 1991 Workshop on Logic Programming Environments, Paris, June 1991. Technical Report, University of Orléans, France, LIFO N 91-6. University of Orléans, France 1991 [contents] - 1990
- [c8]Michel Bergère, Gérard Ferrand:
Une sémantique pour la notion déclarative d'erreur des programmes logiques avec négation. SPLT 1990: 263-292 - [c7]Michel Bergère, Gérard Ferrand:
A Semantics for Error Declarative Notion of Logic Programs with Negation. LPE 1990: 57-62
1980 – 1989
- 1989
- [c6]Pierre Deransart, Gérard Ferrand, Michel Téguia:
Test d'occurence en PROLOG et grammaires attribuées. SPLT 1989: 113-142 - [c5]Pierre Deransart, Gérard Ferrand:
Une vue méthodologique de la Programmation en Logique avec négation. SPLT 1989: 403- - 1987
- [j1]Gérard Ferrand:
Error Diagnosis in Logic Programming, an Adaption of E. Y. Shapiro's Method. J. Log. Program. 4(3): 177-198 (1987) - [c4]Gérard Ferrand:
Une reconstruction de la programmation en logique avec négation. SPLT 1987: 7-28 - [c3]Pierre Deransart, Gérard Ferrand:
An Operational Formal Definition of PROLOG. SLP 1987: 162-172 - 1986
- [c2]Pierre Deransart, Gérard Ferrand:
Programmation en logique: méthodologie et enseignement. SPLT 1986: 75-90 - 1985
- [c1]Pierre Deransart, Gérard Ferrand:
Détection d'erreurs en programmation en logique. SPLT 1985
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2022-12-08 23:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
