Backjumping for Quantified Boolean Logic satisfiability

Enrico Giunchiglia

doi:10.1016/S0004-3702(02)00373-9

2003-04-01

PRE

Enrico Giunchiglia

Massimo Narizzano

Armando Tacchella

DOI：10.1016/S0004-3702(02)00373-9

原文链接

原文求助

摘要

En 中文

The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many decision procedures have been proposed in the last few years, most of them based on the Davis, Logemann, Loveland procedure (DLL) for propositional satisfiability (SAT). In this paper we show how it is possible to extend the conflict-directed backjumping schema for SAT to the satisfiability of QBFs: When applicable, conflict-directed backjumping allows search to skip over existentially quantified literals while backtracking. We introduce solution-directed backjumping, which allows the same behavior for universally quantified literals. We show how it is possible to incorporate both conflict-directed and solution-directed backjumping in a DLL-based decision procedure for satisfiability of QBFs. We also implement and test the procedure: The experimental analysis shows that, because of backjumping, significant speed-ups can be obtained. Summing up: We present the first algorithm that applies conflict and solution directed backjumping to QBF, and demonstrate the performance of this algorithm via an empirical study. (C) 2002 Elsevier Science B.V. All rights reserved.

Keyword:

Quantified Boolean Logic

satisfiability testing

automated reasoning