On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework

@article{Cantone2021OnTC,
  title={On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework},
  author={Domenico Cantone and Andrea De Domenico and Pietro Maugeri},
  journal={ArXiv},
  year={2021},
  volume={abs/2109.08309}
}
The Satisfiability Modulo Theories (SMT) issue concerns the satisfiability of formulae from multiple background theories, usually expressed in the language of first-order predicate logic with equality. SMT solvers are often based on variants of the Nelson-Oppen combination method, a solver for the quantifier-free fragment of the combination of theories with disjoint signatures, via cooperation among their decision procedures. When each of the theories to be combined by the Nelson-Oppen method… 

References

SHOWING 1-10 OF 23 REFERENCES

Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures

The Nelson-Oppen decidability transfer result is strengthened, by showing that it applies to theories over disjoint signatures, whose satisfiability problem, in either arbitrary or infinite models, is decidable.

A Comprehensive Framework for Combined Decision Procedures

A procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen schema, and the procedure becomes terminating and complete when the shared fragment enjoys suitable noetherianity conditions and allows an abstract version of a ‘Keisler-Shelah like’ isomorphism theorem.

Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case

This paper provides a complete taxonomy of the polynomial and the NP-complete fragments of set theory, besides variables intended to range over the von Neumann set-universe, involving the Boolean operators, the Boolean relators, and the predicates.

The automation of syllogistic

A new and improved searching algorithm for syllogistic schemes is introduced, based on a proof of existence of a ‘minimum effort’ scheme for any given satisfiable formula in MLSF, and complexity issues are studied.

A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT

A novel technique wherein potentially overlapping regions are considered incrementally as needed and a graph is used to track the interaction among the different regions, which demonstrates that the new technique is competitive with previous techniques and scales much better on certain classes of problems.

Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic

This paper provides a method that is able to combine a polite theory S with any theory T of the elements, regardless of whether T is stably infinite or not, and generalize to many-sorted logic.

Decision procedures for elementary sublanguages of set theory

It is proved the decidability of the class of unquantified formulae of set theory involving the operators ϕ, ∪, ∩, \, {·}, pred< and the predicates is proved.

Combining Sets with Cardinals

  • C. G. Zarba
  • Mathematics, Computer Science
    Journal of Automated Reasoning
  • 2005
We introduce a quantifier-free set-theoretic language for combining sets with elements in the presence of the cardinality operator. We prove that the language is decidable by providing a combination

Computational Logic and Set Theory - Applying Formalized Logic to Analysis

This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating