Sciweavers

183 search results - page 3 / 37
» Automated theorem proving by resolution in non-classical log...
Sort
View
CADE
2003
Springer
15 years 9 months ago
How to Prove Inductive Theorems? QUODLIBET!
Jürgen Avenhaus, Ulrich Kühler, Tobias S...
CADE
2007
Springer
15 years 3 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
97
Voted
TPHOL
2000
IEEE
15 years 1 months ago
Fast Tactic-Based Theorem Proving
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
Jason Hickey, Aleksey Nogin
CADE
2008
Springer
15 years 9 months ago
Combining Theorem Proving with Natural Language Processing
Abstract. The LogAnswer system is an application of automated reasoning to the field of open domain question-answering, the retrieval of answers to natural language questions regar...
Björn Pelzer, Ingo Glöckner
CADE
2009
Springer
15 years 10 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
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...
Sean McLaughlin, Frank Pfenning