A Defeasible Ontology Language
Lecture notes in computer sciencePublished 1 January 2002
Stijn Heymans, Dirk Vermeir
Citations39
SJR quartileQ2
SJR score0.35
SNIP0.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The description logic SHOQ(D) is extended with a preference order on the axioms, and it is argued that such a defeasible language may be usefully applied for learning and integrating ontologies.
Abstract
We extend the description logic SHOQ(D) with a preference order on the axioms. With this strict partial order certain axioms can be overruled, if defeated with more preferred ones. Furthermore, we impose a preferred model semantics, thus effectively introducing nonmonotonicity into SHOQ(D). Since a description logic can be viewed as an ontology language, or a proper translation of one, we obtain a defeasible ontology language. Finally, we argue that such a defeasible language may be usefully applied for learning and integrating ontologies.
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
The Knowledge Engineering ReviewOntologies: principles, methods and applications
3,470 Citations1996Mike Uschold, Michael Grüninger
This paper outlines a methodology for developing and evaluating ontologies, first discussing informal techniques, concerning such issues as scoping, handling ambiguity, reaching agreement and producing definitions, and considers, a more formal approach.
Artificial IntelligenceNonmonotonic reasoning, preferential models and cumulative logics
1,680 Citations1990Sarit Kraus, Daniel Lehmann +1 more
The preferential models proposed here are a much stronger tool than Adams' probabilistic semantics, and are defined and characterized by representation theorems, relating the two points of view.
ACM SIGKDD Explorations NewsletterResource description framework
1,073 Citations2001K. Selçuk Candan, Huan Liu +1 more
This survey aims at providing a glimpse at the past, present, and future of this upcoming technology and highlights why it is expected that knowledge discovery and data mining can benefit from RDF and the Semantic Web.
IEEE Intelligent SystemsOIL: an ontology infrastructure for the Semantic Web
759 Citations2001Dieter Fensel, Frank van Harmelen +3 more
The authors present OIL, a proposal for a joint standard for specifying and exchanging ontologies, which is needed for knowledge sharing and reuse on the Semantic Web.
IEEE Internet ComputingThe Semantic Web: the roles of XML and RDF
742 Citations2000Stefan Decker, Sergey Melnik +6 more
It is argued that a further representation and inference layer is needed on top of the Web's current layers, and to establish such a layer, a general method for encoding ontology representation languages into RDF/RDF schema is proposed.
Cambridge University Press eBooksBasic Description Logics
566 Citations2007Franz Baader, Werner Nutt
This chapter provides an introduction to Description Logics as a formal language for representing knowledge and reasoning about it, covering syntax and semantics, and the basic constructors that are used in systems or have been introduced in the literature.
Lecture notes in computer sciencePractical Reasoning for Expressive Description Logics
534 Citations1999Ian Horrocks, Ulrike Sattler +1 more
An algorithm is presented that decides satisfiability of the DL ACC extended with transitive eind inverse roles, role hierarchies, and quaJifying number restrictions, and early experiments indicate that this algorithm is well-suited for implementation.
Lecture notes in computer scienceOilEd: A Reason-able Ontology Editor for the Semantic Web
396 Citations2001Sean Bechhofer, Ian Horrocks +2 more
OilEd is an ontology editor that has an easy to use frame interface, yet at the same time allows users to exploit the full power of an expressive web ontology language (OIL).
Lecture notes in computer scienceOIL in a Nutshell
375 Citations2000Dieter Fensel, Ian Horrocks +4 more
This work will present OIL, which is a proposal for a joint standard for specifying and exchanging ontologies, based on existing proposals such as OKBC, XOL and RDF schema, enriching them with necessary features for expressing ontologies.
SciDok (Saarland University and State Library)A scheme for integrating concrete domains into concept languages
316 Citations1991Franz Baader, Philipp Hanschke
This paper shall define a terminological and an assertional language, and consider the important inference problems such as subsumption, instantiation, and consistency, and proposes a scheme for integrating such concrete domains into concept languages.
Ontology reasoning in the SHOQ(D) description logic
313 Citations2001Ian Horrocks, Ulrike Sattler
SHOQ(D) is an expressive description logic equipped with named individuals and concrete datatypes which has almost exactly the same expressive power as the latest web ontology languages (e.g., OIL and DAML).
SciDok (Saarland University and State Library)Embedding defaults into terminological knowledge representation formalisms
263 Citations1993Franz Baader, Bernhard Hollunder
Research Explorer (The University of Manchester)Reasoning with Individuals for the Description Logic SHIQ
233 Citations2000Ian Horrocks, Ulrike Sattler +1 more
arXiv (Cornell University)Reasoning with Individuals for the Description Logic SHIQ
166 Citations2000Ian Horrock, Ulrike Sattler +1 more
Data & Knowledge EngineeringReasoning with individuals in concept languages
106 Citations1994Andrea Schaerf
The consequences of introducing a constructor for building a concept from a set of enumerated individuals in the concept description language are investigated and some complexity results are provided on it.
The Ontology Inference Layer OIL
99 Citations2000Ian Horrocks, Dieter Fensel +9 more
This paper presents OIL which is a proposal for a joint standard for specifying and exchanging ontologies, based on existing proposals such as OKBC, XOL and RDF, and enriches them with necessary features for expressing rich ontologies.
Lecture notes in computer scienceReasoning with Individuals for the Description Logic $\mathcal{SHIQ}$
82 Citations2000Ian Horrocks, Ulrike Sattler +1 more
An algorithm for combined Tbox and Abox reasoning in the \(\mathcal{SHIQ}\) description logic is presented, of particular interest as it can be used to decide the problem of (database) conjunctive query containment w.r.t. a schema.
Publications of the UdS (Saarland University)How to prefer more specific defaults in terminological default logic
78 Citations1992Franz Baader, Bernhard Hollunder
The present paper addresses the problem of modifying terminological default logic such that more specific defaults are preferred, and presents an alternative approach for dealing with prioritization in the framework of Heifer's default logic.
Lecture notes in computer scienceTableau Algorithms for Description Logics
65 Citations2000Franz Baader, Ulrike Sattler
This work focuses on description logics, a family of knowledge representation formalisms descended from semantic networks and frames via the system KL-ONE, which has turned out to be closely related to propositional modal logics and logics of programs (such as propositional dynamic logic).
Representing Defaults as Sentences with Reduced Priority.
30 Citations1992Mark Ryan
It is argued that the second approach makes for simpler representation of defaults and their interactions, and the notion of ordered theory presentation (OTP) is introduced to represent theories with defaults.
Defeasible Logics
13 Citations1998P. Geerts, E. Laenens +1 more
This chapter focuses on the defeasible approach to nonmonotonic reasoning, as opposed to the minimalist approach and the fixpoint approach, in which each rule is either inapplicable, applied or defeated.
Lecture notes in computer scienceA logical basis for object oriented programming
8 Citations1991E. Laenens, Dirk Vermeir
This work develops the proof theory and semantics of a logic, called ordered logic (OL), which models the most important aspects of object oriented programming languages, such as object identity, multiple inheritance and defaults.
What's not in a name? Initial Explorations of a Structural Approach to Integrating Large Concept Knowledge-Bases
6 Citations1999Alex Borgida, Ralf Küsters
Using preference order in ontologies
4 Citations2004Stijn Heymans, Dirk Vermeir
An algorithm is presented that, based on concrete examples of facts that should be true, produces minimal preference orderings on the axioms, in order to make an otherwise inconsistent knowledge base consistent.