446 search results - page 15 / 90 » A Theorem Prover for a Computational Logic |
JCST
2010
14 years 4 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
101
click to vote
TC
2010
14 years 8 months ago
2010
—Reliability analysis has become a tool of fundamental importance to virtually all electrical and computer engineers because of the extensive usage of hardware systems in safety ...
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...