4 papers · 1 filter
Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae
Domenico Cantone, Andrea De Domenico, Pietro Maugeri +1
As a contribution to quantitative set-theoretic inferencing, a translation is proposed of conjunctions of literals of the forms , , and $z =\{x…
On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework
Domenico Cantone, Andrea De Domenico, Pietro Maugeri
The Satisfiability Modulo Theories (SMT) issue concerns the satisfiability of formulae from multiple background theories, usually expressed in the language of first-order predicate…
Decidability of the satisfiability problem for Boolean set theory with the unordered Cartesian product operator
Domenico Cantone, Pietro Ursino
The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was…
Hilbert's Tenth problem and NP-completeness of Boolean Syllogistic with unordered cartesian product
Domenico Cantone, Pietro Ursino
We relate the decidability problem for BS with unordered cartesian product with Hilbert's Tenth problem and prove that BS with unordered cartesian product is NP-complete.