On Enumerating Short Projected Models

10/22/2021
by   Sibylle Möhle, et al.
0

Propositional model enumeration, or All-SAT, is the task to record all models of a propositional formula. It is a key task in software and hardware verification, system engineering, and predicate abstraction, to mention a few. It also provides a means to convert a CNF formula into DNF, which is relevant in circuit design. While in some applications enumerating models multiple times causes no harm, in others avoiding repetitions is crucial. We therefore present two model enumeration algorithms, which adopt dual reasoning in order to shorten the found models. The first method enumerates pairwise contradicting models. Repetitions are avoided by the use of so-called blocking clauses, for which we provide a dual encoding. In our second approach we relax the uniqueness constraint. We present an adaptation of the standard conflict-driven clause learning procedure to support model enumeration without blocking clauses.Our procedures are expressed by means of a calculus and proofs of correctness are provided.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/04/2017

A Data-Centric View on Computational Complexity: P = NP

P = NP SAT ∈ P. We propose this to be true because the satisfiability ...
10/07/2009

Integrating Conflict Driven Clause Learning to Local Search

This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid appro...
02/22/2022

A Heuristic Proof Procedure for Propositional Logic

Theorem proving is one of the oldest applications which require heuristi...
05/04/2021

A Subatomic Proof System for Decision Trees

We design a proof system for propositional classical logic that integrat...
03/31/2018

Efficient Encodings of Conditional Cardinality Constraints

In the encoding of many real-world problems to propositional satisfiabil...
10/09/2017

Verification of Binarized Neural Networks

We study the problem of formal verification of Binarized Neural Networks...
02/14/2019

Checking Observational Purity of Procedures

Verifying whether a procedure is observationally pure is useful in many ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.