4 search results - page 1 / 1 » Compiling Proof Search in Semantic Tableaux |
ISMIS
1993
Springer
13 years 9 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...
TABLEAUX
1997
Springer
13 years 9 months ago
1997
Springer
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariabl...
TABLEAUX
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
POPL
2011
ACM
12 years 7 months ago
2011
ACM
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...