150 citations · 275 across the 41 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.LO2017
QFUN: Towards Machine Learning in QBF
Mikoláš Janota
This paper reports on the QBF solver QFUN that has won the non-CNF track in the recent QBF evaluation. The solver is motivated by the fact that it is easy to construct Quantified B…
cs.LO2017★ 3 cited
On the Quest for an Acyclic Graph
Mikolas Janota, Radu Grigore, Vasco Manquinho
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula ϕ over edges of a fixed-size graph, the objective is to…
cs.LO2017★ 1 cited
An Achilles' Heel of Term-Resolution
Mikoláš Janota
Term-resolution provides an elegant mechanism to prove that a quantified Boolean formula (QBF) is true. It is a dual to Q-resolution (also referred to as clause-resolution) and is…