Results 1  10
of
241,752
Foundations of Proof Search Strategies Design in Linear Logic
 In Symposium on Logical Foundations of Computer Science
, 1994
"... In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving logical foundations for the design of proof search strategies. We propose common theoretical foundations for topdown, bottomup and mixed proof search procedures with a systematic formalization of s ..."
Abstract

Cited by 20 (11 self)
 Add to MetaCart
In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving logical foundations for the design of proof search strategies. We propose common theoretical foundations for topdown, bottomup and mixed proof search procedures with a systematic formalization
Inference Rules Plus ProofSearch Strategies Equals Programs
, 2009
"... In the programminglanguage community many authors communicate algorithms through the use of inference rules. To get from rules to working code requires careful thought and effort. If the rules change or the author wants to use a different algorithm, the effort required to fix the code can be dispro ..."
Abstract
 Add to MetaCart
of this work is the design of MonStr, the executionstrategy language used to form an algorithm out of rules. MonStr specifications provide an important guarantee: a valid strategy cannot affect partial correctness, although it can affect termination, completeness, and efficiency. iii Contents
A bisimulation between DPLL(T) and a proofsearch strategy for the focused sequent calculus
 Proc. of the 2013 Int. Work. on Logical Frameworks and MetaLanguages: Theory and Practice (LFMTP
, 2013
"... We describe how the DavisPutnamLogemannLoveland procedure DPLL is bisimilar to the goaldirected proofsearch mechanism described by a standard but carefully chosen sequent calculus. We thus relate a procedure described as a transition system on states to the gradual completion of incomplete pro ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
We describe how the DavisPutnamLogemannLoveland procedure DPLL is bisimilar to the goaldirected proofsearch mechanism described by a standard but carefully chosen sequent calculus. We thus relate a procedure described as a transition system on states to the gradual completion of incomplete
DOI: 10.1145/2503887.2503892 A Bisimulation between DPLL(T) and a ProofSearch Strategy for the Focused Sequent Calculus
, 2013
"... We describe how the DavisPutnamLogemannLoveland procedure DPLL is bisimilar to the goaldirected proofsearch mechanism described by a standard but carefully chosen sequent calculus. We thus relate a procedure described as a transition system on states to the gradual completion of incomplete proo ..."
Abstract
 Add to MetaCart
We describe how the DavisPutnamLogemannLoveland procedure DPLL is bisimilar to the goaldirected proofsearch mechanism described by a standard but carefully chosen sequent calculus. We thus relate a procedure described as a transition system on states to the gradual completion of incomplete
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
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
calculus which is amenable to automated proof search as are (some) traditional sequent calculi. We first present the initial calculus and its cutelimination proof. We then present the derived calculus, and then present a proofsearch strategy which allows it to be used for automated proof search. We prove
Inducing Search Methods from Proofs
, 1997
"... A methodology is introduced for the automatic generation of proof search strategies in automated deduction. Examples are given by the application of this methodology to generate proof search strategies for modal logic S5 and Intuitionistic Propositional Calculus. Experimental results are presented. ..."
Abstract
 Add to MetaCart
A methodology is introduced for the automatic generation of proof search strategies in automated deduction. Examples are given by the application of this methodology to generate proof search strategies for modal logic S5 and Intuitionistic Propositional Calculus. Experimental results are presented
Strategies of Discourse Comprehension
, 1983
"... El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacke ..."
Abstract

Cited by 601 (27 self)
 Add to MetaCart
El Salvador, Guatemala is a, study in black and white. On the left is a collection of extreme MarxistLeninist groups led by what one diplomat calls “a pretty faceless bunch of people.’ ’ On the right is an entrenched elite that has dominated Central America’s most populous country since a CIAbacked coup deposed the reformist government of Col. Jacobo Arbenz Guzmán in 1954. Moderates of the political center. embattled but alive in E1 Salvador, have virtually disappeared in Guatemalajoining more than 30.000 victims of terror over the last tifteen vears. “The situation in Guatemala is much more serious than in EI Salvador, ” declares one Latin American diplomat. “The oligarchy is that much more reactionary. and the choices are far fewer. “ ‘Zero’: The Guatemalan oligarchs hated Jimmy Carter for cutting off U.S. military aid in 1977 to protest humanrights abusesand the rightwingers hired marimba bands and set off firecrackers on the night Ronald Reagan was elected. They considered Reagan an ideological kinsman and believed they had a special
Proofsearch and proof nets in mixed linear logic
 Electronic Notes in Theoretical Computer Science
"... ..."
Results 1  10
of
241,752