A simple heuristic for knowledge base compression

MaRDI QIDQ1769110zbMATH OpenFDO

Authors Ondřej Čepek

Publication date 18 March 2005

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

Boolean techniquecomplexitydefinite Horn Boolean formulas

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• Algorithms of compacting the knowledge base by sample data
• scientific article; zbMATH DE number 549989
• A kind of logical compilation for knowledge bases
• Compilability and compact representations of revision of Horn knowledge bases

Cited in

(5)

• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• Algorithms of compacting the knowledge base by sample data
• Redundancy in logic. I: CNF propositional formulae
• scientific article; zbMATH DE number 1950783 (Why is no real title available?)
• Logics in Artificial Intelligence

This page was built for publication: A simple heuristic for knowledge base compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1769110)