# Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures

1 DEDALE - Development of specifications
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present a method for patching faulty conjectures in automatic theorem proving. The conjectures we are interested in here are implicative formulas that are of the following form\,: $\forall \overline{ x}~\phi( \overline{ x})=\forall \overline{x} ~\exists \overline{Y} ~\Gamma(\overline{x},\overline{Y}) \leftarrow \Delta(\overline{x})$. A faulty conjecture is a statement $\forall \overline{ x}~\phi( \overline{ x})$, which is not provable in some given program ${\cal T}$, defining all the predicates occurring in $\phi$, i.e, ${\cal M(T)}\not \models \forall \overline{ x}~ \phi( \overline{ x})$, where ${\cal M(T)}$ means the least Herbrand model of ${\cal T}$, but it would be if enough conditions, say $P$, were assumed to hold, i.e., ${\cal M(T\cup P)}\models \forall \overline{ x}~ \phi( \overline{ x})\leftarrow P$, where ${\cal P}$ is the definition of $P$. The missing hypothesis $P$ is called a corrective predicate for $\phi$. To construct $P$, we use the abduction mechanism that is the process of hypothesis formation. In this paper, we use the logic based approach because it is suitable for the application of deductive rules.
Keywords :
Type de document :
Communication dans un congrès
Maurice Bruynooghe. Logic Based Program Synthesis and Transformation: 13th International Symposium - LOPSTR 2003, 2003, Uppsala, Sweden, Springer Verlag, 3018, pp.20-33, 2003, Lecture Notes in Computer Science
Domaine :

https://hal.inria.fr/inria-00100052
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:13:44
Dernière modification le : mardi 24 avril 2018 - 13:36:41

### Identifiants

• HAL Id : inria-00100052, version 1

### Citation

Francis Alexandre, Khaled Bsaïes, Moussa Demba. Predicate Synthesis from Inductive Proof Attempt of Faulty Conjectures. Maurice Bruynooghe. Logic Based Program Synthesis and Transformation: 13th International Symposium - LOPSTR 2003, 2003, Uppsala, Sweden, Springer Verlag, 3018, pp.20-33, 2003, Lecture Notes in Computer Science. 〈inria-00100052〉

### Métriques

Consultations de la notice