On computing minimal independent support and its applications to sampling and counting

DOI10.1007/s10601-015-9204-zzbMath1334.90146OpenAlexW2236948976MaRDI QIDQ265701

Moshe Y. Vardi, Alexander Ivrii, Sharad Malik, Kuldeep S. Meel

Publication date: 12 April 2016

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1911/81710

zbMATH Keywords

independent supportmodel countingSAT sampling

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (8)

Counting minimal unsatisfiable subsets ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ Projected model counting: beyond independent support ⋮ Model counting with error-correcting codes ⋮ Unnamed Item ⋮ Timed automata relaxation for reachability ⋮ Definability for model counting ⋮ Unnamed Item

Uses Software

• MUSer2

Cites Work

• A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
• Random generation of combinatorial structures from a uniform distribution
• Redundancy in logic. I: CNF propositional formulae
• Algorithms for computing minimal unsatisfiable subsets of constraints
• Analysis of symbolic sequences using the Jensen-Shannon divergence
• Short XORs for Model Counting: From Theory to Practice
• The Complexity of Enumeration and Reliability Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On computing minimal independent support and its applications to sampling and counting