15 citations · 35 across the 12 of their papers we have counts for
9 papers · 1 filter
A set-based reasoner for the description logic (Extended Version)
Domenico Cantone, Marianna Nicolosi-Asmundo, Daniele Francesco Santamaria
We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic $\mathcal{DL}\langle \mathsf{4LQS^{R…
An optimized KE-tableau-based system for reasoning in the description logic (Extended Version)
Domenico Cantone, Marianna Nicolosi-Asmundo, Daniele Francesco Santamaria
We present a KE-tableau-based procedure for the main TBox and ABox reasoning tasks for the description logic , in…
A Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation (Extended Version)
Domenico Cantone, Marianna Nicolosi-Asmundo, Ewa Orłowska
We present a first result towards the use of entailment in- side relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1) which admits a res…
A C++ reasoner for the description logic (Extended Version)
Domenico Cantone, Marianna Nicolosi-Asmundo, Daniele Francesco Santamaria
We present an ongoing implementation of a KE-tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic $\mathcal{DL}\lang…
Conjunctive Query Answering via a Fragment of Set Theory (Extended Version)
Domenico Cantone, Marianna Nicolosi-Asmundo, Daniele Francesco Santamaria
We address the problem of Conjunctive Query Answering (CQA) for the description logic $\dlssx$ ($\shdlssx$, for short) which extends the logic $\dlss$ with Boolean operations on co…
The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
Domenico Cantone, Marianna Nicolosi-Asmundo
We solve the satisfiability problem for a three-sorted fragment of set theory (denoted ), which admits a restricted form of quantification over individual and set variab…
Web ontology representation and reasoning via fragments of set theory
Domenico Cantone, Cristiano Longo, Marianna Nicolosi-Asmundo +1
In this paper we use results from Computable Set Theory as a means to represent and reason about description logics and rule languages for the semantic web. Specifically, we introd…
On the satisfiability problem for a 3-level quantified syllogistic
Domenico Cantone, Marianna Nicolosi Asmundo
We show that a collection of three-sorted set-theoretic formulae, denoted TLQSR and which admits a restricted form of quantification over individual and set variables, has a solvab…
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic (extended version)
Domenico Cantone, Marianna Nicolosi Asmundo
We introduce a multi-sorted stratified syllogistic, called 4LQSR, admitting variables of four sorts and a restricted form of quantification over variables of the first three sorts,…