Domenico Cantone

Intelligenza Artificiale, 2022

The ontology for agents, systems and integration of services: recent advancements of OASIS.

[BibT_eX]

[DOI]

Proceedings of the 23rd Workshop "From Objects to Agents", 2022

2021

Choice resolutions.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2021

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4, ×.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2021

Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae.

[BibT_eX]

[DOI]

CoRR, 2021

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

[BibT_eX]

[DOI]

Andrea De Domenico

Proceedings of the Proceedings 12th International Symposium on Games, 2021

Blockchains through ontologies: the case study of the Ethereum ERC721 standard in OASIS (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2021

Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations.

[BibT_eX]

[DOI]

CoRR, 2021

Resolutions of Convex Geometries.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

The ideal Benedictine Monastery: From the Saint Gall map to ontologies.

[BibT_eX]

[DOI]

Claudia Cantale

Manuela Lupica Rinato

Maria Rosaria Stufano Melone

Appl. Ontology, 2021

SW-CASPAR: Reactive-Cognitive Architecture based on Natural Language Processing for the task of Decision-Making in the Open-World Assumption.

[BibT_eX]

[DOI]

Proceedings of the 22nd Workshop "From Objects to Agents", 2021

Ontological Smart Contracts in OASIS: Ontology for Agents, Systems, and Integration of Services.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Distributed Computing XIV, 2021

Blockchains Through Ontologies: The Case Study of the Ethereum ERC721 Standard in oasis.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Distributed Computing XIV, 2021

Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages.

[BibT_eX]

[DOI]

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

A Decidable Theory Treating Addition of Differentiable Real Functions.

[BibT_eX]

[DOI]

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

Semantic Representation as a Key Enabler for Blockchain-Based Commerce.

[BibT_eX]

[DOI]

Proceedings of the Economics of Grids, Clouds, Systems, and Services, 2021

Very Weak, Essentially Undecidabile Set Theories.

[BibT_eX]

[DOI]

Mattia Panettiere

Proceedings of the 36th Italian Conference on Computational Logic, 2021

2020

Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

A Set-theoretic Approach to Reasoning Services for the Description Logic 𝒟ℒD4, ×.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

The order-preserving pattern matching problem in practice.

[BibT_eX]

[DOI]

M. Oguzhan Külekci

Discret. Appl. Math., 2020

Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations.

[BibT_eX]

[DOI]

Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

Bit-Layers Text Encoding for Efficient Text Processing.

[BibT_eX]

[DOI]

Stefano Scafiti

Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), 2020

From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory.

[BibT_eX]

[DOI]

Mattia Panettiere

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

Shape-Preserving Pattern Matching.

[BibT_eX]

[DOI]

M. Oguzhan Külekci

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

An Ontology for the Iconographic Sources of La Divina Commedia.

[BibT_eX]

[DOI]

Andrea De Domenico

Proceedings of the 35th Italian Conference on Computational Logic, 2020

A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF.

[BibT_eX]

[DOI]

Proceedings of the 35th Italian Conference on Computational Logic, 2020

A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals.

[BibT_eX]

[DOI]

Proceedings of the 35th Italian Conference on Computational Logic, 2020

2019

Congruence relations on a choice space.

[BibT_eX]

[DOI]

Soc. Choice Welf., 2019

Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Towards an Ontology-Based Framework for a Behavior-Oriented Integration of the IoT.

[BibT_eX]

[DOI]

Proceedings of the 20th Workshop "From Objects to Agents", 2019

A Potential-Based Variant of the Bellman-Ford Algorithm.

[BibT_eX]

[DOI]

Stefano Scafiti

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Polynomial-Time Satisfiability Tests for 'Small' Membership Theories.

[BibT_eX]

[DOI]

Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory.

[BibT_eX]

[DOI]

Proceedings of the 34th Italian Conference on Computational Logic, 2019

Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation?

[BibT_eX]

[DOI]

Proceedings of the 34th Italian Conference on Computational Logic, 2019

2018

Games, automata, logics and formal verification (GandALF 2016).

[BibT_eX]

[DOI]

Giorgio Delzanno

Inf. Comput., 2018

Encoding Sets as Real Numbers (Extended version).

