Essential and redundant rules in Horn knowledge bases

Decision Support Systems

Volumn 16, Issue 2, 1996, Pages 119-130

  Hammer, Peter L ^a   Kogan, Alexander ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Boolean functions; Essential rule; Expert systems; Horn clause; Knowledge compression; Logic minimization; Logical equivalence; Propositional knowledge base; Redundant rule

Indexed keywords

BOOLEAN FUNCTIONS; DECISION SUPPORT SYSTEMS; EQUIVALENCE CLASSES; EXPERT SYSTEMS; OPTIMIZATION;

ESSENTIAL RULE; HORN KNOWLEDGE BASE; KNOWLEDGE COMPRESSION; LOGIC MINIMIZATION; LOGICAL EQUIVALENCE; PROPOSITIONAL KNOWLEDGE BASE; REDUNDANT RULE;

KNOWLEDGE BASED SYSTEMS;

EID: 0030084183     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-9236(95)00002-X     Document Type: Article

References (17)

1. A. Blake, Canonical Expression in Boolean Algebra, Dissertation, Chicago, 1937.
2. E. Charles and O. Dubois, MELODIA: Logical methods for checking knowledge bases, in: M. Ayel and J.-P. Laurent Eds., Validation, Verification and Test of Knowledge-based Systems (Wiley and Sons, 1991) pp. 95-105.
3. W.F. Dowling and J.H. Gallier, Linear time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming, 3 (1984), 267-284.
4. A. Ginsberg, Knowledge-base reduction: A new approach to checking knowledge bases for inconsistency and redundancy. Proceedings of the 7th National Conference on Artificial Intelligence (AAAI-88), 1988, pp. 585-589.
5. P.L. Hammer and A. Kogan, Horn functions and their DNFs, Information Processing Letters, 44 (1992), 23-29.
6. P.L. Hammer and A. Kogan, Optimal compression of prepositional Horn knowledge bases: complexity and approximation. Artificial Intelligence, 64 (1993), 131-145.
7. P.L. Hammer and A. Kogan, Quasi-acyclic propositional Horn knowledge bases: Optimal compression, IEEE Transactions on Knowledge and Data Engineering, 1994, accepted for publication.
8. J.P. Ignizio, Introduction to Expert Systems: The Development and Implementation of Rule-Based Expert Systems (McGraw-Hill, New York, 1991).
9. H.R. Lewis, Renaming a set of clauses as a Horn set, Journal of the ACM, 25 (1978), 134-135.
10. C.L. Lucchesi and S.L. Osborn, Candidate keys for relations, Journal of Computer and System Sciences, 17 (1978), 270-279.
11. D. Maier, Minimum covers in the relational database model, Journal of the ACM, 27 (4) (1980), 664-674.
12. M. Minoux, LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation. Information Processing Letters, 29 (1988), 1-12.
13. M. Minoux, The Unique Horn-Satisfiability problem and quadratic Boolean equations. Annals of Mathematics and Artificial Intelligence, 6 (1992), 253-266.
14. T.A. Nguyen, W.A. Perkins, T.J. Laffey and D. Pecora, Knowledge base verification, AI Magazine, 8, No. 2 (Summer 1987), 69-75.
15. W. Quine, A way to simplify truth functions, American Mathematical Monthly, 62 (1955), 627-631.
16. J.A. Robinson, A machine-oriented logic based on the resolution principle. Journal of the ACM, 12 (1965), 23-41.
17. J. Tepandi, Comparison of expert system verification criteria: redundancy, in: M. Ayel and J.-P. Laurent Eds., Validation, Verification and Test of Knowledge-based Systems (Wiley and Sons, 1991) pp. 49-62.