Reasoning about exceptions in ontologies is nowadays one of the challenges the description logics community is facing. The paper describes a preferential approach for dealing with exceptions in Description Logics, based on the rational closure. The rational closure has the merit of providing a simple and efficient approach for reasoning with exceptions, but it does not allow independent handling of the inheritance of different defeasible properties of concepts. In this work we outline a possible solution to this problem by introducing a weaker variant of the lexicographical closure, that we call skeptical closure, which requires to construct a single base. We develop a bi-preference semantics for defining a characterization of the skeptical...
In this Version 2, minor improvements are made to Version 1.An algebraic method is used to study the...
date de rédaction : 21/12/2004This paper presents a unified framework for dealing with exceptions in...
We address the problem of deciding skeptical acceptance wrt. preferred semantics of an argument in a...
International audienceThis chapter is a contribution to the study of formal ontologies. It addresses...
Among the various proposals for defeasible reasoning for description logics, rational closure, a pro...
The Web Ontology Languages define a rich machine readable language for knowledge representation on t...
Handling exceptions in a knowledge-based system has been considered as an important issue in many do...
Description logics belong to a family of knowledge representation formalisms that are widely used fo...
Developing and maintaining ontologies is an expensive and error-prone task. After an error is detect...
In this paper, we address the problem of dealing with inconsistent knowledge bases consisting of ont...
In computer science, ontologies are dynamic entities: to adapt them to new and evolving applications...
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In o...
We study the problem of dealing with inconsistency in Description Logic (DL) ontologies. We consider...
Developing and maintaining ontologies is an expensive and error-prone task. After an error is detect...
Abstract. The formalisation of defeasible reasoning in automated systems is be-coming increasingly i...
In this Version 2, minor improvements are made to Version 1.An algebraic method is used to study the...
date de rédaction : 21/12/2004This paper presents a unified framework for dealing with exceptions in...
We address the problem of deciding skeptical acceptance wrt. preferred semantics of an argument in a...
International audienceThis chapter is a contribution to the study of formal ontologies. It addresses...
Among the various proposals for defeasible reasoning for description logics, rational closure, a pro...
The Web Ontology Languages define a rich machine readable language for knowledge representation on t...
Handling exceptions in a knowledge-based system has been considered as an important issue in many do...
Description logics belong to a family of knowledge representation formalisms that are widely used fo...
Developing and maintaining ontologies is an expensive and error-prone task. After an error is detect...
In this paper, we address the problem of dealing with inconsistent knowledge bases consisting of ont...
In computer science, ontologies are dynamic entities: to adapt them to new and evolving applications...
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In o...
We study the problem of dealing with inconsistency in Description Logic (DL) ontologies. We consider...
Developing and maintaining ontologies is an expensive and error-prone task. After an error is detect...
Abstract. The formalisation of defeasible reasoning in automated systems is be-coming increasingly i...
In this Version 2, minor improvements are made to Version 1.An algebraic method is used to study the...
date de rédaction : 21/12/2004This paper presents a unified framework for dealing with exceptions in...
We address the problem of deciding skeptical acceptance wrt. preferred semantics of an argument in a...