Panini: An Efficient and Flexible Knowledge Compiler

Download PDF
Open Webpage

Yong Lai, Kuldeep S. Meel, Roland H. C. Yap

Published: 2025, Last Modified: 23 Oct 2025CAV (3) 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Knowledge compilation (KC) involves compiling propositional constraints into tractable target languages which in turn efficiently support multiple analyses or queries of the constraints. Solving these queries plays a crucial role in the synthesis and verification of hardware and software systems. Recently, we proposed the target language, Constrained Conjunction & Decision Diagrams (CCDD), experimentally shown to be promising for individual model counting queries. Here, we present the compiler, \(\textsf{Panini}\), which compiles CNF into CCDD.