503 search results - page 45 / 101 » Interpolative Boolean Logic |
101
Voted
CAV
2009
Springer
15 years 7 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
108
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
85
Voted
TBILLC
2005
Springer
15 years 6 months ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the de...
SAT
2004
Springer
15 years 6 months ago
2004
Springer
The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the unobservability of logic blocks is encoded with CNF unobservabil...
127
Voted
TABLEAUX
2000
Springer
15 years 4 months ago
2000
Springer
mspass is an extension of the first-order theorem prover spass, which can be used as a modal logic theorem prover, a theorem prover for description logics and a theorem prover for ...