Marta Franová

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:55/2719 · DBLP profile ↗

← Back

9ranked-venue papers

9as first author

0since 2021 · last 2009

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 8 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 5 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence 1 paper		Planning, search and constraint satisfaction · 100%
Theoretical computer science 2 papers		Automated reasoning and model checking · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Automated reasoning and model checking theorem proving	2	1991	Solving "How to Clear a Block" with Constructive Matching Methodology · IJCAI 1991 CM-Strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs · IJCAI 1985
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › classical planning blocks world	1	1991	Solving "How to Clear a Block" with Constructive Matching Methodology · IJCAI 1991
Knowledge, reasoning and agents › Planning, search and constraint satisfaction classical planning	1	1991	Solving "How to Clear a Block" with Constructive Matching Methodology · IJCAI 1991
Automated reasoning and model checking › theorem proving inductive theorem proving	1	1985	CM-Strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs · IJCAI 1985

Methods — techniques the papers use, named apart from their topics

constructive matching · 0.0

Year	Publication	Venue	Position
2009	On Computational Creativity, 'Inventing' Theorem Proofs Marta Franová, Yves Kodratoff	ISMIS	1
1996	Automated Inductive Reasoning as a Support of Deductive Reasoning in a User-Independent Automation of Inductive Theorem Proving Marta Franová	ISMIS	1
1993	Constructive Matching Methodology: Formally Creative or Intelligent Inductive Theorem Proving? Marta Franová, Yves Kodratoff, Martine Gross	ISMIS	1
1992	Predicate Synthesis from Formal Specifications Marta Franová, Yves Kodratoff	ECAI	1
1991	Solving "How to Clear a Block" with Constructive Matching Methodology Marta Franová, Yves Kodratoff	IJCAI	1
1990	PRECOMAS an Implementation of Constructive Matching Methodology abstract The system PRECOMAS (PRoofs Educed by COnstructive MAtching for Synthesis) implements the Constructive Matching methodology for automatic constructions of programs from formal specifications.In this paper we describe briefly the goal of PRECOMAS, its logical background and the CM method applied to proving atomic formulae. We show how the user of our system is involved in solving a program synthesis problem. We show that this interaction does not concern the problem of guiding the program synthesis process, this being solved by CM. Our experimental version serves to confirm that the system is worth to be developed. Marta Franová	ISSAC	1
1988	An Implementation of Program Synthesis from Formal Specifications: PRECOMAS Marta Franová	ECAI	1
1988	Fundamentals for a New Methodology for Inductive Theorem Proving: CM-Construction of Atomic Formulae Marta Franová	ECAI	1
1985	CM-Strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs Marta Franová	IJCAI	1