default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarta Franová
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[p1]Marta Franová, Yves Kodratoff:
Two Examples of Computational Creativity: ILP Multiple Predicate Synthesis and the 'Assets' in Theorem Proving. Advances in Machine Learning II 2010: 155-173
2000 – 2009
- 2009
- [c18]Marta Franová, Yves Kodratoff:
La "créativité calculatoire" et les heuristiques créatives en synthèse de prédicats multiples. EGC 2009: 151-162 - [c17]Marta Franová, Yves Kodratoff:
On Computational Creativity, 'Inventing' Theorem Proofs. ISMIS 2009: 573-581
1990 – 1999
- 1998
- [c16]Marta Franová, Monia Kooli:
Theory of Constructable Domains for Robotics: Why? IEA/AIE (Vol. 1) 1998: 37-46 - 1996
- [c15]Marta Franová:
Automated Inductive Reasoning as a Support of Deductive Reasoning in a User-Independent Automation of Inductive Theorem Proving. ISMIS 1996: 551-560 - 1993
- [c14]Marta Franová, Yves Kodratoff, Martine Gross:
Constructive Matching Methodology: Formally Creative or Intelligent Inductive Theorem Proving? ISMIS 1993: 476-485 - 1992
- [c13]Marta Franová, Yves Kodratoff:
Predicate Synthesis from Formal Specifications. ECAI 1992: 87-91 - 1991
- [c12]Marta Franová, Yves Kodratoff:
Solving "How to Clear a Block" with Constructive Matching Methodology. IJCAI 1991: 232-239 - [c11]Marta Franová, Yves Kodratoff:
Predicate Synthesis from Formal Specifications: Using Mathematical Induction for Finding the Preconditions of Theorems. Nonmonotonic and Inductive Logic 1991: 184-208 - 1990
- [c10]Yves Kodratoff, Marta Franová, Derek Partridge:
Logic Programming and Program Synthesis. ICSI 1990: 346-355 - [c9]Marta Franová:
Constructive Matching - Explanation Based Methodology for Inductive Theorem Proving. IMYCS 1990: 138-147 - [c8]Marta Franová:
PRECOMAS an Implementation of Constructive Matching Methodology. ISSAC 1990: 16-23 - [c7]Marta Franová:
Constructive Matching - A Methodology for Inductive Theorem Proving. JELIA 1990: 212-226
1980 – 1989
- 1989
- [c6]Yves Kodratoff, Marta Franová, Derek Partridge:
Why and How Program Synthesis? AII 1989: 45-59 - 1988
- [c5]Marta Franová:
Fundamentals for a New Methodology for Inductive Theorem Proving: CM-Construction of Atomic Formulae. ECAI 1988: 136-141 - [c4]Marta Franová:
An Implementation of Program Synthesis from Formal Specifications: PRECOMAS. ECAI 1988: 559-564 - 1986
- [c3]Marta Franová:
Proving Theorems by Construction of Valid Formulae. IFIP Congress 1986: 41-46 - 1985
- [c2]Marta Franová:
A Methodology for Automatic Programming Based on the Constructive Matching Strategy. European Conference on Computer Algebra (2) 1985: 568-569 - [c1]Marta Franová:
CM-Strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs. IJCAI 1985: 1214-1220
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-11-07 21:36 CET 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:
