activity
20162024
most citedTheoretical Foundations of Defeasible Description Logics

5 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing cs.AIShow all

7 papers · 1 filter

cs.AI2024

Belief Change based on Knowledge Measures

Umberto Straccia, Giovanni Casini

Knowledge Measures (KMs) aim at quantifying the amount of knowledge/information that a knowledge base carries. On the other hand, Belief Change (BC) is the process of changing beli…

cs.AI2022

A General Framework for Modelling Conditional Reasoning -- Preliminary Report

Giovanni Casini, Umberto Straccia

We introduce and investigate here a formalisation for conditionals that allows the definition of a broad class of reasoning systems. This framework covers the most popular kinds of…

cs.AI2022

A Minimal Deductive System for RDFS with Negative Statements

Umberto Straccia, Giovanni Casini

The triple language RDFS is designed to represent and reason with \emph{positive} statements only (e.g."antipyretics are drugs"). In this paper we show how to extend RDFS to expres…

cs.AI20195 cited

Theoretical Foundations of Defeasible Description Logics

Katarina Britz, Giovanni Casini, Thomas Meyer +3

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as s…

cs.AI2018

On Rational Entailment for Propositional Typicality Logic

Richard Booth, Giovanni Casini, Thomas Meyer +1

Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias…

cs.AI2018

A Polynomial Time Subsumption Algorithm for Nominal Safe under Rational Closure

Giovanni Casini, Umberto Straccia, Thomas Meyer

Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision proble…