Correcting Faulty Conjectures by Logic Program Synthesis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Correcting Faulty Conjectures by Logic Program Synthesis

Moussa Demba
  • Function : Author
  • PersonId : 835395
Khaled Bsaïes
  • Function : Author
Francis Alexandre
  • Function : Author
  • PersonId : 830098


It's highlighted that when proving conjectures or synthesising programs, we are sometimes faced with an unprovable conjecture. In general, a theorem prover will do nothing more but indicates the conjecture is false. However, in many cases it is highly desirable to have an automated means for detecting and correcting faulty conjectures. Classical methods are not able to detect automatically unconsistancy in conjectures. In this paper, we present a method for patching faulty conjectures. Let $\Phi$ be a faulty conjecture, the proposed method builds a definition for a corrective predicate P such that $\forall x~(\Phi(x)\Leftarrow P(x))$ is a theorem.
No file

Dates and versions

inria-00099562 , version 1 (26-09-2006)


  • HAL Id : inria-00099562 , version 1


Moussa Demba, Khaled Bsaïes, Francis Alexandre. Correcting Faulty Conjectures by Logic Program Synthesis. International Conference on Computers Systems and Applications 2003 - AICCSA'03, ACS, IEEE, 2003, Tunis, Tunisie, 6 p. ⟨inria-00099562⟩
33 View
0 Download


Gmail Facebook X LinkedIn More