Franova, Marta
Overview
Works:  25 works in 38 publications in 2 languages and 95 library holdings 

Roles:  Author 
Publication Timeline
.
Most widely held works by
Marta Franova
Créativité formelle by
Marta Franova(
Book
)
2 editions published between 2008 and 2009 in French and held by 26 WorldCat member libraries worldwide
2 editions published between 2008 and 2009 in French and held by 26 WorldCat member libraries worldwide
Predicate synthesis from formal specifications or using mathematical induction for finding the preconditions of theorems by
Marta Franov(
Book
)
4 editions published between 1991 and 1992 in English and held by 7 WorldCat member libraries worldwide
4 editions published between 1991 and 1992 in English and held by 7 WorldCat member libraries worldwide
Generating induction hypotheses by constructive matching methodology for inductive theorem proving and program synthesis revisited by
Marta Franov(
Book
)
3 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
3 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
A constructive proof for prime factorization theorem : a result of putting it together in constructive matching methodology by
Marta Franova(
Book
)
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
Why are we (almost always) able to prove inductive theorems "by hand" and how to obtain an automatic system that does it the
same way : introduction to inductive theorem proving for postgraduate students by
Marta Franova(
Book
)
2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide
A theory of constructible domains : a formalization of inductively defined systems of objects for a userindependent automation
of inductive theorem proving by
Marta Fraňov(
Book
)
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Program synthesis, what for? by
Yves Kodratoff(
Book
)
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 3 WorldCat member libraries worldwide
Simplifying implications in inductive theorem proving : why and how? by
Marta Franova(
Book
)
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
Practical problems in the automatization of inductive theorem proving by
Marta Fraňov(
Book
)
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
Constructive matching methodology : a standard way of proving userindependently theorems by induction by
Marta Fraňov(
Book
)
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
A synthesis of a definition recursive with respect to the second argument for the AckermannPeter's function : a puzzle solved
by constructive matching methodology by
Marta Fraňov(
Book
)
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Constructive matching methodology : a step toward creative automated inductive theorem proving by
Marta Franova(
Book
)
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1991 in English and held by 3 WorldCat member libraries worldwide
Explanations provided by constructive matching in inductive theorem proving by
Marta Franova(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Precomas userś guide by
Marta Franova(
Book
)
2 editions published between 1987 and 1989 in Undetermined and English and held by 3 WorldCat member libraries worldwide
2 editions published between 1987 and 1989 in Undetermined and English and held by 3 WorldCat member libraries worldwide
Constructive matching methodology : formally creative or intelligent inductive theorem proving? by
Marta Fran̆ov(
Book
)
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "In this paper we are interested in the question: To what extent can the ability of a mathematician for proving theorems by induction be formalized and thus implemented? In this paper we explain why, and in what sense, the methodology for inductive theorem proving (ITP) we develop is creative and we explain why our methodology cannot be said to be 'intelligent', as a human could be, and nevertheless it is suitable for a userindependent automatization of ITP."
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "In this paper we are interested in the question: To what extent can the ability of a mathematician for proving theorems by induction be formalized and thus implemented? In this paper we explain why, and in what sense, the methodology for inductive theorem proving (ITP) we develop is creative and we explain why our methodology cannot be said to be 'intelligent', as a human could be, and nevertheless it is suitable for a userindependent automatization of ITP."
Constructive matching methodology : an extension and an application to a planning problem by
Marta Fran̆ov(
Book
)
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Construction Matching (CM) is a methodology for proving theorems requiring the use of the induction principle. In logic programming people quite often write logic programs containing implicitly existentially quantified variables. Due to PROLOG way of computation these definitions are often computable, but it may be not straightforward how these definitions can be rewritten into another directly computable, for instance 'functional', form. In our previous work we have restricted our methodology to the socalled Constructible Domains, which are defined inductively in terms of constructors and the axioms defining objects are computable directly, i.e., these axioms do not contain implicitly existentially quantified variables. In order to extend the scope of applicability, for instance to use our methodology as a theorem proving technique in logic programming systems, we adapt in this paper the basic technique of our methodology, the CMformula construction, so that this particular form of axioms can also be handled. In order to illustrate this extension, we solve a planning problem formulated and solved by Manna and Waldinger in one of their papers. The CMsolution presented here illustrates how our methodology can be used to automate, in a user independent way, the synthesis of plans."
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Construction Matching (CM) is a methodology for proving theorems requiring the use of the induction principle. In logic programming people quite often write logic programs containing implicitly existentially quantified variables. Due to PROLOG way of computation these definitions are often computable, but it may be not straightforward how these definitions can be rewritten into another directly computable, for instance 'functional', form. In our previous work we have restricted our methodology to the socalled Constructible Domains, which are defined inductively in terms of constructors and the axioms defining objects are computable directly, i.e., these axioms do not contain implicitly existentially quantified variables. In order to extend the scope of applicability, for instance to use our methodology as a theorem proving technique in logic programming systems, we adapt in this paper the basic technique of our methodology, the CMformula construction, so that this particular form of axioms can also be handled. In order to illustrate this extension, we solve a planning problem formulated and solved by Manna and Waldinger in one of their papers. The CMsolution presented here illustrates how our methodology can be used to automate, in a user independent way, the synthesis of plans."
Synthesis of formal specifications of predicates by
Marta Fraňov(
Book
)
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "The paper presents a method, Synthesis of formal specifications of predicates (SpecS), for finding nonrecursive definitions of predicates from the initially given recursive ones. To the obtained nonrecursive definition of a predicate one may then apply a method, such as Predicate Synthesis from formal specifications developed in Constructive Matching methodology, to construct another recursive definition of this predicate. SpecS may provide a more suitable definition than the initially given recursive one. In other words, this task is interesting for a user independent automization of inductive theorem proving, since it enables to change the definitions given when they are unsuitable for handling by the theorem prover."
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "The paper presents a method, Synthesis of formal specifications of predicates (SpecS), for finding nonrecursive definitions of predicates from the initially given recursive ones. To the obtained nonrecursive definition of a predicate one may then apply a method, such as Predicate Synthesis from formal specifications developed in Constructive Matching methodology, to construct another recursive definition of this predicate. SpecS may provide a more suitable definition than the initially given recursive one. In other words, this task is interesting for a user independent automization of inductive theorem proving, since it enables to change the definitions given when they are unsuitable for handling by the theorem prover."
CMstrategy : a formalization of "cheating" for inductive theorem proving and automatic programming by
Marta Franova(
Book
)
1 edition published in 1985 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 3 WorldCat member libraries worldwide
A standard proof by constructive matching methodology for a theorem formulated by Skolem by
Marta Fraňov(
Book
)
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
Precomas challenge by
Marta Franova(
Book
)
2 editions published in 1987 in Undetermined and English and held by 2 WorldCat member libraries worldwide
2 editions published in 1987 in Undetermined and English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Kodratoff, Yves Thesis advisor Author
 Gross, Martine
 Popelinsky, Lubomir
 Université de ParisSud Faculté des Sciences d'Orsay (Essonne) Degree grantor
 Université de ParisSud Degree grantor