A lower bound on DNNF encodings of pseudo-Boolean constraints

DOI10.1007/978-3-030-51825-7_22OpenAlexW3038766755MaRDI QIDQ2661357

Alexis de Colnet

Publication date: 7 April 2021

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

zbMATH Keywords

knowledge compilationDNNFPB constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

This page was built for publication: A lower bound on DNNF encodings of pseudo-Boolean constraints