Discovering implicit integrity constraints in rule bases using metagraphs

نویسندگان

  • Amit Basu
  • Robert W. Blanning
چکیده

A metagraph is a graph formalism that can be used to model the different components of a DSS and to analyre the interactions among them. One such component is a knowledge based system (KBS) in which domain knowledge is stored ss if-then rules. In addition to such rules, a KBS can also contain a set of integrity constraints, which are used to manage the rule base both duringnpdatesand problem solving. In this paper, we show how metagraph representation of a rule base can facilitate discovery of implicit integrity constraints in addition to explicitly stated ones.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases

The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reducing the complexity of formula evaluation at run-time. This paper proposes such a simplification method for large and semantically rich knowledge bases. Structural, temporal and assertional knowledge in the form of deduc...

متن کامل

Towards a Practical Approach to Discover Internal Dependencies in Rule-Based Knowledge Bases

In this paper, we intend to introduce the conception of discovering the knowledge about rules saved in large rule-based knowledge bases, both generated automatically and acquired from human experts in the classical way. This paper presents a preliminary study of a new project in which we are going to join the two approaches: the hierarchical decomposition of large rule bases using cluster analy...

متن کامل

Propagating probabilities in System

In this paper we suggest a way of using the rules of System P to propagate lower bounds on conditional probabilities. Using a knowledge base of default rules which are considered to be constraints on a probability distribution, the result of applying the rules of P gives us new constraints that were implicit in the knowledge base and their associated lower bounds.

متن کامل

Towards a Uniform Logical Representation of Different Kinds of Integrity Constraints

There is no agreement in the litterature about the de nition of integrity constraints in the context of data and/or knowledge bases. What kind of property people want to guarantee using integrity constraints? Is it the property of consistency of database content or the completeness of database content [6] or validity or completeness of database content with regard to the world [3] or some prope...

متن کامل

Workflow Analysis using Attributed Metagraphs

Graph-theoretic methods for analyzing workflows and processes can provide insight into important problems in process design, and can help in the design of effective workflows. In particular, representation of workflows as metagraphs has been shown to provide a useful basis for formal analysis of processes and workflows. In this paper, we show how attributed metagraphs can be used to analyze wor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995