In this paper, we consider two types of promises for (k-)CNF formulas which can help to find a satisfying assignment of a given formula. The first promise is the Hamming distance between truth assignments. Namely, we know in advance that a k-CNF formula with n variables, if satisfiable, has a satisfying assignment with at most pn variables set to 1. Then we ask whether or not the formula is satisfiable. It is shown that for k
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kazuo IWAMA, Akihiro MATSUURA, "Solving SAT Efficiently with Promises" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 2, pp. 213-218, February 2003, doi: .
Abstract: In this paper, we consider two types of promises for (k-)CNF formulas which can help to find a satisfying assignment of a given formula. The first promise is the Hamming distance between truth assignments. Namely, we know in advance that a k-CNF formula with n variables, if satisfiable, has a satisfying assignment with at most pn variables set to 1. Then we ask whether or not the formula is satisfiable. It is shown that for k
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_2_213/_p
Copy
@ARTICLE{e86-d_2_213,
author={Kazuo IWAMA, Akihiro MATSUURA, },
journal={IEICE TRANSACTIONS on Information},
title={Solving SAT Efficiently with Promises},
year={2003},
volume={E86-D},
number={2},
pages={213-218},
abstract={In this paper, we consider two types of promises for (k-)CNF formulas which can help to find a satisfying assignment of a given formula. The first promise is the Hamming distance between truth assignments. Namely, we know in advance that a k-CNF formula with n variables, if satisfiable, has a satisfying assignment with at most pn variables set to 1. Then we ask whether or not the formula is satisfiable. It is shown that for k
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Solving SAT Efficiently with Promises
T2 - IEICE TRANSACTIONS on Information
SP - 213
EP - 218
AU - Kazuo IWAMA
AU - Akihiro MATSUURA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2003
AB - In this paper, we consider two types of promises for (k-)CNF formulas which can help to find a satisfying assignment of a given formula. The first promise is the Hamming distance between truth assignments. Namely, we know in advance that a k-CNF formula with n variables, if satisfiable, has a satisfying assignment with at most pn variables set to 1. Then we ask whether or not the formula is satisfiable. It is shown that for k
ER -