Optimal compression of propositional Horn knowledge bases: complexity and approximation
Authors:
- 1 November 1993
- journal article
- research article
- Published by Elsevier in Artificial Intelligence
- Vol. 64 (1) , 131-145
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Structure identification in relational dataArtificial Intelligence, 1992
- Horn functions and their DNFsInformation Processing Letters, 1992
- Learning conjunctions of Horn clausesMachine Learning, 1992
- Logical testing for rule-base managementAnnals of Operations Research, 1988
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- A Way to Simplify Truth FunctionsThe American Mathematical Monthly, 1955