Efficient Knowledge Compilation Beyond Weighted Model Counting. Issue 4 (3rd July 2022)

• Record Type: Journal Article
• Authors: KIESEL, RAFAEL; TOTIS, PIETRO; KIMMIG, ANGELIKA
• Is Part Of: Theory and practice of logic programming. Volume 22:Issue 4(2022)
• Page Start: 505
• Page End: 522
• Publication Date: 2022-07-03
• Subjects: design -- analysis and implementation of languages -- logic programming methodology and applications; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S147106842200014X
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: Quantitative extensions of logic programming often require the solution of so called second level inference tasks, that is, problems that involve a third operation, such as maximization or normalization, on top of addition and multiplication, and thus go beyond the well-known weighted or algebraic model counting setting of probabilistic logic programming under the distribution semantics. We introduce Second Level Algebraic Model Counting (2AMC) as a generic framework for these kinds of problems. As 2AMC is to (algebraic) model counting what forall-exists-SAT is to propositional satisfiability, it is notoriously hard to solve. First level techniques based on Knowledge Compilation (KC) have been adapted for specific 2AMC instances by imposing variable order constraints on the resulting circuit. However, those constraints can severely increase the circuit size and thus decrease the efficiency of such approaches. We show that we can exploit the logical structure of a 2AMC problem to omit parts of these constraints, thus limiting the negative effect. Furthermore, we introduce and implement a strategy to generate a sufficient set of constraints statically, with a priori guarantees for the performance of KC. Our empirical evaluation on several benchmarks and tasks confirms that our theoretical results can translate into more efficient solving in practice.