Sciweavers

3333 search results - page 18 / 667
» Abstract Proof Search
Sort
View
AAAI
2010
13 years 11 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 7 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
ENTCS
2006
105views more  ENTCS 2006»
13 years 9 months ago
A Game Semantics for Proof Search: Preliminary Results
We describe an ongoing project in which we attempt to describe a neutral approach to proof and refutation. In particular, we present a language of neutral expressions which contai...
Dale Miller, Alexis Saurin
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 9 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
CADE
2001
Springer
14 years 10 months ago
STRIP: Structural Sharing for Efficient Proof-Search
The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proof-search from a fine...
Didier Galmiche, Dominique Larchey-Wendling, Domin...