Sciweavers

202 search results - page 20 / 41
» Proof Search in Minimal Logic
Sort
View
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
13 years 7 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
13 years 12 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
KGC
1993
Springer
13 years 11 months ago
The Mathematics of Set Predicates in Prolog
We provide a logical speci cation of set predicates ndall and bagof of Prolog. The speci cation is given in proof theoretic terms, and pertains to any SLD resolution based language...
Egon Börger, Dean Rosenzweig
FUIN
2007
90views more  FUIN 2007»
13 years 7 months ago
A Resolution Calculus with Shared Literals
We present a resolution calculus for first-order logic using a more concise formalism for representing sets of clauses. The idea is to represent the clause set at hand as a Direct...
Nicolas Peltier
POPL
2006
ACM
14 years 8 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam