Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/99580
Title: P-graph--A graph model for anomaly checking of knowledge bases
Authors: Lim, E.L.
McCallum, J. 
Chan, K.H.
Issue Date: 1990
Citation: Lim, E.L.,McCallum, J.,Chan, K.H. (1990). P-graph--A graph model for anomaly checking of knowledge bases : 871-877. ScholarBank@NUS Repository.
Abstract: The authors present a graph model, P-graph, which supports the checking of knowledge bases, for anomalies such as deadends, unreachability, cycles, inconsistency, redundancy, subsumption, and missing rules. P-graph captures the essential information needed for anomaly checks. The proposed approach differs from existing research as follows: (1) it checks on groups of problem instances rather than on individual problem instances; (2) it uses empirical knowledge to generate problem instances realizable in practice (only these problem instances need to be checked); and (3) it considers the fact base as part of the knowledge base to be checked.
URI: http://scholarbank.nus.edu.sg/handle/10635/99580
ISBN: 0818620846
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

72
checked on Oct 26, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.