No Efficient Disjunction or Conjunction of Switch-Lists

DOI10.3233/SAT-220002zbMath1495.68221arXiv2203.04788OpenAlexW4224882663MaRDI QIDQ5080958

Stefan Mengel

Publication date: 1 June 2022

Published in: Journal on Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.04788

zbMATH Keywords

knowledge compilationswitch-lists

Mathematics Subject Classification ID

Knowledge representation (68T30) Boolean functions (06E30)

Cites Work

• Unnamed Item
• Disjunctive closures for knowledge compilation
• Recognition of tractable DNFs representable by a constant number of intervals
• Computing the minimum DNF representation of Boolean functions defined by intervals
• Properties of Switch-List Representations of Boolean Functions

This page was built for publication: No Efficient Disjunction or Conjunction of Switch-Lists