Recognition of interval Boolean functions

DOI10.1007/s10472-008-9094-5zbMath1171.06007OpenAlexW2145704678WikidataQ62044336 ScholiaQ62044336MaRDI QIDQ1029585

David Kronus, Petr Kučera, Ondřej Čepek

Publication date: 13 July 2009

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

Full work available at URL: https://doi.org/10.1007/s10472-008-9094-5

zbMATH Keywords

Boolean functionspolynomial-time algorithmdisjunctive normal formknowledge compressionpartially defined Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Boolean functions (06E30)

Related Items (3)

Relations between threshold and \(k\)-interval Boolean functions ⋮ Properties of Switch-List Representations of Boolean Functions ⋮ Recognition of tractable DNFs representable by a constant number of intervals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Horn functions and their DNFs
• Error-free and best-fit extensions of partially defined Boolean functions
• Computing the minimum DNF representation of Boolean functions defined by intervals
• The Problem of Simplifying Truth Functions

This page was built for publication: Recognition of interval Boolean functions