Found 6 Documents (Results 1–6)
Solving QBF by abstraction. (English) Zbl 1528.68223
Orlandini, Andrea (ed.) et al., Proceedings of the ninth international symposium on games, automata, logics, and formal verification, GandALF 2018, Saarbrücken, Germany, September 26–28, 2018. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 277, 88-102 (2018).
Circuit-based search space pruning in QBF. (English) Zbl 1511.68251
Beyersdorff, Olaf (ed.) et al., Theory and applications of satisfiability testing – SAT 2018. 21st international conference, SAT 2018, held as part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9–12, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10929, 187-198 (2018).
MSC:
68T20
Q-resolution with generalized axioms. (English) Zbl 1475.68442
Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9710, 435-452 (2016).
Non-prenex QBF solving using abstraction. (English) Zbl 1475.68224
Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9710, 393-401 (2016).
Filter Results by …
Document Type
- Journal Articles (2)
- Collection Articles (4)
all
top 5
Author
- Seidl, Martina (3)
- Egly, Uwe (2)
- Lonsing, Florian (2)
- Tentrup, Leander (2)
- Bloem, Roderick (1)
- Braud-Santoni, Nicolas (1)
- Hadzic, Vedad (1)
- Hecking-Harbusch, Jesko (1)
- Janota, Mikoláš (1)
- Pulina, Luca (1)
