Marta Franová

According to our database, Marta Franová authored at least 19 papers between 1985 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2010

Two Examples of Computational Creativity: ILP Multiple Predicate Synthesis and the 'Assets' in Theorem Proving.

Marta Franová, Yves Kodratoff

Proceedings of the Advances in Machine Learning II, 2010

2009

On Computational Creativity, 'Inventing' Theorem Proofs.

Marta Franová, Yves Kodratoff

Proceedings of the Foundations of Intelligent Systems, 18th International Symposium, 2009

La "créativité calculatoire" et les heuristiques créatives en synthèse de prédicats multiples.

Marta Franová, Yves Kodratoff

Proceedings of the Extraction et gestion des connaissances (EGC'2009), 2009

1998

<i>Theory of Constructable Domains</i> for Robotics: Why?

Marta Franová, Monia Kooli

Proceedings of the Methodology and Tools in Knowledge-Based Systems, 1998

1996

Automated Inductive Reasoning as a Support of Deductive Reasoning in a User-Independent Automation of Inductive Theorem Proving.

Marta Franová

Proceedings of the Foundations of Intelligent Systems, 9th International Symposium, 1996

1993

Constructive Matching Methodology: Formally Creative or Intelligent Inductive Theorem Proving?

Marta Franová, Yves Kodratoff, Martine Gross

Proceedings of the Methodologies for Intelligent Systems, 7th International Symposium, 1993

1992

Predicate Synthesis from Formal Specifications.

Marta Franová, Yves Kodratoff

Proceedings of the 10th European Conference on Artificial Intelligence, 1992

1991

Predicate Synthesis from Formal Specifications: Using Mathematical Induction for Finding the Preconditions of Theorems.

Marta Franová, Yves Kodratoff

Proceedings of the Nonmonotonic and Inductive Logic, 1991

Solving "How to Clear a Block" with Constructive Matching Methodology.

Marta Franová, Yves Kodratoff

Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

1990

<i>Constructive Matching</i> - A Methodology for Inductive Theorem Proving.

Marta Franová

Proceedings of the Logics in AI, European Workshop, 1990

PRECOMAS an Implementation of Constructive Matching Methodology.

Marta Franová

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

Constructive Matching - Explanation Based Methodology for Inductive Theorem Proving.

Marta Franová

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Logic Programming and Program Synthesis.

Yves Kodratoff, Marta Franová, Derek Partridge

Proceedings of the First International Conference on Systems Integration, 1990

1989

Why and How Program Synthesis?

Yves Kodratoff, Marta Franová, Derek Partridge

Proceedings of the Analogical and Inductive Inference, 1989

1988

Fundamentals for a New Methodology for Inductive Theorem Proving: CM-Construction of Atomic Formulae.

Marta Franová

Proceedings of the 8th European Conference on Artificial Intelligence, 1988

An Implementation of Program Synthesis from Formal Specifications: PRECOMAS.

Marta Franová

Proceedings of the 8th European Conference on Artificial Intelligence, 1988

1986

Proving Theorems by Construction of Valid Formulae.

Marta Franová

Proceedings of the Information Processing 86, 1986

1985

CM-Strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs.

Marta Franová

Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

A Methodology for Automatic Programming Based on the Constructive Matching Strategy.

Marta Franová

Proceedings of the EUROCAL '85, 1985