Emmanuel Kounalis

33 papers A* 3A 3B 4C 1Misc 1Journal 11Unranked 10
YearRankTypeTitle / Venue / Authors
2005 J jnl
Rewriting of imperative programs into logical equations.
Sci. Comput. Program.
Olivier Ponsini, Carine Fédèle, Emmanuel Kounalis
2004 J jnl
Sound generalizations in mathematical induction.
Theor. Comput. Sci.
Pascal Urso, Emmanuel Kounalis
2003 — conf
"Term Partition" for Mathematical Induction.
RTA
Pascal Urso, Emmanuel Kounalis
2002 — conf
Généralisations correctes pour l'induction mathématique.
JFPLC
Pascal Urso, Emmanuel Kounalis
1999 A* conf
Automatic Proofs of Properties of Simple C
ASE
Carine Fédèle, Emmanuel Kounalis
1999 Misc conf
Generalization Discovery for Proofs by Induction in Conditional Theories.
FLAIRS
Emmanuel Kounalis, Pascal Urso
1999 C conf
Mechanizing Proofs of Integrity Constraints in the Situation Calculus.
IEA/AIE
Emmanuel Kounalis, Pascal Urso
1995 J jnl
Automated Mathematical Induction.
J. Log. Comput.
Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch
1995 J jnl
Reasoning with Conditional Axioms.
Ann. Math. Artif. Intell.
Emmanuel Kounalis, Michaël Rusinowitch
1994 A conf
Mechanizable Inductive Proofs for a Class of Forall Exists Formulas.
CADE
Jacques Chazarain, Emmanuel Kounalis
1993 J jnl
A Logical Framework for Concept Learning with Background Knowledge.
Int. J. Artif. Intell. Tools
Emmanuel Kounalis, Michaël Rusinowitch
1992 A conf
A Simplification-Based Approach to Program Synthesis.
ECAI
Emmanuel Kounalis
1992 J jnl
Learning from Examples in Universe of Discourse Described by a Set of equations.
Int. J. Artif. Intell. Tools
Emmanuel Kounalis
1992 B conf
SPIKE, an Automatic Theorem Prover.
LPAR
Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch
1992 J jnl
Testing for the Ground (Co-)Reducibility Property in Term-Rewriting Systems.
Theor. Comput. Sci.
Emmanuel Kounalis
1991 — conf
A Solution of the Complement Problem in Associative-Commutative Theories.
IWWERT
Emmanuel Kounalis, Denis Lugiez, Loic Pottier
1991 B conf
A Solution of the Complement Problem in Associative-Commutative Theories.
MFCS
Emmanuel Kounalis, Denis Lugiez, Loic Pottier
1991 B conf
Automatic Proof Methods for Algebraic Specifications.
FCT
Emmanuel Kounalis, Michaël Rusinowitch
1991 — conf
Compilation of Pattern Matching with Associative-Commutative Functions.
TAPSOFT, Vol.1
Emmanuel Kounalis, Denis Lugiez
1991 J jnl
On Word Problems in Horn Theories.
J. Symb. Comput.
Emmanuel Kounalis, Michaël Rusinowitch
1991 — conf
Studies on the Ground Convergence Property of Conditional Theories.
AMAST
Emmanuel Kounalis, Michaël Rusinowitch
1990 — conf
A Proof System for Conditional Algebraic Specifications.
CTRS
Emmanuel Kounalis, Michaël Rusinowitch
1990 — conf
Learning from examples and counterexamples with equational background knowledge.
TAI
Emmanuel Kounalis
1990 A* conf
Mechanizing Inductive Reasoning.
AAAI
Emmanuel Kounalis, Michaël Rusinowitch
1990 J jnl
Mechanizing inductive reasoning.
Bull. EATCS
Emmanuel Kounalis, Michaël Rusinowitch
1990 B conf
Pumping Lemmas for Tree Languages Generated by Rewrite Systems.
MFCS
Emmanuel Kounalis
1990 — conf
Testing for Inductive (Co)-Reducibility.
CAAP
Emmanuel Kounalis
1989 J jnl
Automatic Proofs by Induction in Theories without Constructors
Inf. Comput.
Jean-Pierre Jouannaud, Emmanuel Kounalis
1988 A conf
On Word Problems in Horn Theories.
CADE
Emmanuel Kounalis, Michaël Rusinowitch
1987 — conf
On Word Problems in Horn Theories.
CTRS
Emmanuel Kounalis, Michaël Rusinowitch
1986 A* conf
Automatic Proofs by Induction in Equational Theories Without Constructors
LICS
Jean-Pierre Jouannaud, Emmanuel Kounalis
1985 — conf
Completeness in Data Type Specifications.
European Conference on Computer Algebra (2)
Emmanuel Kounalis
1985 J jnl
Proofs by induction in equational theories without constructors.
Bull. EATCS
Jean-Pierre Jouannaud, Emmanuel Kounalis