[BibT_eX]

[DOI]

CoRR, 2018

A set-based reasoner for the description logic \shdlssx (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2018

An optimized KE-tableau-based system for reasoning in the description logic \shdlssx.

[BibT_eX]

[DOI]

CoRR, 2018

A Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2018

Encoding Sets as Real Numbers.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Sets and Tools co-located with the 6th International ABZ Conference, 2018

A Set-Based Reasoner for the Description Logic DL4, xD.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Workshop on Sets and Tools co-located with the 6th International ABZ Conference, 2018

An Optimized KE-Tableau-Based System for Reasoning in the Description Logic $${\mathcal {DL}}_{{\mathbf {D}}}^{4, \!\times }$$.

[BibT_eX]

[DOI]

Proceedings of the Rules and Reasoning - Second International Joint Conference, 2018

Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation?

[BibT_eX]

[DOI]

Proceedings of the 33rd Italian Conference on Computational Logic, 2018

An Introduction to the Technique of Formative Processes in Set Theory

[BibT_eX]

[DOI]

Springer, ISBN: 978-3-319-74777-4, 2018

2017

Herbrand-satisfiability of a Quantified Set-theoretic Fragment.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

The satisfiability problem for Boolean set theory with a choice correspondence (Extended version).

[BibT_eX]

[DOI]

CoRR, 2017

A \textsf{C++} reasoner for the description logic $\shdlssx$.

[BibT_eX]

[DOI]

CoRR, 2017

A set-theoretical approach for ABox reasoning services (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2017

Speeding Up String Matching by Weak Factor Recognition.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2017, 2017

A Set-Theoretic Approach to ABox Reasoning Services.

[BibT_eX]

[DOI]

Proceedings of the Rules and Reasoning - International Joint Conference, 2017

The Shape of a Benedictine Monastery: The SaintGall Ontology.

[BibT_eX]

[DOI]

Claudia Cantale

Manuela Lupica Rinato

Proceedings of the Joint Ontology Workshops 2017 Episode 3: The Tyrolean Autumn of Ontology, 2017

A C++ Reasoner for the Description Logic DL-4X(D).

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2016

Conjunctive Query Answering via a Fragment of Set Theory (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2016

An OWL Framework for Rule-based Recognition of Places in Italian Non-structured Text.

[BibT_eX]

[DOI]

Andrea Fornaia

Emiliano Tramontana

Proceedings of the 2nd International Workshop on Knowledge Discovery on the WEB, 2016

A Variant of Turing Machines with no Control States and its Connection to Bounded Temporal Memory.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Conjunctive Query Answering via a Fragment of Set Theory.

[BibT_eX]

[DOI]

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

Banishing Ultrafilters from Our Consciousness.

[BibT_eX]

[DOI]

Proceedings of the Martin Davis on Computability, 2016

2015

Computing Efficiently the Closeness of Word Sets in Natural Language Texts.

[BibT_eX]

[DOI]

Giuseppe Pappalardo

Int. J. Comput. Linguistics Appl., 2015

The Decision Problem for a Three-sorted Fragment of Set Theory with Restricted Quantification and Finite Enumerations.

[BibT_eX]

[DOI]

Proceedings of the 16th Italian Conference on Theoretical Computer Science, 2015

An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem.

[BibT_eX]

[DOI]

M. Oguzhan Külekci

Proceedings of the Prague Stringology Conference 2015, 2015

Web Ontology Representation and Reasoning via Fragments of Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Web Reasoning and Rule Systems - 9th International Conference, 2015

Ontoceramic: an OWL ontology for ceramics classification.

[BibT_eX]

[DOI]

Francesca Trapani

Proceedings of the 30th Italian Conference on Computational Logic, 2015

2014

A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A combined greedy-walk heuristic and simulated annealing approach for the closest string problem.

[BibT_eX]

[DOI]

Elisa Pappalardo

Panos M. Pardalos

Optim. Methods Softw., 2014

Improved and self-tuned occurrence heuristics.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Text searching allowing for inversions and translocations of factors.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

NeatSort - A practical adaptive algorithm.

[BibT_eX]

[DOI]

Marcello La Rocca

CoRR, 2014

Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

A Relational Dual Tableau Decision Procedure for Multimodal and Description Logics.

[BibT_eX]

[DOI]

Joanna Golinska-Pilarek

Proceedings of the Hybrid Artificial Intelligence Systems - 9th International Conference, 2014

Herbrand-Satisfiability of a Quantified Set-theoretical Fragment.

[BibT_eX]

[DOI]

Proceedings of the 29th Italian Conference on Computational Logic, 2014

A Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation.

[BibT_eX]

[DOI]

Proceedings of the 29th Italian Conference on Computational Logic, 2014

2013

Further analysis of the remedian algorithm.

[BibT_eX]

[DOI]

Micha Hofri

Theor. Comput. Sci., 2013

Efficient string-matching allowing for non-overlapping inversions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2013

On the satisfiability problem for a 3-level quantified syllogistic

[BibT_eX]

[DOI]

CoRR, 2013

Representing Kinship Relations on the Semantic Web.

[BibT_eX]

[DOI]

Aldo Gangemi

Proceedings of the 10th International Workshop on OWL: Experiences and Directions (OWLED 2013) co-located with 10th Extended Semantic Web Conference (ESWC 2013), 2013

2012

On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

A graphical representation of relational formulae with complementation.

[BibT_eX]

[DOI]

Andrea Formisano

Eugenio Giovanni Omodeo

RAIRO Theor. Informatics Appl., 2012

Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Pattern Matching with Swaps in Practice.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

A compact representation of nondeterministic (suffix) automata for the bit-parallel approach.

[BibT_eX]

[DOI]

Inf. Comput., 2012

An Experiment on the Connection between the DLs' Family DL<ForAllPiZero> and the Real World

[BibT_eX]

[DOI]

Antonio Pisasale

CoRR, 2012

A decidable quantified fragment of set theory with ordered pairs and some undecidable extensions

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third International Symposium on Games, 2012

On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic (extended version)

[BibT_eX]

[DOI]

CoRR, 2012

On the Elimination of Quantifiers through Descriptors in Predicate Logic.

[BibT_eX]

[DOI]

Proceedings of the 9th Italian Convention on Computational Logic, 2012

2011

Dual tableau-based decision procedures for relational logics with restricted composition operator.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2011

A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2011

Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Computational Logic and Set Theory - Applying Formalized Logic to Analysis.

[BibT_eX]

[DOI]

Springer, ISBN: 978-0-85729-807-2, 2011

2010

On Tuning the Bad-Character Rule: the Worst-Character Rule

[BibT_eX]

[DOI]

CoRR, 2010

Approximate String Matching Allowing for Inversions and Translocations.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

A Space-Efficient Implementation of the Good-Suffix Heuristic.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Bit-(Parallelism)2: Getting to the Next Level of Parallelism.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

A Decision Procedure for a Two-sorted Extension of Multi-Level Syllogistic with the Cartesian Product and Some Map Constructs.

[BibT_eX]

[DOI]

Proceedings of the 25th Italian Conference on Computational Logic, 2010

Dual Tableau-based Decision Procedures for Some Relational Logics.

[BibT_eX]

[DOI]

Proceedings of the 25th Italian Conference on Computational Logic, 2010

2009

New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

An Efficient Algorithm for Approximate Pattern Matching with Swaps.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Pattern Matching with Swaps for Short Patterns in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

A New Algorithm for Efficient Pattern Matching with Swaps.

[BibT_eX]

[DOI]

Matteo Campanelli

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Finite State Models for the Generation of Large Corpora of Natural Language Texts.

[BibT_eX]

[DOI]

Proceedings of the Finite-State Methods and Natural Language Processing, 2008

2007

A Sound Framework for delta-Rule Variants in Free-Variable Semantic Tableaux.

[BibT_eX]

[DOI]

J. Autom. Reason., 2007

2006

Decision algorithms for fragments of real analysis. I. Continuous functions with strict convexity and concavity predicates.

[BibT_eX]

[DOI]

Gianluca Cincotti

Giovanni Gallo

J. Symb. Comput., 2006

A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

A Computerized Referee.

[BibT_eX]

[DOI]

Proceedings of the Reasoning, 2006

A Decision Procedure for Monotone Functions over Bounded and Complete Lattices.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Relational Structures as Knowledge Instruments II, 2006

2005

Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces.

[BibT_eX]

[DOI]

Diego Reforgiato Recupero

Alfredo Ferro

Alfredo Pulvirenti

Dennis E. Shasha

IEEE Trans. Knowl. Data Eng., 2005

An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces.

[BibT_eX]

[DOI]

SIAM J. Optim., 2005

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

[BibT_eX]

[DOI]

Rosa Ruggeri Cannata

J. Autom. Reason., 2005

Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

A Tableau-Based Decision Procedure for a Fragment of Graph Theory Involving Reachability and Acyclicity.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2005

Solving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the ISMIR 2005, 2005

On Tuning the (\delta, \alpha)-Sequential-Sampling Algorithm for \delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the ISMIR 2005, 2005

2004

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

[BibT_eX]

[DOI]

J. Autom. Reason., 2004

Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm.

[BibT_eX]

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003

Compiling dyadic first-order specifications into map algebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on First-Order Theorem Proving, 2003

Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2003, Prague, Czech Republic, 2003

Notes from the Logbook of a Proof-Checker's Project.

[BibT_eX]

[DOI]

Proceedings of the Verification: Theory and Practice, 2003

A Decision Procedure for Monotone Functions over Lattices.

[BibT_eX]

Proceedings of the 2003 Joint Conference on Declarative Programming, 2003

2002

QuickHeapsort, an efficient mix of classical sorting algorithms.

[BibT_eX]

[DOI]

Gianluca Cincotti

Theor. Comput. Sci., 2002

Formative Processes with Applications to the Decision Problem in Set Theory, I. Powerset and Singleton Operators.

[BibT_eX]

[DOI]

Inf. Comput., 2002

2001

Set Theory for Computing - From Decision Procedures to Declarative Programming with Sets

[BibT_eX]

[DOI]

Monographs in Computer Science, Springer, ISBN: 978-1-4757-3452-2, 2001

2000

A Tableau Calculus for Integrating First-Order and Elementary Set Theory Reasoning.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

An Efficient Algorithm for the Approximate Median Selection Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999

A Tableau-Based Decision Procedure for a Fragment of Set Theory Involving a Restricted Form of Quantification.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

Transitive Venn diagrams with applications to the decision problem in set theory.

[BibT_eX]

Proceedings of the 1999 Joint Conference on Declarative Programming, 1999

1998

A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

A Further and Effective Liberalization of the delta-Rule in Free Variable Semantic Tableaux.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

1997

A Fast Saturation Strategy for Set-Theoretic Tableaux.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1997

Global Skolemization with Grouped Quantifiers.

[BibT_eX]

Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1993

Decision Procedures for Stratified Set-Theoretic Syllogistics.

[BibT_eX]

[DOI]

Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

Proving Set-Theoretic Formulae by a Tableaux Method.

[BibT_eX]

Rosa Ruggeri Cannata

Proceedings of the Workshop on Logic Programming with Sets, 1993

1991

Decision Procedures for Elementary Sublanguages of Set Theory: XI. Multilevel Syllogistic Extended by Some Elementary Map Constructs.

[BibT_eX]

[DOI]

J. Autom. Reason., 1991

Decision Procedures for Elementary Sublanguages of Set Theory: X. Multilevel Syllogistic Extended by the Singleton and Powerset Operators.

[BibT_eX]

[DOI]

J. Autom. Reason., 1991

1990

The Automation of Syllogistic.

[BibT_eX]

[DOI]

J. Autom. Reason., 1990

Decision Procedures for Elementary Sublanguages of Set Theory.

[BibT_eX]

[DOI]

J. Autom. Reason., 1990

A Decidable Fragment of the Elementary Theory of Relations and Some Applications.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

Decision Problems for Tarski and Presburger Arithmetics Extended With Sets.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989

Decision procedures for elementary sublanguages of set theory, XVI, Multilevel syllogistic extended by singleton, rank comparison and unary intersection.

[BibT_eX]

Bull. EATCS, 1989

On the Decidability of Formulae Involving Continuous and Closed Functions.

[BibT_eX]

[DOI]