The SCEAS System
| |||||||

## Search the dblp DataBase
Marta Franová:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Yves Kodratoff, Marta Franová, Derek Partridge
**Why and How Program Synthesis?**[Citation Graph (0, 0)][DBLP] AII, 1989, pp:45-59 [Conf] - Marta Franová
**An Implementation of Program Synthesis from Formal Specifications: PRECOMAS.**[Citation Graph (0, 0)][DBLP] ECAI, 1988, pp:559-564 [Conf] - Marta Franová, Yves Kodratoff
**Predicate Synthesis from Formal Specifications.**[Citation Graph (0, 0)][DBLP] ECAI, 1992, pp:87-91 [Conf] - Marta Franová
**Fundamentals for a New Methodology for Inductive Theorem Proving: CM-Construction of Atomic Formulae.**[Citation Graph (0, 0)][DBLP] ECAI, 1988, pp:136-141 [Conf] - Marta Franová
**A Methodology for Automatic Programming Based on the Constructive Matching Strategy.**[Citation Graph (0, 0)][DBLP] European Conference on Computer Algebra (2), 1985, pp:568-569 [Conf] - Yves Kodratoff, Marta Franová, Derek Partridge
**Logic Programming and Program Synthesis.**[Citation Graph (0, 0)][DBLP] ICSI, 1990, pp:346-355 [Conf] - Marta Franová, Monia Kooli
[Citation Graph (0, 0)][DBLP]*Theory of Constructable Domains*for Robotics: Why? IEA/AIE (Vol. 1), 1998, pp:37-46 [Conf] - Marta Franová
**Proving Theorems by Construction of Valid Formulae.**[Citation Graph (0, 0)][DBLP] IFIP Congress, 1986, pp:41-46 [Conf] - Marta Franová
**CM-Strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs.**[Citation Graph (0, 0)][DBLP] IJCAI, 1985, pp:1214-1220 [Conf] - Marta Franová, Yves Kodratoff
**Solving "How to Clear a Block" with Constructive Matching Methodology.**[Citation Graph (0, 0)][DBLP] IJCAI, 1991, pp:232-239 [Conf] - Marta Frañová
**Constructive Matching - Explanation Based Methodology for Inductive Theorem Proving.**[Citation Graph (0, 0)][DBLP] IMYCS, 1990, pp:138-147 [Conf] - Marta Franová
**Automated Inductive Reasoning as a Support of Deductive Reasoning in a User-Independent Automation of Inductive Theorem Proving.**[Citation Graph (0, 0)][DBLP] ISMIS, 1996, pp:551-560 [Conf] - Marta Franová, Yves Kodratoff, Martine Gross
**Constructive Matching Methodology: Formally Creative or Intelligent Inductive Theorem Proving?**[Citation Graph (0, 0)][DBLP] ISMIS, 1993, pp:476-485 [Conf] - Marta Franová
**PRECOMAS an Implementation of Constructive Matching Methodology.**[Citation Graph (0, 0)][DBLP] ISSAC, 1990, pp:16-23 [Conf] - Marta Franová
[Citation Graph (0, 0)][DBLP]*Constructive Matching*- A Methodology for Inductive Theorem Proving. JELIA, 1990, pp:212-226 [Conf] - Marta Franová, Yves Kodratoff
**Predicate Synthesis from Formal Specifications: Using Mathematical Induction for Finding the Preconditions of Theorems.**[Citation Graph (0, 0)][DBLP] Nonmonotonic and Inductive Logic, 1991, pp:184-208 [Conf] **La "créativité calculatoire" et les heuristiques créatives en synthèse de prédicats multiples.**[Citation Graph (, )][DBLP]**On Computational Creativity, 'Inventing' Theorem Proofs.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |