default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmmanuel Kounalis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j11]Olivier Ponsini, Carine Fédèle, Emmanuel Kounalis:
Rewriting of imperative programs into logical equations. Sci. Comput. Program. 56(3): 363-401 (2005)- 2004
- [j10]Pascal Urso, Emmanuel Kounalis:
Sound generalizations in mathematical induction. Theor. Comput. Sci. 323(1-3): 443-471 (2004) - 2003
- [c22]Pascal Urso, Emmanuel Kounalis:
"Term Partition" for Mathematical Induction. RTA 2003: 352-366 - 2002
- [c21]Pascal Urso, Emmanuel Kounalis:
Généralisations correctes pour l'induction mathématique. JFPLC 2002: 211-
1990 – 1999
- 1999
- [c20]Emmanuel Kounalis, Pascal Urso:
Generalization Discovery for Proofs by Induction in Conditional Theories. FLAIRS 1999: 250-256 - [c19]Emmanuel Kounalis, Pascal Urso:
Mechanizing Proofs of Integrity Constraints in the Situation Calculus. IEA/AIE 1999: 372-381 - [c18]Carine Fédèle, Emmanuel Kounalis:
Automatic Proofs of Properties of Simple C- Modules. ASE 1999: 283-286 - 1995
- [j9]Emmanuel Kounalis, Michaël Rusinowitch:
Reasoning with Conditional Axioms. Ann. Math. Artif. Intell. 15(2): 125-149 (1995) - [j8]Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch:
Automated Mathematical Induction. J. Log. Comput. 5(5): 631-668 (1995) - 1994
- [c17]Jacques Chazarain, Emmanuel Kounalis:
Mechanizable Inductive Proofs for a Class of Forall Exists Formulas. CADE 1994: 118-132 - 1993
- [j7]Emmanuel Kounalis, Michaël Rusinowitch:
A Logical Framework for Concept Learning with Background Knowledge. Int. J. Artif. Intell. Tools 2(3): 329-348 (1993) - 1992
- [j6]Emmanuel Kounalis:
Learning from Examples in Universe of Discourse Described by a Set of equations. Int. J. Artif. Intell. Tools 1(3): 333-350 (1992) - [j5]Emmanuel Kounalis:
Testing for the Ground (Co-)Reducibility Property in Term-Rewriting Systems. Theor. Comput. Sci. 106(1): 87-117 (1992) - [c16]Emmanuel Kounalis:
A Simplification-Based Approach to Program Synthesis. ECAI 1992: 82-86 - [c15]Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch:
SPIKE, an Automatic Theorem Prover. LPAR 1992: 460-462 - 1991
- [j4]Emmanuel Kounalis, Michaël Rusinowitch:
On Word Problems in Horn Theories. J. Symb. Comput. 11(1/2): 113-127 (1991) - [c14]Emmanuel Kounalis, Michaël Rusinowitch:
Studies on the Ground Convergence Property of Conditional Theories. AMAST 1991: 363-376 - [c13]Emmanuel Kounalis, Michaël Rusinowitch:
Automatic Proof Methods for Algebraic Specifications. FCT 1991: 307-317 - [c12]Emmanuel Kounalis, Denis Lugiez, Loic Pottier:
A Solution of the Complement Problem in Associative-Commutative Theories. IWWERT 1991: 197-214 - [c11]Emmanuel Kounalis, Denis Lugiez, Loic Pottier:
A Solution of the Complement Problem in Associative-Commutative Theories. MFCS 1991: 287-297 - [c10]Emmanuel Kounalis, Denis Lugiez:
Compilation of Pattern Matching with Associative-Commutative Functions. TAPSOFT, Vol.1 1991: 57-73 - 1990
- [j3]Emmanuel Kounalis, Michaël Rusinowitch:
Mechanizing inductive reasoning. Bull. EATCS 41: 216-226 (1990) - [c9]Emmanuel Kounalis, Michaël Rusinowitch:
Mechanizing Inductive Reasoning. AAAI 1990: 240-245 - [c8]Emmanuel Kounalis:
Testing for Inductive (Co)-Reducibility. CAAP 1990: 221-238 - [c7]Emmanuel Kounalis, Michaël Rusinowitch:
A Proof System for Conditional Algebraic Specifications. CTRS 1990: 51-63 - [c6]Emmanuel Kounalis:
Learning from examples and counterexamples with equational background knowledge. TAI 1990: 254-260 - [c5]Emmanuel Kounalis:
Pumping Lemmas for Tree Languages Generated by Rewrite Systems. MFCS 1990: 369-377
1980 – 1989
- 1989
- [j2]Jean-Pierre Jouannaud, Emmanuel Kounalis:
Automatic Proofs by Induction in Theories without Constructors. Inf. Comput. 82(1): 1-33 (1989) - 1988
- [c4]Emmanuel Kounalis, Michaël Rusinowitch:
On Word Problems in Horn Theories. CADE 1988: 527-537 - 1987
- [c3]Emmanuel Kounalis, Michaël Rusinowitch:
On Word Problems in Horn Theories. CTRS 1987: 144-160 - 1986
- [c2]Jean-Pierre Jouannaud, Emmanuel Kounalis:
Automatic Proofs by Induction in Equational Theories Without Constructors. LICS 1986: 358-366 - 1985
- [j1]Jean-Pierre Jouannaud, Emmanuel Kounalis:
Proofs by induction in equational theories without constructors. Bull. EATCS 27: 49-55 (1985) - [c1]Emmanuel Kounalis:
Completeness in Data Type Specifications. European Conference on Computer Algebra (2) 1985: 348-362
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
