
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Peter L. Hammer, Alexander Kogan, "QuasiAcyclic Propositional Horn Knowledge Bases: Optimal Compression," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 5, pp. 751762, October, 1995.  
BibTex  x  
@article{ 10.1109/69.469822, author = {Peter L. Hammer and Alexander Kogan}, title = {QuasiAcyclic Propositional Horn Knowledge Bases: Optimal Compression}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {7}, number = {5}, issn = {10414347}, year = {1995}, pages = {751762}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.469822}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  QuasiAcyclic Propositional Horn Knowledge Bases: Optimal Compression IS  5 SN  10414347 SP751 EP762 EPD  751762 A1  Peter L. Hammer, A1  Alexander Kogan, PY  1995 KW  Expert systems KW  propositional knowledge bases KW  Horn clauses KW  logical equivalence KW  Boolean functions KW  logic minimization KW  knowledge compression KW  acyclic rule bases. VL  7 JA  IEEE Transactions on Knowledge and Data Engineering ER   
This paper deals with the minimization of
[1] D. Angluin,Learning Propositional Horn Sentences with Hints, technical report Yale/DCS/RR590, Dept. of Computer Science,Yale Univ., 1987.
[2] D. Angluin,M. Frazier,, and L. Pitt,“Learning conjunctions of Horn clauses,” Machine Learning, vol. 9, pp. 147164, 1992.
[3] B. Apsvall,M.F. Plass,, and R.E Tarjan,“A lineartime algorithm for testing the truth of certain quantified Boolean formulas,” Information Processing Letters, vol. 8, pp. 121123, 1979.
[4] O. Cepek,Restricted Consensus Method and Quadratic Implicates of Pure HornFunctions, RUTCOR Research Report, RRR 3194, Rutgers Univ., New Brunswick, N.J., Sept. 1994.
[5] E. Boros,Y. Crama,, and P.L. Hammer,“Polynomialtime inference of all valid implications for Horn and related formulae,” Annals of Mathematics and Artificial Intelligence, vol. 1, pp. 2132, 1990.
[6] V. Chandru,C.R. Coullard,P.L. Hammer,M. Montanez,, and X. Sun,“On renamable Horn and generalized Horn functions,” Annals of Mathematics and Artificial Intelligence, vol. 1, pp. 3347, 1990.
[7] E. Charles and O. Dubois, "MELODIA: Logical Methods for Checking Knowledge Bases," Validation, Verification and Test of Knowledge Based Systems, M. Ayel and J.P. Laurent, eds. Chichester, U.K.: John Wiley, 1991.
[8] R.M. Colomb and C.Y.C. Chung,“Very fast decision table execution of propositional expert systems,” Proc. Eighth Nat’l Conf. Artificial Intelligence (AAAI 90), pp. 671676, 1990.
[9] R. Dechter and J. Pearl,“Structure identification in relational data,” Artificial Intelligence, vol. 58, pp. 237270, 1992.
[10] W.F. Dowling and J.H. Gallier,“Linear time algorithms for testing the satisfiability of propositional Horn formulae,” J. Logic Programming, vol. 3, pp. 267284, 1984.
[11] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.New York: W.H. Freeman, 1979.
[12] A. Ginsberg,“Knowledgebase reduction: A new approach to checking knowledge bases for inconsistency&redundancy,” Proc. Seventh Nat’l Conf. Artificial Intelligence (AAAI 88), pp. 585589, 1988.
[13] F. Glover and H.J. Greenberg,“Logical testing for rulebase management,” Annals of Operations Research, vol. 12, pp. 199215, 1988.
[14] P.L. Hammer and A. Kogan,“Horn functions and their DNFs,” Information Processing Letters, vol. 44, pp. 2329, 1992.
[15] P.L. Hammer and A. Kogan,Horn Function Minimization and Knowledge Compression in Production RuleBases, RUTCOR Research Report RRR 892, Rutgers Univ., New Brunswick, N.J., Mar. 1992.
[16] P.L. Hammer and A. Kogan,“Optimal compression of propositional Horn knowledge bases: Complexity and approximation,” Artificial Intelligence, vol. 64, pp. 131145, 1993.
[17] P.L Hammer and B. Simeone,“Quadratic functions of binary variables,” in Combinatorial Optimization, B. Simeone, ed. Lecture Notes in Mathematics 1403.Berlin: SpringerVerlag, pp. 156, 1989.
[18] J.P. Ignizio, Introduction to Expert Systems: The Development and Implementation of RuleBased Expert Systems. McGrawHill, 1991.
[19] H.R. Lewis,“Renaming a set of clauses as a Horn set,” J. ACM, vol. 25, pp. 134135, 1978.
[20] M. Minoux,“LTUR: A simplified lineartime unit resolution algorithm for Horn formulae and computer implementation,” Information Processing Letters, vol. 29, pp. 112, 1988.
[21] M. Minoux,“The Unique Hornsatisfiability problem and quadratic Boolean equations,” Annals of Mathematics and Artificial Intelligence, vol. 6, pp. 253266, 1992.
[22] T.A. Nguyen, W.A. Perkins, T.J. Laffey, and D. Pecora, “Knowledge Base Verification,” AI Magazine, pp. 69–75, Summer 1987.
[23] W. Quine,“A way to simplify truth functions,” Am. Math. Monthly, vol. 62, pp. 627631, 1955.
[24] B. Selman and H. Kautz,“Knowledge compilation using Horn approximations,” Proc. Ninth Nat’l Conf. Artificial Intelligence (AAAI 91), pp. 904909, 1991.
[25] R.E. Tarjan,“Depth first search and linear graph algorithms,” SIAM J. Computing, vol. 1, no. 2, pp. 146160, 1972.
[26] J. Tepandi,“Comparison of exper1708t system verification criteria: Redundancy,” Validation, Verification, and Test of Knowledgebased Systems, M. Ayel and J.P. Laurent, eds. Wiley∧Sons, 1991, pp. 4962.