Emmanuel Kounalis

According to our database1, Emmanuel Kounalis authored at least 29 papers between 1985 and 2005.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Rewriting of imperative programs into logical equations.
Sci. Comput. Program., 2005

2004
Sound generalizations in mathematical induction.
Theor. Comput. Sci., 2004

2003
"Term Partition" for Mathematical Induction.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

2002
Généralisations correctes pour l'induction mathématique.
Proceedings of the Programmation en logique avec contraintes, 2002

1999
Automatic Proofs of Properties of Simple C<sup>-</sup> Modules.
Proceedings of the 14th IEEE International Conference on Automated Software Engineering, 1999

Mechanizing Proofs of Integrity Constraints in the Situation Calculus.
Proceedings of the Multiple Approaches to Intelligent Systems, 1999

Generalization Discovery for Proofs by Induction in Conditional Theories.
Proceedings of the Twelfth International Florida Artificial Intelligence Research Society Conference, 1999

1995
Automated Mathematical Induction.
J. Log. Comput., 1995

Reasoning with Conditional Axioms.
Ann. Math. Artif. Intell., 1995

1994
Mechanizable Inductive Proofs for a Class of Forall Exists Formulas.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993
A Logical Framework for Concept Learning with Background Knowledge.
Int. J. Artif. Intell. Tools, 1993

1992
Testing for the Ground (Co-)Reducibility Property in Term-Rewriting Systems.
Theor. Comput. Sci., 1992

Learning from Examples in Universe of Discourse Described by a Set of equations.
Int. J. Artif. Intell. Tools, 1992

SPIKE, an Automatic Theorem Prover.
Proceedings of the Logic Programming and Automated Reasoning, 1992

A Simplification-Based Approach to Program Synthesis.
Proceedings of the 10th European Conference on Artificial Intelligence, 1992

1991
On Word Problems in Horn Theories.
J. Symb. Comput., 1991

Compilation of Pattern Matching with Associative-Commutative Functions.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

A Solution of the Complement Problem in Associative-Commutative Theories.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Automatic Proof Methods for Algebraic Specifications.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Studies on the Ground Convergence Property of Conditional Theories.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
Mechanizing inductive reasoning.
Bull. EATCS, 1990

Pumping Lemmas for Tree Languages Generated by Rewrite Systems.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Learning from examples and counterexamples with equational background knowledge.
Proceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence, 1990

A Proof System for Conditional Algebraic Specifications.
Proceedings of the Conditional and Typed Rewriting Systems, 1990

Testing for Inductive (Co)-Reducibility.
Proceedings of the CAAP '90, 1990

1989
Automatic Proofs by Induction in Theories without Constructors
Inf. Comput., July, 1989

1986
Automatic Proofs by Induction in Equational Theories Without Constructors
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985
Proofs by induction in equational theories without constructors.
Bull. EATCS, 1985

Completeness in Data Type Specifications.
Proceedings of the EUROCAL '85, 1985


  Loading...