AMSNP: a tame fragment of existential second-order logic

01/22/2020
by   Manuel Bodirsky, et al.
0

Amalgamation monotone SNP (AMSNP) is a fragment of existential second-order logic that strictly contains the logics (connected) MMSNP of Feder and Vardi and guarded monotone SNP of Bienvenu, ten Cate, Lutz, and Wolter; it is a promising candidate for an expressive subclass of NP that exhibits a complexity dichotomy. We show that AMSNP has a complexity dichotomy if and only if Constraint Satisfaction Problems for reducts of finitely bounded homogeneous structures have a complexity dichotomy. For such CSPs, powerful universal-algebraic hardness conditions are known that are conjectured to describe the border between NP-hard and polynomial-time tractable CSPs. The connection to CSPs also implies that every AMSNP sentence can be evaluated in polynomial time on classes of finite structures of bounded treewidth. We show that the syntax of AMSNP is decidable. The proof relies on the following fact, which we believe is of independent interest in model theory: for classes of finite structures given by finitely many forbidden substructures, the amalgamation property is decidable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/22/2020

ASNP: a tame fragment of existential second-order logic

Amalgamation SNP (ASNP) is a fragment of existential second-order logic ...
research
02/09/2023

Hardness of monadic second-order formulae over succinct graphs

Our main result is a succinct counterpoint to Courcelle's meta-theorem a...
research
02/09/2018

A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP

The logic MMSNP is a restricted fragment of existential second-order log...
research
02/27/2018

Finding steady-state solutions for ODE systems of zero, first and homogeneous second-order chemical reactions is NP-hard

In the context of modeling of cell signaling pathways, a relevant step i...
research
03/15/2021

Approximation metatheorem for fractionally treewidth-fragile graphs

Baker's technique is a powerful tool for designing polynomial-time appro...
research
05/27/2022

Choiceless Polynomial Time with Witnessed Symmetric Choice

We extend Choiceless Polynomial Time (CPT), the currently only remaining...
research
09/28/2009

On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction

The universal-algebraic approach has proved a powerful tool in the study...

Please sign up or login with your details

Forgot password? Click here to reset