Generalizing Boolean Satisfiability III: Implementation

by   H. E. Dixon, et al.

This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal has been to define a representation in which this structure is apparent and can be exploited to improve computational performance. The first paper surveyed existing work that (knowingly or not) exploited problem structure to improve the performance of satisfiability engines, and the second paper showed that this structure could be understood in terms of groups of permutations acting on individual clauses in any particular Boolean theory. We conclude the series by discussing the techniques needed to implement our ideas, and by reporting on their performance on a variety of problem instances.


page 1

page 2

page 3

page 4


Generalizing Boolean Satisfiability I: Background and Survey of Existing Work

This is the first of three planned papers describing ZAP, a satisfiabili...

Generalizing Boolean Satisfiability II: Theory

This is the second of three planned papers describing ZAP, a satisfiabil...

Graph Neural Networks and Boolean Satisfiability

In this paper we explore whether or not deep neural architectures can le...

Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits

Machine learning (ML) techniques have been proposed to automatically sel...

A Probabilistic Approach to Satisfiability of Propositional Logic Formulae

We propose a version of WalkSAT algorithm, named as BetaWalkSAT. This me...

Non-Invasive Reverse Engineering of Finite State Machines Using Power Analysis and Boolean Satisfiability

In this paper, we present a non-invasive reverse engineering attack base...

On Validating Boolean Optimizers

Boolean optimization finds a wide range of application domains, that mot...

Please sign up or login with your details

Forgot password? Click here to reset