1 Hit in 5.9 sec

Preprocessing in higher-order reasoning : learning from QBF solving

Hans Jörg Schurr, Alexander Leitsch
Constant extraction uses a SAT solver to find literals necessary implied by the problem and adds them as a unit clause.  ...  Quantified Boolean Formulas (QBF), on the other hand, are an extension of propositional logic with explicit quantification over truth values. The validity of QBFs is, in contrast to HOL, decidable.  ...  problem into an internal Sᴀᴛ-ᴛᴏ-Sᴀᴛ format while applying various transformations and a structure extraction algorithm.Then the Sᴀᴛ-ᴛᴏ-Sᴀᴛ solver is called.This tool is a general purpose Sᴀᴛ solver that  ... 
doi:10.34726/hss.2017.36282 fatcat:fvuzvijsljbmfas2tpu3ynpsbm