A Fix-Point Semantics for Rule-Base Anomalies
نویسنده
چکیده
A crucial component of an intelligent system is its knowledge base that contains knowledge about a problem domain. Knowledge base development involves domain analysis, context space definition, ontological specification, and knowledge acquisition, codification and verification. Knowledge base anomalies can affect the correctness and performance of an intelligent system. In this chapter, we describe a fixpoint semantics for a knowledge base that is based on a multi-valued logic. We then use the fixpoint semantics to provide formal definitions for four types of knowledge base anomalies: inconsistency, redundancy, incompleteness, circularity. We believe such formal definitions of knowledge base anomalies will help pave the way for a more effective knowledge base verification process.
منابع مشابه
Correlation and Substitution in SPARQL
In the current sparql specification the notion of correlation and substitution are not well defined. This problem triggers several ambiguities in the semantics. In fact, implementations as Fuseki and Virtuoso assume different semantics. In this technical report, we provide a semantics of correlation and substitution following the classic philosophy of substitution and correlation in logic, prog...
متن کاملInterpreting SWRL Rules in RDF Graphs
An unresolved issue in SWRL (the Semantic Web Rule Language) is whether the intended semantics of its RDF representation can be described as an extension of the W3C RDF semantics. In this paper we propose to make the model-theoretic semantics of SWRL compatible with RDF by interpreting SWRL rules in RDF graphs. For dealing with SWRL/RDF rules, we regard ‘Implies’ as an OWL class, and extract al...
متن کاملA Principled Framework for Modular Web Rule Bases and Its Semantics
We present a principled framework for modular web rule bases, called MWeb. According to this framework, each predicate defined in a rule base is characterized by its defining reasoning mode, scope, and exporting rule base list. Each predicate used in a rule base is characterized by its requesting reasoning mode and importing rule base list. For valid MWeb modular rule bases S , the MWebAS and M...
متن کاملar X iv : c s . A I / 04 02 01 3 v 1 9 Fe b 20 04 Corollaries on the fixpoint completion : studying the stable semantics by means of the Clark completion
The fixpoint completion fix(P ) of a normal logic program P is a program transformation such that the stable models of P are exactly the models of the Clark completion of fix(P ). This is well-known and was studied by Dung and Kanchanasut [15]. The correspondence, however, goes much further: The Gelfond-Lifschitz operator of P coincides with the immediate consequence operator of fix(P ), as sho...
متن کاملCorollaries on the fixpoint completion: studying the stable semantics by means of the Clark completion
The fixpoint completion fix(P ) of a normal logic program P is a program transformation such that the stable models of P are exactly the models of the Clark completion of fix(P ). This is well-known and was studied by Dung and Kanchanasut [15]. The correspondence, however, goes much further: The Gelfond-Lifschitz operator of P coincides with the immediate consequence operator of fix(P ), as sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJCINI
دوره 1 شماره
صفحات -
تاریخ انتشار 2007