Feder and Vardi showed that the class Monotone Monadic SNP without inequality (MMSNP) has a P vs NP-complete dichotomy if and only if such a dichotomy holds for finite-domain Constraint Satisfaction Problems. Moreover, they showed that none of the three classes obtained by removing one of the defining properties of MMSNP (monotonicity, monadicity, no inequality) has a dichotomy. The overall objective of this paper is to study the gaps between MMSNP and each of these three superclasses, where the existence of a dichotomy remains unknown. For the gap between MMSNP and Monotone SNP without inequality, we study the class Guarded Monotone SNP without inequality (GMSNP) introduced by Bienvenu, ten Cate, Lutz, and Wolter, and prove that GMSNP has a dichotomy if and only if a dichotomy holds for GMSNP problems over signatures consisting of a unique relation symbol. For the gap between MMSNP and MMSNP with inequality, we have two contributions. We introduce a new class MMSNP with guarded inequality, that lies between MMSNP and MMSNP with inequality and that is strictly more expressive than the former and still has a dichotomy. Apart from that, we give a detailed proof that every problem in NP is polynomial-time equivalent to a problem in MMSNP with inequality, which implies the absence of a dichotomy for the latter. For the gap between MMSNP and Monadic SNP without inequality, we introduce a logic that extends the class of Matrix Partitions in a similar way how MMSNP extends CSP, and pose an open question about the existence of a dichotomy for this class.

翻译：Feder和Vardi证明了：当且仅当有限域约束满足问题具有P与NP完全二分性时，无不等式的单调一元SNP类（MMSNP）才具有该二分性。此外，他们指出移除MMSNP三个定义属性（单调性、一元性、无不等式）中任意一个所得到的三个类别均不具有二分性。本文的核心目标是研究MMSNP与这三个超类之间的差异区域——这些区域是否存在二分性仍是未解之谜。针对MMSNP与无不等式的单调SNP之间的差异，我们研究了由Bienvenu、ten Cate、Lutz和Wolter提出的无不等式防护单调SNP类（GMSNP），并证明GMSNP具有二分性当且仅当在仅包含单一关系符号的签名上的GMSNP问题具有二分性。对于MMSNP与带不等式的MMSNP之间的差异，我们作出两项贡献：首先引入带防护不等式的新类别，该类别介于MMSNP与带不等式的MMSNP之间，其表达能力严格强于前者且仍保持二分性；其次，我们详细证明了NP中的每个问题都与带不等式的MMSNP中的某个问题具有多项式时间等价性，这直接推导出后者不存在二分性。关于MMSNP与无不等式的单子SNP之间的差异，我们提出一种逻辑扩展，该逻辑以类似MMSNP扩展CSP的方式扩展了矩阵划分类，并就该类别是否存在二分性提出了开放性问题。