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 ...

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 ...

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

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 ...

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 ...

description [AAAI 2026][DQBF] This paper presents the first study of the model counting problem for Dependency Quantified Boolean Formulas (DQBF). It proves that #2-DQBF — restricted to only two ...

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 ...

Add a description, image, and links to the boolean-formulas topic page so that developers can more easily learn about it.