 | 2012 |
|---|
| 38 |       | Hector Zenil,
Jean-Paul Delahaye,
Cédric Gaucherel:
Image characterization and classification by physical complexity.
Complexity 17(3): 26-42 (2012) |
| 2011 |
|---|
| 37 | | Jean-Paul Delahaye,
Hector Zenil:
Numerical Evaluation of Algorithmic Complexity for Short Strings: A Glance into the Innermost Structure of Randomness
CoRR abs/1101.4795: (2011) |
| 36 | | Nicolas Gauvrit,
Hector Zenil,
Jean-Paul Delahaye:
Assessing Cognitive Randomness: A Kolmogorov Complexity Approach
CoRR abs/1106.3059: (2011) |
| 35 | | Hector Zenil,
Jean-Paul Delahaye:
Un metodo estable para la evaluacion de la complejidad algoritmica de cadenas cortas
CoRR abs/1108.5387: (2011) |
| 34 | | Hervé Zwirn,
Jean-Paul Delahaye:
Unpredictability and Computational Irreducibility
CoRR abs/1111.4121: (2011) |
| 2010 |
|---|
| 33 | | Hector Zenil,
Jean-Paul Delahaye,
Cédric Gaucherel:
Image information content characterization and classification by physical complexity
CoRR abs/1006.0051: (2010) |
| 32 | | Hector Zenil,
Jean-Paul Delahaye:
An algorithmic information-theoretic approach to the behaviour of financial markets
CoRR abs/1008.1846: (2010) |
| 2009 |
|---|
| 31 | | Hector Zenil,
Jean-Paul Delahaye:
On the Algorithmic Nature of the World
CoRR abs/0906.3554: (2009) |
| 30 | | Francesco De Comité,
Jean-Paul Delahaye:
A CounterExample to Kahle-Conjecture, New Conjectures and Automated Proofs in Geometry
CoRR abs/0911.4375: (2009) |
| 2008 |
|---|
| 29 | | Jean-Paul Delahaye,
Hector Zenil:
Towards a stable definition of Kolmogorov-Chaitin complexity
CoRR abs/0804.3459: (2008) |
| 2007 |
|---|
| 28 | | Jean-Paul Delahaye,
Héctor Zenil:
On the Kolmogorov-Chaitin Complexity for short sequences
CoRR abs/0704.1043: (2007) |
| 1999 |
|---|
| 27 | | Philippe Mathieu,
Bruno Beaufils,
Jean-Paul Delahaye:
Studies on Dynamics in the Classical Iterated Prisoner's Dilemma with Few Strategies.
Artificial Evolution 1999: 177-190 |
| 26 | | Jean-Stéphane Varré,
Jean-Paul Delahaye,
Eric Rivals:
Transformation distances: a family of dissimilarity measures based on movements of segments.
Bioinformatics 15(3): 194-202 (1999) |
| 1998 |
|---|
| 25 | | Bruno Beaufils,
Jean-Paul Delahaye,
Philippe Mathieu:
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma.
Evolutionary Programming 1998: 33-41 |
| 24 |  | Jean-Stéphane Varré,
Jean-Paul Delahaye,
Eric Rivals:
The transformation distance: A dissimilarity measure based an movements of segments.
German Conference on Bioinformatics 1998 |
| 23 | | Eric Rivals,
Jean-Paul Delahaye:
Optimal Representation in Average Using Kolmogorov Complexity.
Theor. Comput. Sci. 200(1-2): 261-287 (1998) |
| 1997 |
|---|
| 22 | | 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.
Computer Applications in the Biosciences 13(2): 131-136 (1997) |
| 1996 |
|---|
| 21 | | Eric Rivals,
Jean-Paul Delahaye,
Max Dauchet,
Olivier Delgrange:
A Guaranteed Compression Scheme for Repetitive DNA Sequences.
Data Compression Conference 1996: 453 |
| 1994 |
|---|
| 20 | | Philippe Mathieu,
Jean-Paul Delahaye:
A Kind of Achievement by Parts Method.
LPAR 1994: 320-332 |
| 19 | | Philippe Mathieu,
Jean-Paul Delahaye:
A Kind of Logical Compilation for Knowledge Bases.
Theor. Comput. Sci. 131(1): 197-218 (1994) |
| 1993 |
|---|
| 18 | | Jean-Paul Delahaye,
Philippe Mathieu:
An achievement by part method to solve the incompleteness of forward chaining.
JFPL 1993: 155-171 |
| 1992 |
|---|
| 17 | | Jean-Paul Delahaye,
Philippe Devienne,
Philippe Mathieu,
Pascal Yim:
JFPL'92, 1ères Journées Francophones de Programmation Logique, 25-27 Mai 1992, Lille, France
JFPL 1992 |
| 16 | | Eric Wegrzynowski,
Jean-Paul Delahaye:
The grand loop semantics for logic programs.
CNKBS 1992: 12-15 |
| 15 | | Eric Wegrzynowski,
Jean-Paul Delahaye:
The grand loop semantics for logic programs.
JFPL 1992: 87-106 |
| 1991 |
|---|
| 14 | | François Denis,
Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs.
JTASPEFT/WSA 1991: 157-164 |
| 13 | | François Denis,
Jean-Paul Delahaye:
Unfolding, Procedural and Fixpoint Semantics of Logic Programs.
STACS 1991: 511-522 |
| 12 | | Jean-Paul Delahaye,
V. Thibau:
Programming in Three-valued Logic.
Theor. Comput. Sci. 78(1): 189-216 (1991) |
| 11 | | François Denis,
Jean-Paul Delahaye:
Is there an Axiomatic Semantics for Standard Pure Prolog.
Theor. Comput. Sci. 82(2): 373-388 (1991) |
| 1990 |
|---|
| 10 | | Jean-Paul Delahaye,
V. Thibau:
The Optimal Model of a Program with Negation.
JELIA 1990: 180-195 |
| 9 | | Philippe Mathieu,
Jean-Paul Delahaye:
The Logical Compilation of Knowledge Bases.
JELIA 1990: 386-398 |
| 8 | | Jean-Paul Delahaye,
François Denis:
Operational semantics of Standard Prolog: an axiomatic approach.
SPLT 1990: 311- |
| 7 | | Jean-Paul Delahaye,
V. Thibau:
A new model semantics for a program with negation.
SPLT 1990: 389-404 |
| 1989 |
|---|
| 6 | | Jean-Paul Delahaye,
Philippe Mathieu:
Logique Partielle et Prolog.
SPLT 1989: 311- |
| 1988 |
|---|
| 5 | | Jean-Paul Delahaye:
Stratégie générale d'exploration et coupe-choix.
SPLT 1988: 337-360 |
| 4 | | Jean-Paul Delahaye:
Sémantique Logique Et Dénotationnelle Des Interpréteurs Prolog.
ITA 22(1): 3-42 (1988) |
| 1987 |
|---|
| 3 | | Jean-Paul Delahaye:
Différences entre la sémantique déclarative et la sémantique procédurale d'un programme Prolog avec coupe-choix.
SPLT 1987: 285-306 |
| 1986 |
|---|
| 2 | | Jean-Paul Delahaye,
P. Paradinas:
Définitions de stratégies équitables en programmation logique.
SPLT 1986: 7-14 |
| 1985 |
|---|
| 1 | | Jean-Paul Delahaye:
Sur Quelques Limitations des Algorithmes Dans Le Traitement des Suites.
ITA 19(1): 3-20 (1985) |
Data released under the ODC-BY 1.0 license — See also our legal information page