[Back]

U. Egly, M. Kronegger, F. Lonsing, A. Pfandler:
"Conformant Planning as a Case Study of Incremental QBF Solving";
Talk: International Workshop on Quantified Boolean Formulas, Wien (invited); 07-13-2014.

We consider planning with uncertainty in the initial state as a case study of incremental quantified Boolean formula (QBF) solving. We report on experiments with a workflow to incrementally encode a planning instance into a sequence of QBFs. To solve this sequence of incrementally constructed QBFs, we use our general-purpose incremental QBF solver DepQBF. Since the generated QBFs have many clauses and variables in common, our approach avoids redundancy both in the encoding phase and in the solving phase. Experimental results show that incremental QBF solving outperforms non-incremental QBF solving. Our results are the first empirical study of incremental QBF solving in the context of planning. Based on our case study, we argue that incremental QBF solving also has the potential to improve QBF-based workflows in other application domains.

Project Head Uwe Egly:
Quantified Boolean Formulas

Project Head Reinhard Pichler:
Effiziente, parametrisierte Algorithmen in Künstlicher Intelligenz und logischem Schließen