Properties of Switch-List Representations of Boolean Functions

DOI10.1613/jair.1.12199zbMath1490.68216OpenAlexW3097852793MaRDI QIDQ5130011

Miloš Chromý, Ondřej Čepek

Publication date: 3 November 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.12199

zbMATH Keywords

knowledge representationdecision treessatisfiability

Mathematics Subject Classification ID

Knowledge representation (68T30) Boolean functions (06E30) Data structures (68P05)

Related Items (1)

No Efficient Disjunction or Conjunction of Switch-Lists

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition method for CNF minimality proofs
• A subclass of Horn CNFs optimally compressible in polynomial time
• Recognition of interval Boolean functions
• Optimal compression of propositional Horn knowledge bases: Complexity and approximation
• Efficient algorithms for the transformation between different types of binary decision diagrams
• The minimum equivalent DNF problem and shortest implicants
• Recognition of tractable DNFs representable by a constant number of intervals
• Computing the minimum DNF representation of Boolean functions defined by intervals
• Graph-Based Algorithms for Boolean Function Manipulation
• Minimal Representation of Directed Hypergraphs

This page was built for publication: Properties of Switch-List Representations of Boolean Functions