Search the dblp DataBase
Jean-Paul Delahaye: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Jean-Paul Delahaye, V. Thibau
Programming in Three-valued Logic. [Citation Graph (1, 0)][DBLP]
Theor. Comput. Sci., 1991, v:78, n:1, pp:189-216 [Journal] - Philippe Mathieu, Bruno Beaufils, Jean-Paul Delahaye
Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies. [Citation Graph (0, 0)][DBLP]
Artificial Evolution, 1999, pp:177-190 [Conf] - Eric Wegrzynowski, Jean-Paul Delahaye
The grand loop semantics for logic programs. [Citation Graph (0, 0)][DBLP]
CNKBS, 1992, pp:12-15 [Conf] - Eric Rivals, Jean-Paul Delahaye, Max Dauchet, Olivier Delgrange
A Guaranteed Compression Scheme for Repetitive DNA Sequences. [Citation Graph (0, 0)][DBLP]
Data Compression Conference, 1996, pp:453- [Conf] - Bruno Beaufils, Jean-Paul Delahaye, Philippe Mathieu
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma. [Citation Graph (0, 0)][DBLP]
Evolutionary Programming, 1998, pp:33-41 [Conf] - Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals
The transformation distance: A dissimilarity measure based an movements of segments. [Citation Graph (0, 0)][DBLP]
German Conference on Bioinformatics, 1998, pp:- [Conf] - Jean-Paul Delahaye, V. Thibau
The Optimal Model of a Program with Negation. [Citation Graph (0, 0)][DBLP]
JELIA, 1990, pp:180-195 [Conf] - Philippe Mathieu, Jean-Paul Delahaye
The Logical Compilation of Knowledge Bases. [Citation Graph (0, 0)][DBLP]
JELIA, 1990, pp:386-398 [Conf] - Jean-Paul Delahaye
Différences entre la sémantique déclarative et la sémantique procédurale d'un programme Prolog avec coupe-choix. [Citation Graph (0, 0)][DBLP]
SPLT, 1987, pp:285-306 [Conf] - Jean-Paul Delahaye
Stratégie générale d'exploration et coupe-choix. [Citation Graph (0, 0)][DBLP]
SPLT, 1988, pp:337-360 [Conf] - Jean-Paul Delahaye, François Denis
Operational semantics of Standard Prolog: an axiomatic approach. [Citation Graph (0, 0)][DBLP]
SPLT, 1990, pp:311-0 [Conf] - Jean-Paul Delahaye, Philippe Mathieu
Logique Partielle et Prolog. [Citation Graph (0, 0)][DBLP]
SPLT, 1989, pp:311-0 [Conf] - Jean-Paul Delahaye, Philippe Mathieu
An achievement by part method to solve the incompleteness of forward chaining. [Citation Graph (0, 0)][DBLP]
JFPL, 1993, pp:155-171 [Conf] - Jean-Paul Delahaye, P. Paradinas
Définitions de stratégies équitables en programmation logique. [Citation Graph (0, 0)][DBLP]
SPLT, 1986, pp:7-14 [Conf] - Jean-Paul Delahaye, V. Thibau
A new model semantics for a program with negation. [Citation Graph (0, 0)][DBLP]
SPLT, 1990, pp:389-404 [Conf] - Eric Wegrzynowski, Jean-Paul Delahaye
The grand loop semantics for logic programs. [Citation Graph (0, 0)][DBLP]
JFPL, 1992, pp:87-106 [Conf] - Philippe Mathieu, Jean-Paul Delahaye
A Kind of Achievement by Parts Method. [Citation Graph (0, 0)][DBLP]
LPAR, 1994, pp:320-332 [Conf] - François Denis, Jean-Paul Delahaye
Unfolding, Procedural and Fixpoint Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
JTASPEFT/WSA, 1991, pp:157-164 [Conf] - François Denis, Jean-Paul Delahaye
Unfolding, Procedural and Fixpoint Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP]
STACS, 1991, pp:511-522 [Conf] - Eric Rivals, Olivier Delgrange, Jean-Paul Delahaye, Max Dauchet, Marie-Odile Delorme, Alain Hénaut, Emmanuelle Ollivier
Detection of significant patterns by compression algorithms: the case of approximate tandem repeats in DNA sequences. [Citation Graph (0, 0)][DBLP]
Computer Applications in the Biosciences, 1997, v:13, n:2, pp:131-136 [Journal] - Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals
Transformation distances: a family of dissimilarity measures based on movements of segments. [Citation Graph (0, 0)][DBLP]
Bioinformatics, 1999, v:15, n:3, pp:194-202 [Journal] - Jean-Paul Delahaye
Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites. [Citation Graph (0, 0)][DBLP]
ITA, 1985, v:19, n:1, pp:3-20 [Journal] - Jean-Paul Delahaye
Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog. [Citation Graph (0, 0)][DBLP]
ITA, 1988, v:22, n:1, pp:3-42 [Journal] - François Denis, Jean-Paul Delahaye
Is there an Axiomatic Semantics for Standard Pure Prolog. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1991, v:82, n:2, pp:373-388 [Journal] - Philippe Mathieu, Jean-Paul Delahaye
A Kind of Logical Compilation for Knowledge Bases. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1994, v:131, n:1, pp:197-218 [Journal] - Eric Rivals, Jean-Paul Delahaye
Optimal Representation in Average Using Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1998, v:200, n:1-2, pp:261-287 [Journal] - Jean-Paul Delahaye, Héctor Zenil
On the Kolmogorov-Chaitin Complexity for short sequences [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Towards a stable definition of Kolmogorov-Chaitin complexity [Citation Graph (, )][DBLP]
On the Algorithmic Nature of the World [Citation Graph (, )][DBLP]
A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry [Citation Graph (, )][DBLP]
Image information content characterization and classification by physical complexity [Citation Graph (, )][DBLP]
An algorithmic information-theoretic approach to the behaviour of financial markets [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002