32 search results - page 1 / 7 » Proof Search and Proof Check for Equational and Inductive Th... |
CADE
2003
Springer
14 years 4 months ago
2003
Springer
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 stron...
CADE
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system ...
TABLEAUX
2000
Springer
13 years 8 months ago
2000
Springer
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...
CADE
2008
Springer
14 years 4 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
CSL
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...