183 search results - page 23 / 37 » Automated theorem proving by resolution in non-classical log... |
CADE
2007
Springer
14 years 7 months ago
2007
Springer
MaLARea (a Machine Learner for Automated Reasoning) is a simple metasystem iteratively combining deductive Automated Reasoning tools (now the E and the SPASS ATP systems) with a m...
25
Voted
LPAR
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
TPHOL
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract. Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and mo...
CSL
2002
Springer
13 years 7 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
SIAMCOMP
2008
13 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...