Abstract: Several algorithms are presented, more or less directly related to the "minimization" theory of Boolean formulas. They give solutions to the following specific problems: computation of the ...

Accepts formulas in an (almost) SMT-LIBv2 format, see full details below. Tested and compared against Z3 over more than four million random formulas. Surprisingly, it is quite faster than Z3 on short ...

Quantified Boolean formulas (QBFs) extend propositional logic by interleaving existential and universal quantifiers over Boolean variables, providing a natural framework for expressing problems in ...

The explosion in artificial intelligence (AI) and machine learning applications is permeating nearly every industry and slice of life. But its growth does not come without irony. While AI exists to ...

This document defines the QAIGER format to represent quantified Boolean formulas (QBF) and their certificates based on the popular AIGER format. AIGER is a simple circuit format that comes with ...

Abstract: We present a method for translating Boolean formulas to CNF by identifying gates with fanout count of 1, and merging them with their fanout gate to generate a single set of equivalent CNF ...

Weighted Model counting (WMC) is a fundamental problem in computer science with a wide variety of applications in practice, ranging from neural network verification to network reliability. The current ...

Computing circuits composed of noisy logical gates and their ability to represent arbitrary boolean functions with a given level of error are investigated within a ...

Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver to solve the ...