Results 1  10
of
77,251
Efficient LoopCheck for Backward Proof Search in Some NonClassical Propositional Logics
, 1996
"... . We consider the modal logics KT and S4, the tense logic K t , and the fragment IPC (^;!) of intuitionistic logic. For these logics backward proof search in the standard sequent or tableau calculi does not terminate in general. In terms of the respective Kripke semantics, there are several kinds of ..."
Abstract

Cited by 39 (1 self)
 Add to MetaCart
. We consider the modal logics KT and S4, the tense logic K t , and the fragment IPC (^;!) of intuitionistic logic. For these logics backward proof search in the standard sequent or tableau calculi does not terminate in general. In terms of the respective Kripke semantics, there are several kinds
On Different ProofSearch
"... Abstract. In this paper, we consider three different search strategies for a cutfree sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space are exponential ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we consider three different search strategies for a cutfree sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space
Cutelimination and proofsearch for biintuitionistic logic using nested sequents
, 2008
"... We propose a new sequent calculus for biintuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cutelimination proof as do display calculi. But it has an easily derivable variant cal ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
, which has a purely syntactic cutelimination proof, and which can be used naturally for backwards proofsearch.
Proofsearch, Satisfiability Modulo Theories
"... banner above paper title A bisimulation between DPLL(T) and a proofsearch strategy for the focused sequent calculus ..."
Abstract
 Add to MetaCart
banner above paper title A bisimulation between DPLL(T) and a proofsearch strategy for the focused sequent calculus
Linear Logic with Isabelle: pruning the proof search tree
, 1995
"... This paper introduces a general backward proof search strategy for multiplicative additive linear logic. This strategy, which is based on Isabelle's basic tactics and tacticals, has been implemented and appears to be rather efficient. Its efficiency derives from several heuristics that we intro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper introduces a general backward proof search strategy for multiplicative additive linear logic. This strategy, which is based on Isabelle's basic tactics and tacticals, has been implemented and appears to be rather efficient. Its efficiency derives from several heuristics that we
STRIP: Structural sharing for efficient proofsearch
 IJCAR2001 , LNAI 2083
, 2001
"... Abstract. In this paper, we present a new system for proofsearch in propositional intuitionistic logic from which an efficient implementation based on structural sharing is naturally derived. The way to solve the problem of formula duplication is not based on logical solutions but on an appropriate ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we present a new system for proofsearch in propositional intuitionistic logic from which an efficient implementation based on structural sharing is naturally derived. The way to solve the problem of formula duplication is not based on logical solutions
ProofSearch in Intuitionistic Logic Based on Constraint Satisfaction
 Theorem Proving with Analytic Tableaux and Related Methods. 5th International Workshop, TABLEAUX '96, volume 1071 of Lecture Notes in Artificial Intelligence
, 1996
"... We characterize provability in intuitionistic predicate logic in terms of derivation skeletons and constraints and study the problem of instantiations of a skeleton to valid derivations. We prove that for two different notions of a skeleton the problem is respectively polynomial and NPcomplete. As ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
We characterize provability in intuitionistic predicate logic in terms of derivation skeletons and constraints and study the problem of instantiations of a skeleton to valid derivations. We prove that for two different notions of a skeleton the problem is respectively polynomial and NPcomplete. As an application of our technique, we demonstrate PSPACEcompleteness of the prenex fragment of intuitionistic logic. We outline some applications of the proposed technique in automated reasoning. y y Copyright c fl 1995, 1996 Andrei Voronkov. This technical report and other technical reports in this series can be obtained at http://www.csd.uu.se/~thomas/reports.html or at ftp.csd.uu.se in the directory pub/papers/reports. Some reports can be updated, check one of these addresses for the latest version. Section 1 Introduction The characterization of provability for classical logic in terms of matrices was given by Kanger [9, 10] and Prawitz [19, 20] and is in a fact a reformulation of the...
Proofsearch in typetheoretic languages: an introduction
 Theoretical Computer Science
, 2000
"... We introduce the main concepts and problems in the theory of proofsearch in typetheoretic languages and survey some specific, connected topics. We do not claim to cover all of the theoretical and implementation issues in the study of proofsearch in typetheoretic languages; rather, we present som ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We introduce the main concepts and problems in the theory of proofsearch in typetheoretic languages and survey some specific, connected topics. We do not claim to cover all of the theoretical and implementation issues in the study of proofsearch in typetheoretic languages; rather, we present
Notes Towards a Semantics for Proofsearch
"... Algorithmic proofsearch is an essential enabling technology throughout informatics. Proofsearch is the prooftheoretic realization of the formulation of logic not as a theory of deduction but rather as a theory of reduction. Whilst deductive logics typically have a welldeveloped semantics of proo ..."
Abstract
 Add to MetaCart
Algorithmic proofsearch is an essential enabling technology throughout informatics. Proofsearch is the prooftheoretic realization of the formulation of logic not as a theory of deduction but rather as a theory of reduction. Whilst deductive logics typically have a welldeveloped semantics
Results 1  10
of
77,251