Improving Model Counting by Leveraging Definability

We present a new preprocessing technique for propositional model counting. This technique leverages definability, i.e., the ability to determine that some gates are implied by the input formula Σ. Such gates can be exploited to simplify Σ without modifying its number of models. Unlike previous techniques based on gate detection and replacement, gates do not need to be made explicit in our approach. Our preprocessing technique thus consists of two phases: computing a bipartition 〈I,O〉 of the variables of Σ where the variables from O are defined in Σ in terms of I, then eliminating some variables of O in Σ. Our experiments show the computational benefits which can be achieved by taking advantage of our preprocessing technique for model counting.

[1]  Fahiem Bacchus,et al.  Effective Preprocessing with Hyper-Resolution and Equality Reduction , 2003, SAT.

[2]  Armin Biere,et al.  Simulating Circuit-Level Simplifications on CNF , 2011, Journal of Automated Reasoning.

[3]  Armin Biere.  Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling , 2014, POS@SAT.

[4]  Marko Samer,et al.  Algorithms for propositional model counting , 2007, J. Discrete Algorithms.

[5]  Adnan Darwiche,et al.  Decomposable negation normal form , 2001, JACM.

[6]  Bernd Becker,et al.  #SAT-based vulnerability analysis of security components — A case study , 2012, 2012 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT).

[7]  Carmel Domshlak,et al.  Fast Probabilistic Planning through Weighted Model Counting , 2006, ICAPS.

[8]  Peter J. Stuckey,et al.  Projected Model Counting , 2015, ArXiv.

[9]  Toniann Pitassi,et al.  Algorithms and complexity results for #SAT and Bayesian inference , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[10]  Lakhdar Sais,et al.  Vivifying Propositional Clausal Formulae , 2008, ECAI.

[11]  Gilles Audemard,et al.  Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

[12]  Armin Biere,et al.  Efficient CNF Simplification Based on Binary Implication Graphs , 2011, SAT.

[13]  Pierre Marquis,et al.  On propositional definability , 2008, Artif. Intell..

[14]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[15]  Ronen I. Brafman,et al.  Lifted MEU by Weighted Model Counting , 2012, AAAI.

[16]  Peter J. Stuckey,et al.  #∃SAT: Projected Model Counting , 2015, SAT.

[17]  Bart Selman,et al.  Model Counting , 2021, Handbook of Satisfiability.

[18]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[20]  Adnan Darwiche,et al.  New Advances in Compiling CNF into Decomposable Negation Normal Form , 2004, ECAI.

[21]  Jean-Marie Lagniez,et al.  Preprocessing for Propositional Model Counting , 2014, AAAI.

[22]  Dhiraj K. Pradhan,et al.  NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances , 2004, SAT.

[23]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[24]  Inês Lynce,et al.  Probing-based preprocessing techniques for propositional satisfiability , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[25]  Adnan Darwiche,et al.  Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams , 2013, ECSQARU.

[26]  Blai Bonet,et al.  Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations , 2005, ICAPS.

[27]  Marc Thurley,et al.  sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP , 2006, SAT.

[28]  Alessandro Padoa.  Essai d'une théorie algébrique des nombres entiers, précédé d’une Introduction logique à une theorie déductive quelconque , 1901 .

[29]  Norbert Manthey.  Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation) , 2012, SAT.

[30]  Evert W. Beth,et al.  On Padoa’s Method in the Theory of Definition , 1953 .

[31]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[32]  Cesare Tinelli,et al.  Handbook of Satisfiability , 2021, Handbook of Satisfiability.

[33]  G. S. Tseitin.  On the Complexity of Derivation in Propositional Calculus , 1983 .

[34]  Armin Biere,et al.  Clause Elimination Procedures for CNF Formulas , 2010, LPAR.

[35]  Fabio Somenzi,et al.  Alembic: An Efficient Algorithm for CNF Preprocessing , 2007, 2007 44th ACM/IEEE Design Automation Conference.