Reasoning with Inconsistent Ontologies.
Published 1 January 2005
Zhisheng Huang, Frank van Harmelen, Annette ten Teije
Citations186
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.
Abstract
In this paper we present a framework of reasoning with inconsistent ontologies, in which pre-defined selection functions are used to deal with concept relevance. We examine how the notion of "concept relevance" can be used for reasoning with inconsistent ontologies. We have implemented a prototype called PION (Processing Inconsistent ONtologies), which is based on a syntactic relevance-based selection function. In this paper, we also report the experiments with PION.
Keywords
Computer Science
A Useful Four-Valued Logic
1,419 Citations1977Nuel Belnap
It is argued that a sophisticated question-answering machine that has the capability of making inferences from its data base should employ a certain four-valued logic, the motivating consideration being that minor inconsistencies in its data should not be allowed to lead to irrelevant conclusions.
Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures
722 Citations2004Alexander Budanitsky, Graeme Hirst +2 more
Data Archiving and Networked Services (DANS)Non-standard reasoning services for the debugging of description logic terminologies
423 Citations2003Stefan Schlobach, Ronald Cornet
Artificial IntelligenceTractable reasoning via approximation
174 Citations1995Marco Schaerf, Marco Cadoli
The main goal is to define a semantically well-founded logic for approximate reasoning, which is justifiable from the intuitive point of view, and to provide fast algorithms for dealing with it even when using expressive languages.
International Joint Conference on Artificial IntelligenceA knowledge-level account of abduction
148 Citations1989Hector J. Levesque
Cambridge University Press eBooksComplexity of Reasoning
82 Citations2007Francesco M. Donini
This work presents lower bounds on the computational complexity of satisfiability and subsumption in several Description Logics, and considers both reasoning with simple concept expressions and reasoning with an underlying TBox.
Studia LogicaHandling Locally Stratified Inconsistent Knowledge Bases
22 Citations2002Salem Benferhat, Laurent Garcia
This paper investigates the idea of reasoning, in a local (or contextual) way, under prioritized and possibly inconsistent knowledge bases, and proposes natural approaches to restore the coherence of a knowledge base on the basis of influence relations between locally-stratified conflicts.
Annals of Mathematics and Artificial IntelligenceResource-Bounded Paraconsistent Inference
15 Citations2003Pierre Marquis, Nadège Porquet
A new framework for reasoning from inconsistent propositional belief bases using a family of resource-bounded paraconsistent inference relations based on S-3 entailment, an inference relation logically weaker than the classical one and parametrized by a set of propositional variables.
An Extended DIG Description Logic Interface for Prolog
5 Citations2004Zhisheng Huang, Cees Visser
This document presents a DIG description logic interface extension for high-level programming languages like Prolog, and describes the extended framework and discusses several examples to show how it can be used to develop hybrid Prolog / DL reasoners.
Reasoning with Inconsistent Ontologies: Framework and Prototype
5 Citations2005Zhisheng Huang, Frank van Harmelen +2 more
A prototype of a reasoner for Processing Inconsistent ONtologies (PION), which is implemented in XDIG, an extended DIG Description Logic Interface for Prolog, and formal definitions of soundness, meaningfulness, local completeness, and maximal completeness of an inconsistency reasoner are presented.
Studia LogicaRemoving Inconsistencies in Assumption-based Theories Through Knowledge-Gathering Actions
4 Citations2001Jérôme Lang, Pierre Marquis
This paper is specifically interested in finding out sets of tests allowing to purify a KB, i.e., identifying the right extension of KB using knowledge-gathering actions (tests), and addresses this problem especially from the point of view of computational complexity.
