DeepAI

AI Chat AI Image Generator AI Video AI Music Generator

Are You Satisfied by This Partial Assignment?

02/28/2020

∙

by Roberto Sebastiani, et al.

∙

∙

Many procedures for SAT and SAT-related problems – in particular for those requiring the complete enumeration of satisfying truth assignments – rely their efficiency on the detection of partial assignments satisfying an input formula. In this paper we analyze the notion of partial-assignment satisfiability – in particular when dealing with non-CNF and existentially-quantified formulas – raising a flag about the ambiguities and subtleties of this concept, and investigating their practical consequences. This may drive the development of more effective assignment-enumeration algorithms.

research

∙ 03/25/2019

Faster Random k-CNF Satisfiability

We describe an algorithm to solve the problem of Boolean CNF-Satisfiabil...

0 Andrea Lincoln, et al. ∙

research

∙ 03/27/2023

On CNF Conversion for SAT Enumeration

Modern SAT solvers are designed to handle problems expressed in Conjunct...

0 Gabriele Masina, et al. ∙

research

∙ 02/04/2000

On the accuracy and running time of GSAT

Randomized algorithms for deciding satisfiability were shown to be effec...

0 Deborah East, et al. ∙

research

∙ 06/26/2023

A Note On The Natural Range Of Unambiguous-SAT

We discuss the natural range of the Unambiguous-SAT problem with respect...

0 Tayfun Pay, et al. ∙

research

∙ 11/04/2020

A Multistage View on 2-Satisfiability

We study q-SAT in the multistage model, focusing on the linear-time solv...

0 Till Fluschnik, et al. ∙

research

∙ 05/10/2018

Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect

We consider the computational complexity of reconfiguration problems, in...

0 Jean Cardinal, et al. ∙

research

∙ 07/25/2019

Introducing Autarkies for DQCNF

Autarkies for SAT can be used for theoretical studies, pre-processing an...

0 Oliver Kullmann, et al. ∙