Are You Satisfied by This Partial Assignment?
Logic in Computer Science
2020-03-10 v1 Artificial Intelligence
Abstract
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.
Cite
@article{arxiv.2003.04225,
title = {Are You Satisfied by This Partial Assignment?},
author = {Roberto Sebastiani},
journal= {arXiv preprint arXiv:2003.04225},
year = {2020}
}