Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression.

@article{DBLP:journals/tkde/HammerK95,
  author    = {Peter L. Hammer and
               Alexander Kogan},
  title     = {Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {7},
  number    = {5},
  year      = {1995},
  pages     = {751-762},
  ee        = {db/journals/tkde/HammerK95.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1995 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

...

[2]

Dana Angluin, Michael Frazier, Leonard Pitt: Learning Conjunctions of Horn Clauses. Machine Learning 9: 147-164(1992) BibTeX

[3]

Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Inf. Process. Lett. 8(3): 121-123(1979) BibTeX

[4]

...

[5]

Endre Boros, Yves Crama, Peter L. Hammer: Polynomial-Time Inference of All Valid Implications for Horn and Related Formulae. Ann. Math. Artif. Intell. 1: 21-32(1990) BibTeX

[6]

V. Chandru, Collette R. Coullard, Peter L. Hammer, M. Montanuz, X. Sun: On Renamable Horn and Generalized Horn Functions. Ann. Math. Artif. Intell. 1: (1990) BibTeX

[7]

...

[8]

Robert M. Colomb, Charles Y. C. Chung: Very Fast Decision Table Execution of Propositional Expert Systems. AAAI 1990: 671-676 BibTeX

[9]

Rina Dechter, Judea Pearl: Structure Identification in Relational Data. Artif. Intell. 58(1-3): 237-270(1992) BibTeX

[10]

William F. Dowling, Jean H. Gallier: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. Log. Program. 1(3): 267-284(1984) BibTeX

[11]

M. R. Garey, David S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman 1979, ISBN 0-7167-1044-7
BibTeX

[12]

Allen Ginsberg: Knowledge-Base Reduction: A New Approach to Checking knowledge Bases for Inconsistency and Redundancy. AAAI 1988: 585-589 BibTeX

[13]

...

[14]

Peter L. Hammer, Alexander Kogan: Horn Functions and Their DNFs. Inf. Process. Lett. 44(1): 23-29(1992) BibTeX

[15]

...

[16]

Peter L. Hammer, Alexander Kogan: Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation. Artif. Intell. 64(1): 131-145(1993) BibTeX

[17]

...

[18]

...

[19]

Harry R. Lewis: Renaming a Set of Clauses as a Horn Set. J. ACM 25(1): 134-135(1978) BibTeX

[20]

Michel Minoux: LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. Inf. Process. Lett. 29(1): 1-12(1988) BibTeX

[21]

...

[22]

Tin A. Nguyen, Walton A. Perkins, Thomas J. Laffey, Deanne Pecora: Knowledge-Base Verification. AI Magazine 8(2): 69-75(1987) BibTeX

[23]

...

[24]

Bart Selman, Henry A. Kautz: Knowledge Compilation using Horn Approximations. AAAI 1991: 904-909 BibTeX

[25]

Robert Endre Tarjan: Depth-First Search and Linear Graph Algorithms. SIAM J. Comput. 1(2): 146-160(1972) BibTeX

[26]

...