Sciweavers

1322 search results - page 12 / 265
» Unsound Theorem Proving
Sort
View
TPHOL
2000
IEEE
13 years 12 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
PSSS
2003
13 years 8 months ago
Extending Classical Theorem Proving for the Semantic Web
We investigate the applicability of classical resolution-based theorem proving methods for the Semantic Web. We consider several well-known search strategies, propose a general sch...
Tanel Tammet
IGPL
1998
97views more  IGPL 1998»
13 years 7 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
CADE
2009
Springer
14 years 8 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
CADE
2001
Springer
14 years 7 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...