GC-SROIQ(C) : Expressive Constraint Modelling and Grounded Circumscription for SROIQ

11/03/2014
by   Arjun Bhardwaj, et al.
0

Developments in semantic web technologies have promoted ontological encoding of knowledge from diverse domains. However, modelling many practical domains requires more expressive representations schemes than what the standard description logics(DLs) support. We extend the DL SROIQ with constraint networks and grounded circumscription. Applications of constraint modelling include embedding ontologies with temporal or spatial information, while grounded circumscription allows defeasible inference and closed world reasoning. This paper overcomes restrictions on existing constraint modelling approaches by introducing expressive constructs. Grounded circumscription allows concept and role minimization and is decidable for DL. We provide a general and intuitive algorithm for the framework of grounded circumscription that can be applied to a whole range of logics. We present the resulting logic: GC-SROIQ(C), and describe a tableau decision procedure for it.

READ FULL TEXT
research
08/01/2015

Extending SROIQ with Constraint Networks and Grounded Circumscription

Developments in semantic web technologies have promoted ontological enco...
research
06/28/2021

A Rational Entailment for Expressive Description Logics via Description Logic Programs

Lehmann and Magidor's rational closure is acknowledged as a landmark in ...
research
05/10/2000

Practical Reasoning for Expressive Description Logics

Description Logics (DLs) are a family of knowledge representation formal...
research
03/17/2022

Expressivity of Planning with Horn Description Logic Ontologies (Technical Report)

State constraints in AI Planning globally restrict the legal environment...
research
09/06/2023

Using the Shapes Constraint Language for modelling regulatory requirements

Ontologies are traditionally expressed in the Web Ontology Language (OWL...
research
11/15/2014

Using Description Logics for RDF Constraint Checking and Closed-World Recognition

RDF and Description Logics work in an open-world setting where absence o...
research
02/21/2021

Relative Expressiveness of Defeasible Logics II

(Maher 2012) introduced an approach for relative expressiveness of defea...

Please sign up or login with your details

Forgot password? Click here to reset