VSL 2014: VIENNA SUMMER OF LOGIC 2014

B
Bacchus, Fahiem	Algorithmic Paradigms for Solving QBF
Biere, Armin	EPR Encodings of Bit-Vector Problems Even With Quantifiers
Bjorner, Nikolaj	Quantifier Projection
C
Cashmore, Michael	Encoding Reachability with Quantification
Chen, Hubie	Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction
D
De Moura, Leonardo	Finding Conflicting Instances of Quantified Formulas in SMT
E
Egly, Uwe	Quantifier handling in calculi for quantified Boolean formulas
F
Fox, Maria	Encoding Reachability with Quantification
Fröhlich, Andreas	EPR Encodings of Bit-Vector Problems Even With Quantifiers
G
Giunchiglia, Enrico	Encoding Reachability with Quantification
H
Hermo, Montserrat	Projective Quantifier Elimination for Equational Constraint Solving
K
Kovásznai, Gergely	EPR Encodings of Bit-Vector Problems Even With Quantifiers
L
Lucio, Paqui	Projective Quantifier Elimination for Equational Constraint Solving
R
Reynolds, Andrew	Finding Conflicting Instances of Quantified Formulas in SMT
T
Tinelli, Cesare	Finding Conflicting Instances of Quantified Formulas in SMT
W
Wintersteiger, Christoph	Efficiently Solving Quantified Bit-Vectors
Á
Álvez, Javier	Projective Quantifier Elimination for Equational Constraint Solving

Disclaimer | Powered by EasyChair Smart Program