Learn More
For ontologies represented as Description Logic Tboxes, op-timised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such problems. One possible remedy is to weaken the available information to the extent that the errors disappear, but to limit the weakening process as much as possible. The most obvious(More)
This paper describes a proposed new syntax that can be used to write and read OWL ontologies in Controlled Natural Language (CNL): a well-defined subset of the English language. Following the lead of Manchester OWL Syntax in making OWL more accessible for non-logicians, and building on the previous success of Schwitter's PENG (Processable English), the(More)
Standard belief contraction assumes an underlying logic containing full classical propositional logic, but there are good reasons for considering contraction in less expressive logics. In this paper we focus on Horn logic. In addition to being of interest in its own right, our choice is motivated by the use of Horn logic in several areas, including ontology(More)
We present a general preferential semantic framework for plausible subsumption in description logics, analogous to the KLM preferential semantics for proposi-tional entailment. We introduce the notion of ordered interpretations for description logics, and use it to define two mutually dual non-deductive subsumption relations ⊏ ∼ and ⊏ ∼ *. We outline their(More)
Intelligent agents have to be able to merge inputs received from different sources in a coherent and rational way. Recently, several proposals have been made for the merging of structures in which it is possible to encode the preferences of sources [5, 4, 12–14, 1]. Information merging has much in common with the goals of social choice theory: to define(More)