438 search results - page 30 / 88 » On theorem proving in annotated logics |
178
click to vote
CC
2009
Springer
16 years 14 days ago
2009
Springer
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
CADE
2007
Springer
16 years 4 days ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
101
click to vote
ACL
1997
15 years 1 months ago
1997
Recent work has seen the emergence of a common framework for parsing categorial grammar (CG) formalisms that fall within the 'type-logical' tradition (such as the Lambek...
100
click to vote
CADE
2010
Springer
15 years 28 days ago
2010
Springer
Abstract. Sledgehammer, a component of the interactive theorem prover Isabelle, finds proofs in higher-order logic by calling the automated provers for first-order logic E, SPASS a...