Positive Planar Satisfiability Problems under 3-Connectivity Constraints

08/27/2021
by   Md. Manzurul Hasan, et al.
0

A 3-SAT problem is called positive and planar if all the literals are positive and the clause-variable incidence graph (i.e., SAT graph) is planar. The NAE 3-SAT and 1-in-3-SAT are two variants of 3-SAT that remain NP-complete even when they are positive. The positive 1-in-3-SAT problem remains NP-complete under planarity constraint, but planar NAE 3-SAT is solvable in O(n^1.5log n) time. In this paper we prove that a positive planar NAE 3-SAT is always satisfiable when the underlying SAT graph is 3-connected, and a satisfiable assignment can be obtained in linear time. We also show that without 3-connectivity constraint, existence of a linear-time algorithm for positive planar NAE 3-SAT problem is unlikely as it would imply a linear-time algorithm for finding a spanning 2-matching in a planar subcubic graph. We then prove that positive planar 1-in-3-SAT remains NP-complete under the 3-connectivity constraint, even when each variable appears in at most 4 clauses. However, we show that the 3-connected planar 1-in-3-SAT is always satisfiable when each variable appears in an even number of clauses.

READ FULL TEXT
research
08/14/2019

Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy

The complexity of variants of 3-SAT and Not-All-Equal 3-SAT is well stud...
research
05/06/2022

Defying Gravity: The Complexity of the Hanano Puzzle

Liu and Yang [LY19] recently proved the Hanano Puzzle to be NP-≤_m^p-har...
research
08/12/2019

On simplified NP-complete variants of Not-All-Equal 3-Sat and 3-Sat

We consider simplified, monotone versions of Not-All-Equal 3-Sat and 3-S...
research
10/20/2017

Planar 3-SAT with a Clause/Variable Cycle

In a Planar 3-SAT problem, we are given a 3-SAT formula together with it...
research
12/06/2010

URSA: A System for Uniform Reduction to SAT

There are a huge number of problems, from various areas, being solved by...
research
04/13/2023

The Longest Subsequence-Repeated Subsequence Problem

Motivated by computing duplication patterns in sequences, a new fundamen...
research
12/17/2019

Monotone 3-Sat-(2,2) is NP-complete

We show that Monotone 3-Sat remains NP-complete if (i) each clause conta...

Please sign up or login with your details

Forgot password? Click here to reset