2 papers
cs.LO2025
Boolean basis, formula size, and number of modal operators
Christoph Berkholz, Dietrich Kuske, Christian Schwarz
Is it possible to write significantly smaller formulae when using Boolean operators other than those of the De Morgan basis (and, or, not, and the constants)? For propositional log…
cs.LO2024
A characterization of efficiently compilable constraint languages
Christoph Berkholz, Stefan Mengel, Hermann Wilhelm
A central task in knowledge compilation is to compile a CNF-SAT instance into a succinct representation format that allows efficient operations such as testing satisfiability, coun…