DeepAI AI Chat
Log In Sign Up

Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae

by   Domenico Cantone, et al.
University of Catania
University of Trieste

As a contribution to quantitative set-theoretic inferencing, a translation is proposed of conjunctions of literals of the forms x=y∖ z, x ≠ y∖ z, and z ={x}, where x,y,z stand for variables ranging over the von Neumann universe of sets, into unquantified Boolean formulae of a rather simple conjunctive normal form. The formulae in the target language involve variables ranging over a Boolean ring of sets, along with a difference operator and relators designating equality, non-disjointness and inclusion. Moreover, the result of each translation is a conjunction of literals of the forms x=y∖ z, x≠ y∖ z and of implications whose antecedents are isolated literals and whose consequents are either inclusions (strict or non-strict) between variables, or equalities between variables. Besides reflecting a simple and natural semantics, which ensures satisfiability-preservation, the proposed translation has quadratic algorithmic time-complexity, and bridges two languages both of which are known to have an NP-complete satisfiability problem.


page 1

page 2

page 3

page 4


Complexity of the CNF-satisfiability problem

This paper is devoted to the complexity of the Boolean satisfiability pr...

NP Decision Procedure for Monomial and Linear Integer Constraints

Motivated by satisfiability of constraints with function symbols, we con...

Towards a more efficient approach for the satisfiability of two-variable logic

We revisit the satisfiability problem for two-variable logic, denoted by...

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...

Exact Synthesis of ESOP Forms

We present an exact synthesis approach for computing Exclusive-or Sum-of...

One-dimensional guarded fragments

We call a first-order formula one-dimensional if its every maximal block...

On SAT representations of XOR constraints

We study the representation of systems S of linear equations over the tw...