- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Proof-number search
Artificial Intelligence 66 (1):91-124 (1994)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Intuitionistic Logic Freed of All Metarules.Giovanna Corsi & Gabriele Tassi - 2007 - Journal of Symbolic Logic 72 (4):1204 - 1218.
Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
A Shell for Generic Interactive Proof Search.Aleksey Novodvorsky & Aleksey Smirnov - 1998 - Journal of Applied Non-Classical Logics 8 (1-2):123-140.
On different proof-search strategies for orthologic.Uwe Egly & Hans Tompits - 2003 - Studia Logica 73 (1):131 - 152.
On Different Proof-Search Strategies for Orthologic.Uwe Egly & Hans Tompits - 2003 - Studia Logica 73 (1):131-152.
Reductive logic and proof-search: proof theory, semantics, and control.David J. Pym - 2004 - New York: Oxford University Press. Edited by Eike Ritter.
Automated Proof Search in Non-classical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics.Lincoln A. Wallen - 1990 - MIT Press (MA).
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
In search of God: the written account of my own search for God.J. Delgado - 1995 - Bisbee, AZ: In Search Book.
Proofs and Countermodels in Non-Classical Logics.Sara Negri - 2014 - Logica Universalis 8 (1):25-60.
Arguing Around Mathematical Proofs.Michel Dufour - 2013 - In Andrew Aberdein & Ian J. Dove (eds.), The Argument of Mathematics. Dordrecht: Springer. pp. 61-76.
Analytics
Added to PP
2020-12-22
Downloads
13 (#1,010,467)
6 months
11 (#222,787)
2020-12-22
Downloads
13 (#1,010,467)
6 months
11 (#222,787)
Historical graph of downloads
Citations of this work
Computer Go: An AI oriented survey.Bruno Bouzy & Tristan Cazenave - 2001 - Artificial Intelligence 132 (1):39-103.
Best-first fixed-depth minimax algorithms.Aske Plaat, Jonathan Schaeffer, Wim Pijls & Arie de Bruin - 1996 - Artificial Intelligence 87 (1-2):255-293.
The PN∗-search algorithm: Application to tsume-shogi.Masahiro Seo, Hiroyuki Iida & Jos W. H. M. Uiterwijk - 2001 - Artificial Intelligence 129 (1-2):253-277.
Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information.Edward J. Powley, Peter I. Cowling & Daniel Whitehouse - 2014 - Artificial Intelligence 217 (C):92-116.
Computer shogi.Hiroyuki Iida, Makoto Sakuta & Jeff Rollason - 2002 - Artificial Intelligence 134 (1-2):121-144.
References found in this work
An analysis of alpha-beta pruning.Donald E. Knuth & Ronald W. Moore - 1975 - Artificial Intelligence 6 (4):293-326.
The B∗ tree search algorithm: A best-first proof procedure.Hans Berliner - 1979 - Artificial Intelligence 12 (1):23-40.
Principles of metareasoning.Stuart Russell & Eric Wefald - 1991 - Artificial Intelligence 49 (1-3):361-395.
A minimax algorithm better than alpha-beta?G. C. Stockman - 1979 - Artificial Intelligence 12 (2):179-196.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-5tf24 uwo