Disjoint essential sets of implicates of a CQ Horn function

DOI10.1007/s10472-011-9263-9zbMath1253.68310OpenAlexW2076642364WikidataQ62044331 ScholiaQ62044331MaRDI QIDQ766268

Ondřej Čepek, Petr Kučera

Publication date: 23 March 2012

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-011-9263-9

zbMATH Keywords

Boolean minimizationHorn minimizationessential setsCQ functionsexclusive setsHorn functionspropositional Horn expert systems

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Boolean functions (06E30)

Cites Work

• Unnamed Item
• Boolean functions with a simple certificate for CNF complexity
• A subclass of Horn CNFs optimally compressible in polynomial time
• Exclusive and essential sets of implicates of Boolean functions
• Horn functions and their DNFs
• Structure identification in relational data
• Horn minimization by iterative decomposition
• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• The minimum equivalent DNF problem and shortest implicants
• A Way to Simplify Truth Functions
• Minimal Representation of Directed Hypergraphs
• Minimum Covers in Relational Database Model
• Depth-First Search and Linear Graph Algorithms
• Decomposition of a Data Base and the Theory of Boolean Switching Functions

This page was built for publication: Disjoint essential sets of implicates of a CQ Horn function