Name Venue Year citations
Counterexample-Guided Strategy Improvement for POMDPs Using Recurrent Neural Networks. IJCAI 2019 18
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT. SAT 2018 15
Finite-State Controllers of POMDPs using Parameter Synthesis. UAI 2018 0
From DQBF to QBF by Dependency Elimination. SAT 2017 10
Dependency Schemes for DQBF. SAT 2016 13
Preprocessing for DQBF. SAT 2015 23
Laissez-Faire Caching for Parallel #SAT Solving. SAT 2015 27
A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition. CADE 2013 20
Incremental QBF Preprocessing for Partial Design Verification - (Poster Presentation). SAT 2012 11
Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs. SAT 2010 18
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing. SAT 2009 18
Speedup Techniques Utilized in Modern SAT Solvers. SAT 2005 19
Early Conflict Detection Based BCP for SAT Solving. SAT 2004 14
Conflict-Based Selection of Branching Rules. SAT 2003 15
Copyright ©2019 Universit├Ąt W├╝rzburg

Impressum | Privacy | FAQ