Abstract
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check.
Author supplied keywords
Cite
CITATION STYLE
Deplagne, E., Kirchner, C., Kirchner, H., & Nguyen, Q. H. (2003). Proof search and proof check for equational and inductive theorems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2741, pp. 297–316). Springer Verlag. https://doi.org/10.1007/978-3-540-45085-6_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
