Marianna Nicolosi-Asmundo

An efficient relational deductive system for propositional non-classical logics

We describe a relational framework that uniformly supports formalization and automated reasoning in varied propositional modal logics. The proof system we propose is a relational variant of the classical Rasiowa-Sikorski proof system. We introduce a compact graph-based representation of formulae and proofs supporting an efficient implementation of the basic inference engine, as well as of a number of refinements. Completeness and soundness results are shown and a Prolog implementation is described.

Web Ontology Representation and Reasoning via Fragments of Set Theory

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.

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

We propose a generic sound δ-rule, based on a quite general method for the construction of Skolem terms, which can be used as a common framework for proving the soundness of known variants of the δ-rule, and we compare their relative effectiveness. Attempts to instantiate some of the δ-rules present in the literature within our framework allowed us to pinpoint unsoundness problems for two of them. In both cases, we propose revised versions that are proved sound by reducing them within our framework.

A Set-Theoretic Approach to ABox Reasoning Services

In this paper we consider the most common ABox reasoning services for the description logic \(\mathcal {DL}\langle \mathsf {4LQS}^{\mathsf{R},\!\times }\rangle (\mathbf {D})\) (\(\mathcal {DL}_{\mathbf {D}}^{4,\!\times }\), for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment \(\mathsf {4LQS^R}\). The description logic \(\mathcal {DL}_{\mathbf {D}}^{4,\!\times }\) is very expressive, as it admits various concept and role constructs and data types that allow one to represent rule-based languages such as SWRL.

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

We solve the satisfiability problem for a three-sorted fragment of set theory (denoted

A Relational Dual Tableau Decision Procedure for Multimodal and Description Logics

3LQST_0^R

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

), which admits a restricted form of quantification over individual and set variables and the finite enumeration operator

The Shape of a Benedictine Monastery: The SaintGall Ontology (Extended Version)

\{\text{-}, \text{-}, \ldots, \text{-}\}

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

over individual variables, by showing that it enjoys a small model property, i.e., any satisfiable formula

\shdlssx

\psi