Franz Baader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi & Peter F. Patel-Schneider (2007):
The Description Logic Handbook: Theory, Implementation, and Applications,
second edition.
Cambridge University Press,
doi:10.1017/CBO9780511711787.
R. Berger (1966):
The undecidability of the domino problem,
pp. 1–72,
Mem. Amer. Math. Soc. 66.
American Mathematical Society,
doi:10.1007/978-3-540-69407-6_51.
Egon Börger, Erich Grädel & Yuri Gurevich (1997):
The Classical Decision Problem.
Perspectives in Mathematical Logic.
Springer.
Michael Breban, Alfredo Ferro, Eugenio G. Omodeo & Jacob T. Schwartz (1981):
Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions..
Communications on Pure and Applied Mathematics 34,
pp. 177–195,
doi:10.1002/cpa.3160340203.
Domenico Cantone, Alfredo Ferro & Eugenio Omodeo (1989):
Computable set theory.
International Series of Monographs on Computer Science 6.
Oxford Science Publications. Clarendon Press,
Oxford, UK.
Domenico Cantone, Cristiano Longo & Marianna Nicolosi Asmundo (2011):
A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics.
In: Marc Bezem: CSL 2011,
LIPIcs 12.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 129–143,
doi:10.4230/LIPIcs.CSL.2011.129.
Domenico Cantone, Cristiano Longo & Marianna Nicolosi Asmundo (2010):
A Decision Procedure for a Two-sorted Extension of Multi-Level Syllogistic with the Cartesian Product and Some Map Constructs.
In: Wolfgang Faber & Nicola Leone: CILC2010 : 25th Italian Conference on Computational Logic.
Domenico Cantone, Cristiano Longo & Antonio Pisasale (2010):
Comparing Description Logics with Multi-Level Syllogistics: the Description Logic DL"426830A MLSS_2,m^"526930B.
In: 6th Workshop on Semantic Web Applications and Perspectives (SWAP).
Domenico Cantone, Eugenio Omodeo & Alberto Policriti (2001):
Set theory for computing: From decision procedures to declarative programming with sets.
Monographs in Computer Science.
Springer-Verlag,
New York, NY, USA.
Domenico Cantone & Jacob T. Schwartz (1991):
Decision Procedures for Elementary Sublanguages of Set Theory: XI. Multilevel Syllogistic Extended by Some Elementary Map Constructs.
J. Autom. Reasoning 7(2),
pp. 231–256,
doi:10.1007/BF00243808.
Thomas Eiter, Georg Gottlob & Heikki Mannila (1997):
Disjunctive Datalog.
ACM Trans. Database Syst. 22(3),
pp. 364–418,
doi:10.1145/261124.261126.
Alfredo Ferro, Eugenio G. Omodeo & Jacob T. Schwartz (1980):
Decision Procedures for Elementary Sublanguages of Set Theory. I. Multi-level syllogistic and some extensions..
Comm. Pure Appl. Math. XXXIII(5),
pp. 599–608,
doi:10.1002/cpa.3160330503.
Alfredo Ferro, Eugenio G. Omodeo & Jacob T. Schwartz (1980):
Decision Procedures for Some Fragments of Set Theory.
In: Wolfgang Bibel & Robert A. Kowalski: CADE,
Lecture Notes in Computer Science 87.
Springer,
pp. 88–96,
doi:10.1007/3-540-10009-1_8.
Yiannis Moschovakis (2005):
Notes on Set Theory,
second edition.
Springer.
Boris Motik (2007):
On the Properties of Metamodeling in OWL.
J. Log. Comput. 17(4),
pp. 617–637,
doi:10.1093/logcom/exm027.
Eugenio Omodeo & Alberto Policriti (2010):
The Bernays-Schönfinkel-Ramsey Class for Set Theory: Semidecidability.
Journal of Symbolic Logic 75(2),
pp. 459–480,
doi:10.2178/jsl/1268917490.
Eugenio Omodeo & Alberto Policriti (2012):
The Bernays-Schönfinkel-Ramsey Class for Set Theory: Decidability.
Journal of Symbolic Logic, to appear.
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.
Jacob T. Schwartz, Robert B. K. Dewar, Edmond Schonberg & E Dubinsky (1986):
Programming with sets; an introduction to SETL.
Springer-Verlag New York, Inc.,
New York, NY, USA.
Christopher A. Welty & David A. Ferrucci (1994):
What's in an instance?.
Technical Report.
RPI Computer Science.
eptcs@eptcs.org