Exclusive and essential sets of implicates of Boolean functions
type: Item
instance of: scholarly article
title: Exclusive and essential sets of implicates of Boolean functions
zbMATH Open document ID: 1194.06010
author: Endre Boros
author: Ondřej Čepek
author: Alex Kogan
author: Petr Kučera
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 06E30
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 5703710
zbMATH Keywords: Horn function
zbMATH Keywords: Boolean minimization
zbMATH Keywords: essential set
zbMATH Keywords: exclusive set
Wikidata QID: Q59560551
MaRDI profile type: Publication
full work available at URL: j.dam.2009.08.012
OpenAlex ID: W2108552370
cites work: Minimal Representation of Directed Hypergraphs
cites work: Horn minimization by iterative decomposition
cites work: Q4488342
cites work: Q4138187
cites work: Decomposition of a Data Base and the Theory of Boolean Switching Functions
cites work: Q3789107
cites work: Horn functions and their DNFs
cites work: Optimal compression of propositional Horn knowledge bases: Complexity and approximation
cites work: Minimum Covers in Relational Database Model
cites work: The Problem of Simplifying Truth Functions
cites work: A Way to Simplify Truth Functions
cites work: Depth-First Search and Linear Graph Algorithms
cites work: The minimum equivalent DNF problem and shortest implicants
DOI: 10.1016/J.DAM.2009.08.012
description: scientific article; zbMATH DE number 5703710