183 search results - page 21 / 37 » Automated theorem proving by resolution in non-classical log... |
100
click to vote
CADE
2010
Springer
15 years 25 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...
CADE
2006
Springer
16 years 16 hour ago
2006
Springer
In this paper we introduce several new improvements to the bottom-up model generation (BUMG) paradigm. Our techniques are based on non-trivial transformations of first-order probl...
CADE
2001
Springer
16 years 16 hour ago
2001
Springer
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
LPNMR
1997
Springer
15 years 3 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...