Enhancing query efficiency for D-DNNF representations through preprocessing

DOI10.1007/978-3-032-04590-4_9MaRDI QIDQ6884718zbMATH OpenFDO

Authors Jean-Marie Lagniez, Emmanuel Lonca

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-032-04590-4_9

zbMATH Keywords

uniform samplingdirect accesspreprocessing techniquesmodel enumerationdecision-DNNF

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• An introduction to variational methods for graphical models
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Blocked clause elimination
• Boosting definability bipartition computation using SAT witnesses
• Computing thejth solution of a first-order query
• Definability for model counting
• Knowledge compilation meets uniform sampling
• Logic for explainable AI
• On preprocessing techniques and their impact on propositional model counting
• Random generation of combinatorial structures from a uniform distribution
• STRIPS: A new approach to the application of theorem proving to problem solving
• Solution validation and extraction for QBF preprocessing
• Theory and Applications of Satisfiability Testing

This page was built for publication: Enhancing query efficiency for D-DNNF representations through preprocessing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884718)