Sciweavers

Share
2 search results - page 1 / 1
» A Compact Representation for Syntactic Dependencies in QBFs
Sort
View
SAT
2009
Springer
109views Hardware» more  SAT 2009»
10 years 2 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
CORR
2010
Springer
151views Education» more  CORR 2010»
9 years 8 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur
books