The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gérard Ferrand: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Pierre Deransart, Gérard Ferrand
    An Operational Formal Definition of PROLOG. [Citation Graph (1, 0)][DBLP]
    SLP, 1987, pp:162-172 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    AADEBUG, 1997, pp:155-169 [Conf]
  3. Gérard Ferrand
    The Notions of Symptom and Error in Declarative Diagnosis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    AADEBUG, 1993, pp:40-57 [Conf]
  4. Gérard Ferrand, Willy Lesaint, Alexandre Tessier
    Value Withdrawal Explanation in CSP. [Citation Graph (0, 0)][DBLP]
    AADEBUG, 2000, pp:- [Conf]
  5. Gérard Ferrand, Alexandre Tessier
    Positive And Negative Diagnosis for Constraint Logic Programs in Terms of Proof Skeletons. [Citation Graph (0, 0)][DBLP]
    AADEBUG, 1997, pp:141-153 [Conf]
  6. Alexandre Tessier, Gérard Ferrand
    Declarative Diagnosis in the CLP Scheme. [Citation Graph (0, 0)][DBLP]
    Analysis and Visualization Tools for Constraint Programming, 2000, pp:151-174 [Conf]
  7. Romuald Debruyne, Gérard Ferrand, Narendra Jussien, Willy Lesaint, Samir Ouis, Alexandre Tessier
    Correctness of Constraint Retraction Algorithms. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2003, pp:172-176 [Conf]
  8. Gérard Ferrand
    Basic Concepts of Logic Programming and Prolog. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:942- [Conf]
  9. Gérard Ferrand, Pierre Deransart
    Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1992, pp:161-174 [Conf]
  10. Gérard Ferrand, Arnaud Lallouet
    A Logic Program Characterization of Domain Reduction Approximations in Finite Domain CSPs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:478-479 [Conf]
  11. Julien Arsouze, Gérard Ferrand, Arnaud Lallouet
    Une sémantique co-inductive pour la propagation de contraintes et de labeling. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2000, pp:17-32 [Conf]
  12. Julien Arsouze, Gérard Ferrand, Arnaud Lallouet
    Arbre d'itérations chaotiques pour décrire la résolution des CSP. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2002, pp:289-0 [Conf]
  13. M. Bergère, Gérard Ferrand
    Une sémantique pour la notion déclarative d'erreur des programmes logiques avec négation. [Citation Graph (0, 0)][DBLP]
    SPLT, 1990, pp:263-292 [Conf]
  14. M. Bergère, Gérard Ferrand, Jean-Hugues Réty
    Indépendance de la règle de calcul pour la résolution SLD avec retard. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1994, pp:31-46 [Conf]
  15. Pierre Deransart, Gérard Ferrand
    Détection d'erreurs en programmation en logique. [Citation Graph (0, 0)][DBLP]
    SPLT, 1985, pp:- [Conf]
  16. Pierre Deransart, Gérard Ferrand
    Programmation en logique: méthodologie et enseignement. [Citation Graph (0, 0)][DBLP]
    SPLT, 1986, pp:75-90 [Conf]
  17. Pierre Deransart, Gérard Ferrand
    Une vue méthodologique de la Programmation en Logique avec négation. [Citation Graph (0, 0)][DBLP]
    SPLT, 1989, pp:403-0 [Conf]
  18. Pierre Deransart, Gérard Ferrand, Michel Téguia
    Test d'occurence en PROLOG et grammaires attribuées. [Citation Graph (0, 0)][DBLP]
    SPLT, 1989, pp:113-142 [Conf]
  19. Gérard Ferrand, Alexandre Tessier
    Correction et complétude des sémantiques PLC revisitée par (co)-induction. [Citation Graph (0, 0)][DBLP]
    JFPLC, 1998, pp:19-0 [Conf]
  20. Gérard Ferrand
    Une reconstruction de la programmation en logique avec négation. [Citation Graph (0, 0)][DBLP]
    SPLT, 1987, pp:7-28 [Conf]
  21. Gérard Ferrand, Arnaud Lallouet
    Une représentation déclarative des consistances de CSPs. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2004, pp:- [Conf]
  22. Gérard Ferrand, Willy Lesaint, Alexandre Tessier
    Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis. [Citation Graph (0, 0)][DBLP]
    JFPLC, 2004, pp:- [Conf]
  23. M. Bergère, Gérard Ferrand
    A Semantics for Error Declarative Notion of Logic Programs with Negation. [Citation Graph (0, 0)][DBLP]
    LPE, 1990, pp:57-62 [Conf]
  24. Pierre Deransart, Gérard Ferrand, Michel Téguia
    NSTO Programs (Not Subject to Occur-Check). [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:533-547 [Conf]
  25. Gérard Ferrand, Arnaud Lallouet
    A Compositional Proof Method of Partial Correctness for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:209-223 [Conf]
  26. Bernard Malfon, Gérard Ferrand
    Type Correct programs: A semantic approach. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:576-590 [Conf]
  27. Gérard Ferrand, Willy Lesaint, Alexandre Tessier
    Explanations and Proof Trees. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2006, v:25, n:2-3, pp:- [Journal]
  28. Gérard Ferrand, Willy Lesaint, Alexandre Tessier
    Towards declarative diagnosis of constraint programs over finite domains [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  29. Gérard Ferrand, Willy Lesaint, Alexandre Tessier
    Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:76, n:, pp:- [Journal]
  30. Gérard Ferrand
    Error Diagnosis in Logic Programming, an Adaption of E. Y. Shapiro's Method. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1987, v:4, n:3, pp:177-198 [Journal]
  31. Gérard Ferrand, Pierre Deransart
    Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1993, v:17, n:2/3&4, pp:265-278 [Journal]
  32. Pierre Deransart, Gérard Ferrand
    An Operational Formal Definition of PROLOG: A Specification Method and Its Application. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1992, v:10, n:2, pp:121-172 [Journal]
  33. Gérard Ferrand, Willy Lesaint, Alexandre Tessier
    Explanations and Proof Trees. [Citation Graph (0, 0)][DBLP]
    ExaCt, 2005, pp:76-85 [Conf]
  34. 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) [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  35. Observational semantics of the Prolog Resolution Box Model [Citation Graph (, )][DBLP]


Search in 0.049secs, Finished in 0.050secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002