3333 search results - page 17 / 667 » Abstract Proof Search |
154
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
171
click to vote
ISMIS
1993
Springer
15 years 10 months ago
1993
Springer
An approach to implementing deduction systems based on semantic tableaux is described; it works by compiling a graphical representation of a fully expanded tableaux into a program...
149
click to vote
AAAI
2010
15 years 7 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
164
click to vote
CG
2006
Springer
15 years 9 months ago
2006
Springer
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
206
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...