Defeasible RDFS via Rational Closure

by   Giovanni Casini, et al.

In the field of non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as a prominent approach. In recent years, RC has gained even more popularity in the context of Description Logics (DLs), the logic underpinning the semantic web standard ontology language OWL 2, whose main ingredients are classes and roles. In this work, we show how to integrate RC within the triple language RDFS, which together with OWL2 are the two major standard semantic web ontology languages. To do so, we start from ρ df, which is the logic behind RDFS, and then extend it to ρ df_, allowing to state that two entities are incompatible. Eventually, we propose defeasible ρ df_ via a typical RC construction. The main features of our approach are: (i) unlike most other approaches that add an extra non-monotone rule layer on top of monotone RDFS, defeasible ρ df_ remains syntactically a triple language and is a simple extension of ρ df_ by introducing some new predicate symbols with specific semantics. In particular, any RDFS reasoner/store may handle them as ordinary terms if it does not want to take account for the extra semantics of the new predicate symbols; (ii) the defeasible ρ df_ entailment decision procedure is build on top of the ρ df_ entailment decision procedure, which in turn is an extension of the one for ρ df via some additional inference rules favouring an potential implementation; and (iii) defeasible ρ df_ entailment can be decided in polynomial time.


page 1

page 2

page 3

page 4


A Rational Entailment for Expressive Description Logics via Description Logic Programs

Lehmann and Magidor's rational closure is acknowledged as a landmark in ...

Defeasible Reasoning in SROEL: from Rational Entailment to Rational Closure

In this work we study a rational extension SROEL^R T of the low complexi...

Theoretical Foundations of Defeasible Description Logics

We extend description logics (DLs) with non-monotonic reasoning features...

Four-Valued Semantics for Deductive Databases

In this paper, we introduce a novel approach to deductive databases mean...

On Finite Entailment of Non-Local Queries in Description Logics

We study the problem of finite entailment of ontology-mediated queries. ...

On Rational Entailment for Propositional Typicality Logic

Propositional Typicality Logic (PTL) is a recently proposed logic, obtai...

A Polynomial Time Subsumption Algorithm for Nominal Safe ELO_ under Rational Closure

Description Logics (DLs) under Rational Closure (RC) is a well-known fra...

Please sign up or login with your details

Forgot password? Click here to reset