Representation of Propositional Expert Systems as Partial Functions

نویسنده

Robert M. Colomb

چکیده

Propositional expert systems classify cases, and can be built in several different forms, including production rules, decision tables and decision trees. These forms are inter-translatable, but the translations are much larger than the originals, often unmanageably large. In this paper a method of controlling the size problem is demonstrated, based on induced partial functional dependencies, which makes the translations practical in a principled way. The set of dependencies can also be used to filter cases to be classified, eliminating spurious cases, and cases for which the classification is likely to be of doubtful validity.  1999 Elsevier Science B.V. All rights reserved.

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

ثبت نام

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

منابع مشابه

Very Fast Decision Table Execution of Propositional Expert Systems

A formal equivalence between propositional expert systems and decision tables is proved, and a practicable procedure given to perform the transformation between propositional expert systems and decision tables. The method gave an order of magnitude speed increase for a well-known expert system in routine use. The method is very general: adaptations are shown for forward and backward chaining in...

متن کامل

($phi,rho$)-Representation of $Gamma$-So-Rings

A $Gamma$-so-ring is a structure possessing a natural partial ordering, an infinitary partial addition and a ternary multiplication, subject to a set of axioms. The partial functions under disjoint-domain sums and functional composition is a $Gamma$-so-ring. In this paper we introduce the notions of subdirect product and $(phi,rho)$-product of $Gamma$-so-rings and study $(phi,rho)$-represen...

متن کامل

Horn Minimization by Iterative Decomposition 1

The problem of Horn minimization can be stated as follows: given a Horn CNF representing a Boolean function f , nd a CNF representation of f which consists of a minimum possible number of clauses. This problem is the formalization of the problem of knowledge compression for speeding up queries to propositional Horn expert systems, and it is known to be NP-hard. In this paper we present a linear...

متن کامل

Knowledge Representation for Expert Systems

The purpose of this article is to summarize the state-of-the-art of the expert systems research field. First, we introduce the basic notion of knowledge, and specifically of shallow knowledge, and deep knowledge. The first section of the document summarizes the history of the field. We analyze the differences between the first generation of expert systems, based primarily upon rulebased and fra...

متن کامل