Set theory for computing: from decision procedures to declarative programming with sets

Formative processes with applications to the decision problem in set theory I: powerset and singleton operators

Information and Computation

Alternative Translation Techniques for Propositional and First-Order Modal Logics

Journal of Automated Reasoning

Algebraic Semantics of ER-Models in the Context of the Calculus of Relations. II: Dynamic View

ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science

An efficient algorithm for computing bisimulation equivalence

Theoretical Computer Science

A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions, I: The Two-Level Case

Journal of Automated Reasoning

A Tableau-Based Decision Procedure for a Fragment of Set Theory with Iterated Membership

Journal of Automated Reasoning

Combining Sets with Cardinals

Journal of Automated Reasoning

Decidability results for sets with atoms

ACM Transactions on Computational Logic (TOCL)

Set unification

Theory and Practice of Logic Programming

A uniform approach to constraint-solving for lists, multisets, compact lists, and sets

ACM Transactions on Computational Logic (TOCL)

Theory-specific automated reasoning

A 25-year perspective on logic programming

A computerized referee

Reasoning, Action and Interaction in AI Theories and Systems

Set graphs. I. Hereditarily finite sets and extensional acyclic orientations

Discrete Applied Mathematics

On the Satisfiability Problem for a 4-level Quantified Syllogistic and Some Applications to Modal Logic

Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011