Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

28th Hawaii International Conference on System Sciences (HICSS'95)   p. 321
Discovering implicit integrity constraints in rule bases using metagraphs

Full Article Text: Download PDF of full textGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.1995.375612
Send link to a friend

Abstract
A metagraph is a graph formalism that can be used to model the different components of a DSS and to analyze the interactions among them. One such component is a knowledge based system (KBS) in which domain knowledge is stored as 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 during updates and problem solving. We show how metagraph representation of a rule base can facilitate discovery of implicit integrity constraints in addition to explicitly stated ones.
Additional Information
Index Terms- decision support systems; knowledge based systems; graph theory; data integrity; knowledge representation; implicit integrity constraints; rule bases; metagraphs; graph formalism; DSS; knowledge based system; domain knowledge; if-then rules; integrity constraints; rule base; problem solving; metagraph representation

Citation:  A. Basu, R.W. Blanning, "Discovering implicit integrity constraints in rule bases using metagraphs," hicss, p. 321,  28th Hawaii International Conference on System Sciences (HICSS'95),  1995

Similar Articles

Abstract Contents
Abstract
Index Terms
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback