K. Bansal, C. W. Barrett, A. Reynolds & C. Tinelli (2018):
Reasoning with Finite Sets and Cardinality Constraints in SMT.
Logical Methods in Computer Science 14(4),
pp. 1–31,
doi:10.23638/LMCS-14(4:12)2018.
C. Barrett, A. Stump & C. Tinelli (2010):
The Satisfiability Modulo Theories Library.
Available at http://www.smtlib.org.
M.P. Bonacina, S. Ghilardi, E. Nicolini, S. Ranise & D. Zucchelli (2006):
Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures.
In: U. Furbach & N. Shankar: Automated Reasoning. IJCAR 2006,
Lecture Notes in Computer Science 4130,
pp. 513–527,
doi:10.1007/11814771_42.
Aaron R. Bradley & Zohar Manna (2007):
The calculus of computation - decision procedures with applications to verification.
Springer,
doi:10.1007/978-3-540-74113-8.
D. Cantone, A. Ferro & J.T. Schwartz:
Decision procedures for elementary sublanguages of set theory. V: Multilevel syllogistic extended by the general union operator.
Journal of Computer and System Sciences 1,
pp. 1–18,
doi:10.1016/0022-0000(87)90001-8.
D. Cantone, J. T. Schwartz & A. Ferro:
Decision procedures for elementary sublanguages of set theory. VI. Multi-level syllogistic extended by the powerset operator.
Communications on Pure and Applied Mathematics 5,
pp. 549–571,
doi:10.1002/cpa.3160380507.
Domenico Cantone & Vincenzo Cutello (1989):
Decision procedures for elementary sublanguages of Set Theory. XVI. Multilevel syllogistic extended by singleton, rank comparison and unary intersection.
Bulletin of EATCS 39,
pp. 139–148.
Domenico Cantone, Andrea De Domenico, Pietro Maugeri & Eugenio G. Omodeo (2021):
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case.
Fundamenta Informaticae 181,
pp. 37–69,
doi:10.3233/fi-2021-2050.
Domenico Cantone, Alfredo Ferro & Eugenio G. Omodeo (1989):
Computable set theory.
International Series of Monographs on Computer Science, Oxford Science Publications 6.
Clarendon Press,
Oxford, UK,
doi:10.2307/2275351.
Domenico Cantone, Pietro Maugeri & Eugenio G. Omodeo:
Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership.
Theoretical Computer Science,
pp. 28–46,
doi:10.1016/j.tcs.2020.08.023.
Domenico Cantone, Eugenio G. Omodeo & Alberto Policriti (1990):
The Automation of Syllogistic. II: Optimization and Complexity Issues.
J. Autom. Reasoning 6(2),
pp. 173–187,
doi:10.1007/BF00245817.
Domenico Cantone, Eugenio G. Omodeo & Alberto Policriti (2001):
Set theory for computing - 101210\p@ plus2\p@ minus5\p@ \z@ plus3\p@ 6\p@ plus3\p@ minus3\p@ \defłeftmarginłeftmargini 2.5\p@ plus1.5\p@ minus\p@ 5\p@ plus2\p@ minus5\p@ıtemsep 2.5\p@ plus1.5\p@ minus\p@łeftmarginłeftmargini 6\p@ plus2\p@ minus2\p@ 3\p@ plus2\p@ minus\p@ıtemsep From decision procedures to declarative programming with sets.
Monographs in Computer Science.
Springer-Verlag,
New York,
doi:10.1007/978-1-4757-3452-2.
Domenico Cantone & Pietro Ursino (2018):
An Introduction to the Technique of Formative Processes in Set Theory.
Springer International Publishing,
doi:10.1007/978-3-319-74778-1.
Alfredo Ferro, Eugenio G. Omodeo & Jacob T. Schwartz (1980):
Decision Procedures for Elementary Sublanguages of Set Theory. I: Multilevel Syllogistic and Some Extensions..
Comm. Pure Appl. Math. 33,
pp. 599–608,
doi:10.1002/cpa.3160330503.
S. Ghilardi, E. Nicolini & D. Zucchelli (2005):
A Comprehensive Framework for Combined Decision Procedures.
In: B. Gramlich: Frontiers of Combining Systems (FroCoS 2005),
Lecture Notes in Computer Science 3717.
Springer, Berlin, Heidelberg,
pp. 1–30,
doi:10.1007/11559306_1.
G. Nelson & D.C. Oppen (1979):
Simplification by cooperating decision procedures.
ACM Transactions on Programming Languages and Systems 1(2),
pp. 245–257,
doi:10.1145/357073.357079.
S. Ranise, C. Ringeissen & C.G. Zarba (2005):
Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic.
In: B. Gramlich: Frontiers of Combining Systems (FroCoS 2005),
Lecture Notes in Computer Science 3717.
Springer, Berlin, Heidelberg,
pp. 48–64,
doi:10.1007/11559306_3.
Jacob T. Schwartz, Domenico Cantone & Eugenio G. Omodeo (2011):
Computational logic and set theory: Applying formalized logic to analysis.
Springer-Verlag,
doi:10.1007/978-0-85729-808-9.
Foreword by M. Davis.
Calogero G. Zarba:
Combining Multisets with Integers.
In: Andrei Voronkov: Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings,
Lecture Notes in Computer Science.
Springer,
pp. 363–376,
doi:10.1007/3-540-45620-1_30.
Calogero G. Zarba:
Combining Sets with Cardinals.
J. Autom. Reason. 1,
pp. 1–29,
doi:10.1007/s10817-005-3075-8.
Calogero G. Zarba:
Combining Sets with Integers.
In: Alessandro Armando: Frontiers of Combining Systems, 4th International Workshop, FroCoS 2002, Santa Margherita Ligure, Italy, April 8-10, 2002, Proceedings,
Lecture Notes in Computer Science.
Springer,
pp. 103–116,
doi:10.1007/3-540-45988-X_9.
eptcs@eptcs.org