Optimal compression of propositional Horn knowledge bases: Complexity and approximation
type: Item
instance of: scholarly article
title: Optimal compression of propositional Horn knowledge bases: Complexity and approximation
zbMATH Open document ID: 0935.68105
DOI: 10.1016/0004-3702(93)90062-G
author: Peter L. Hammer
author: Alex Kogan
published in: Artificial Intelligence
publication date: 2000-04-24T00:00:00Z
Mathematics Subject Classification ID: 68T35
zbMATH DE Number: 500712
zbMATH Keywords: optimal compression
zbMATH Keywords: propositional Horn production rule
zbMATH Keywords: knowledge bases
zbMATH Keywords: NP-completeness
zbMATH Keywords: Boolean function
MaRDI profile type: Publication
cites work: Learning conjunctions of Horn clauses
cites work: Structure identification in relational data
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q4198056
cites work: Horn functions and their DNFs
cites work: A Way to Simplify Truth Functions
description: scientific article; zbMATH DE number 500712