Bonnes démonstrations en déduction modulo

@inproceedings{Burel2009BonnesDE,
  title={Bonnes d{\'e}monstrations en d{\'e}duction modulo},
  author={Guillaume Burel},
  year={2009}
}
Cette these etudie comment l'integration du calcul dans les demonstrations peut les simplifier. Nous nous interessons pour cela a la deduction modulo et a la surdeduction, deux formalismes proches dans lesquels le calcul est incorpore dans les demonstrations via un systeme de reecriture. Pour ameliorer la recherche mecanisee de demonstration, nous considerons trois criteres de simplicite. L'admissibilite des coupures permet de restreindre l'espace de recherche des demonstrations, mais elle n… CONTINUE READING

Similar Papers

References

Publications referenced by this paper.
SHOWING 1-10 OF 96 REFERENCES

On the proof complexity of deep inference

  • ACM Transactions on Computational Logic. À paraître
  • 2009
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

A semantic normalization proof of systems with recursors

Lisa Allali et Paul Brauner
  • 2008
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

From Deep Inference to Proof Nets

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

TaMeD: A Tableau Method for Deduction Modulo

VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL

Isabelle: The Next 700 Theorem Provers

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The lambda calculus - its syntax and semantics

  • Studies in logic and the foundations of mathematics
  • 1984
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL