DeepAI AI Chat
Log In Sign Up

NP Decision Procedure for Monomial and Linear Integer Constraints

08/04/2022
by   Rodrigo Raya, et al.
EPFL
proton mail
0

Motivated by satisfiability of constraints with function symbols, we consider numerical inequalities on non-negative integers. The constraints we consider are a conjunction of a linear system Ax = b and a conjunction of (non-)convex constraints of the form x_i >= x_j^n (x_i <= x_j^n). We show that the satisfiability of these constraints is NP-complete even if the solution to the linear part is given explicitly. As a consequence, we obtain NP completeness for an extension of certain quantifier-free constraints on sets with cardinalities (QFBAPA) with function images S = f[P^n].

READ FULL TEXT

page 1

page 2

page 3

page 4

06/01/1997

A Complete Classification of Tractability in RCC-5

We investigate the computational properties of the spatial algebra RCC-5...
09/11/2021

NP Satisfiability for Arrays as Powers

We show that the satisfiability problem for the quantifier-free theory o...
09/07/2017

The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence

Given a set U of alternatives, a choice (correspondence) on U is a contr...
04/23/2020

On the NP-Completeness of Satisfying Certain Path and Loop Puzzles

"Eye-Witless", "Haisu" and "Oriental House" are genres of logic puzzles ...
06/10/2021

Valued Authorization Policy Existence Problem: Theory and Experiments

Recent work has shown that many problems of satisfiability and resilienc...
11/06/2020

Accelerating combinatorial filter reduction through constraints

Reduction of combinatorial filters involves compressing state representa...