Quantified Boolean Formulas

View Statistics Email Alert RSS Feed

Primary Data

Project Acronym Projekt Kurzbezeichnung
Boolean
 
Project Title (de) Projekttitel (de)
Quantified Boolean Formulas
 
Project Title (en) Projekttitel (en)
Quantified Boolean Formulas
 
Consortium Coordinator Koordinator des Konsortiums
 
Principal Investigator Projektleiter_in
 

Grants

Funder/Funding Agency Fördergeber
FWF Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
Grant number Förderkennnummer
S 11409-N23
 

Publications

Results 21-40 of 55 (Search time: 0.004 seconds).

PreviewAuthors / EditorsTitleTypeIssue Date
21Lonsing, Florian ; Bacchus, Fahiem ; Biere, Armin ; Egly, Uwe ; Seidl, Martina Enhancing Search-Based QBF Solving by Dynamic Blocked Clause EliminationKonferenzbeitrag Inproceedings 2015
22Heule, Marijn ; Järvisalo, Matti ; Lonsing, Florian ; Seidl, Martina ; Biere, Armin Clause Elimination for SAT and QSATArtikel Article 2015
23Kaufmann, Petra ; Kronegger, Martin ; Pfandler, Andreas ; Seidl, Martina ; Widl, Magdalena A SAT-Based Debugging Tool for State Machines and Sequence DiagramsKonferenzbeitrag Inproceedings 2014
24Lonsing, Florian Search-Based QBF SolvingPräsentation Presentation2014
25Egly, Uwe Deduction Concepts for Quantified Boolean FormulasPräsentation Presentation2014
26Egly, Uwe Quantifier Handling in Different Calculi for Quantified Boolean FormulasPräsentation Presentation2014
27Egly, Uwe On the Relation between Resolution Calculi for QBFs and First-order FormulasPräsentation Presentation2014
28Egly, Uwe Quantifier handling in calculi for quantified Boolean formulasPräsentation Presentation2014
29Egly, Uwe ; Kronegger, Martin ; Lonsing, Florian ; Pfandler, Andreas Conformant Planning as a Case Study of Incremental QBF SolvingPräsentation Presentation2014
30Jordan, Charles ; Kaiser, Lukasz ; Lonsing, Florian ; Seidl, Martina MPIDepQBF: Towards Parallel QBF Solving without Knowledge SharingKonferenzbeitrag Inproceedings 2014
31Lonsing, Florian Incremental QBF SolvingPräsentation Presentation2014
32Lonsing, Florian ; Egly, Uwe Incremental QBF SolvingKonferenzbeitrag Inproceedings 2014
33Lonsing, Florian ; Egly, Uwe Incremental QBF Solving by DepQBFKonferenzbeitrag Inproceedings2014
34Bloem, Roderick ; Egly, Uwe ; Klampfl, Patrick ; Könighofer, Robert ; Lonsing, Florian SAT-Based Methods for Circuit SynthesisKonferenzbeitrag Inproceedings 2014
35Creignou, Nadia ; Egly, Uwe ; Schmidt, Johannes Complexity Classifications for Logic-Based ArgumentationArtikel Article2014
36Widl, Magdalena ; Musliu, Nysret The break scheduling problem: complexity results and practical algorithmsArtikel Article2014
37Balabanov, Valeriy ; Widl, Magdalena ; Jiang, Jie-Hong R. QBF Resolution Systems and Their Proof ComplexitiesKonferenzbeitrag Inproceedings 2014
38Sinz, Carsten ; Egly, Uwe Theory and Applications of Satisfiability Testing – SAT 2014Konferenzband Proceedings2014
39Egly, Uwe ; Kronegger, Martin ; Lonsing, Florian ; Pfandler, Andreas Conformant Planning as a Case Study of Incremental QBF SolvingKonferenzbeitrag Inproceedings 2014
40Balabanov, Valeriy ; Jiang, Jie-Hong R. ; Janota, Mikolás ; Widl, Magdalena Efficient Extraction of QBF (Counter)models from Long-Distance Resolution ProofsKonferenzbeitrag Inproceedings 2014