2 search results - page 1 / 1 » A Compact Representation for Syntactic Dependencies in QBFs |
SAT
2009
Springer
15 years 4 months ago
2009
Springer
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
88
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...