Reasoning with inconsistent ontologies involves using an inconsistency reasoner to get meaningful answers from inconsistent ontologies. This paper introduces an improved inconsistency reasoner, which selects consisten...Reasoning with inconsistent ontologies involves using an inconsistency reasoner to get meaningful answers from inconsistent ontologies. This paper introduces an improved inconsistency reasoner, which selects consistent subsets using minimal inconsistent sets and a resolution method, to improve the run-time performance of the reasoning processing. A minimal inconsistent set contains a minimal explanation for the inconsistency of a given ontology. Thus, it can replace the consistency checking operation, which is executed frequently in existing approaches. When selecting subsets of the inconsistent ontology, formulas which can be directly or indirectly resolved with the negation of the query formula are selected because only those formulas affect the consequences of the reasoner. Therefore, the complexity of the reasoning processing is significantly reduced. Tests show that the run-time performance of the inconsistency reasoner is significantly improved.展开更多
This paper investigates the problem of computing all maximal contractions of a given formula set F with re- spect to a consistent set A of atomic formulas and negations of atomic formulas. We first give a constructive...This paper investigates the problem of computing all maximal contractions of a given formula set F with re- spect to a consistent set A of atomic formulas and negations of atomic formulas. We first give a constructive definition of minimal inconsistent subsets and propose an algorithmic framework for computing all minimal inconsistent subsets of any given formula set. Then we present an algorithm to com- pute all maximal contractions from minimal inconsistent sub- sets. Based on the algorithmic framework and the algorithm, we propose a general framework for computing all maximal contractions. The computability of the minimal inconsistent subset and maximal contraction problems are discussed. Fi- nally, we demonstrate the ability of this framework by apply- ing it to the first-order language without variables and design an algorithm for the computation of all maximal contractions.展开更多
基金Supported by the Specialized Research Fund for the Doctoral Program of Higher Education of MOE, P.R.C (No.20096102120037)
文摘Reasoning with inconsistent ontologies involves using an inconsistency reasoner to get meaningful answers from inconsistent ontologies. This paper introduces an improved inconsistency reasoner, which selects consistent subsets using minimal inconsistent sets and a resolution method, to improve the run-time performance of the reasoning processing. A minimal inconsistent set contains a minimal explanation for the inconsistency of a given ontology. Thus, it can replace the consistency checking operation, which is executed frequently in existing approaches. When selecting subsets of the inconsistent ontology, formulas which can be directly or indirectly resolved with the negation of the query formula are selected because only those formulas affect the consequences of the reasoner. Therefore, the complexity of the reasoning processing is significantly reduced. Tests show that the run-time performance of the inconsistency reasoner is significantly improved.
文摘This paper investigates the problem of computing all maximal contractions of a given formula set F with re- spect to a consistent set A of atomic formulas and negations of atomic formulas. We first give a constructive definition of minimal inconsistent subsets and propose an algorithmic framework for computing all minimal inconsistent subsets of any given formula set. Then we present an algorithm to com- pute all maximal contractions from minimal inconsistent sub- sets. Based on the algorithmic framework and the algorithm, we propose a general framework for computing all maximal contractions. The computability of the minimal inconsistent subset and maximal contraction problems are discussed. Fi- nally, we demonstrate the ability of this framework by apply- ing it to the first-order language without variables and design an algorithm for the computation of all maximal contractions.
