Alloy is a automatically analyzable modelling language based on first-order logic. An Alloy model can be translated into a Boolean formula whose satisfying assignments correspond to instances in the model. Currently, the translation procedure mechanically converts each piece of the Alloy model individually into its most straightforward Boolean representation. This thesis proposes a more efficie...

This article describes the Boolean satisfiability method for generating test patterns for single stuck-at faults in combinational circuits. This new method generates test patterns in two steps: First, it constructs a formula expressing the Boolean diference between the unfaulted and faulted circuits. Second, it applies a Boolean satisjiability algorithm to the resulting formula. This approach d...

In this paper we report about the 2016 competitive evaluation of quantified Boolean formulas (QBFs) solvers (QBFEVAL’16), the last in a series of events established with the aim of assessing the advancements in reasoning about QBFs. Aim of this preliminary report is to show at a glance design and results of QBFEVAL’16.

In this paper we describe aqme’10, the version of the Adaptive QBF Multi-Engine submitted to QBFEVAL’10.

In this paper we describe aqme’10, the version of the Adaptive QBF Multi-Engine submitted to QBFEVAL’10.

The practical use of Quantified Boolean Formulas (QBFs) often calls for more than solving the evaluation problem QBF. For this reason we investigate the corresponding function problem FQBF. We define expected outputs of FQBF instances as solution policies. We focus on the representation of policies, considering QBFs of the form ∀X ∃Y Φ. Because the explicit representation of policies for such Q...

The groundbreaking paper ‘Short proofs are narrow – resolution made simple’ by Ben-Sasson and Wigderson (J. ACM 2001) introduces what is today arguably the main technique to obtain resolution lower bounds: to show a lower bound for the width of proofs. Another important measure for resolution is space, and in their fundamental work, Atserias and Dalmau (J. Comput. Syst. Sci. 2008) show that spa...

This article describes the Boolean satis ability method for generating test patterns for single stuck at faults in combinational circuits This new method generates test patterns in two steps First it constructs a formula expressing the Boolean di erence between the unfaulted and faulted circuits Second it applies a Boolean satis ability algorithm to the resulting formula This approach di ers fr...

The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula value problem is complete for alternating log time under deterministic log time reductions. Consequently, i...

It is known that any self-dual Boolean function can be decomposed into compositions of 3-bit majority functions. In this paper, we define a notion of a ternary majority formula, which is a ternary tree composed of nodes labeled by 3-bit majority functions and leaves labeled by literals. We study their complexity in terms of formula size. In particular, we prove upper and lower bounds for ternar...