Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression.

Peter L. Hammer, Alexander Kogan: Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression. IEEE Trans. Knowl. Data Eng. 7(5): 751-762(1995)
  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,}


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

Joint ACM SIGMOD / IEEE Computer Society Anthology

CDROM Version: Load the CDROM "Volume 3 Issue 3, TKDE 1993-1995" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX


Dana Angluin, Michael Frazier, Leonard Pitt: Learning Conjunctions of Horn Clauses. Machine Learning 9: 147-164(1992) BibTeX
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
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
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
Robert M. Colomb, Charles Y. C. Chung: Very Fast Decision Table Execution of Propositional Expert Systems. AAAI 1990: 671-676 BibTeX
Rina Dechter, Judea Pearl: Structure Identification in Relational Data. Artif. Intell. 58(1-3): 237-270(1992) BibTeX
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
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
Allen Ginsberg: Knowledge-Base Reduction: A New Approach to Checking knowledge Bases for Inconsistency and Redundancy. AAAI 1988: 585-589 BibTeX
Peter L. Hammer, Alexander Kogan: Horn Functions and Their DNFs. Inf. Process. Lett. 44(1): 23-29(1992) BibTeX
Peter L. Hammer, Alexander Kogan: Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation. Artif. Intell. 64(1): 131-145(1993) BibTeX
Harry R. Lewis: Renaming a Set of Clauses as a Horn Set. J. ACM 25(1): 134-135(1978) BibTeX
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
Tin A. Nguyen, Walton A. Perkins, Thomas J. Laffey, Deanne Pecora: Knowledge-Base Verification. AI Magazine 8(2): 69-75(1987) BibTeX
Bart Selman, Henry A. Kautz: Knowledge Compilation using Horn Approximations. AAAI 1991: 904-909 BibTeX
Robert Endre Tarjan: Depth-First Search and Linear Graph Algorithms. SIAM J. Comput. 1(2): 146-160(1972) BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
IEEE Transactions on Data and Knowledge Engineering: Copyright © by IEEE,
Joint ACM SIGMOD / IEEE Computer Society Anthology: Copyright © by ACM ( and IEEE, Corrections:
DBLP: Copyright © by Michael Ley (, last change: Sun May 17 00:28:25 2009