Kuldeep S. Meel

Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Total Variation Distance Meets Probabilistic Inference.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability.

[BibT_eX]

[DOI]

Antoine Amarilli

Timothy van Bremen

Proceedings of the 27th International Conference on Database Theory, 2024

Locally-Minimal Probabilistic Explanations.

[BibT_eX]

[DOI]

Yacine Izza

João Marques-Silva

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Engineering an Efficient Preprocessor for Model Counting.

[BibT_eX]

[DOI]

Proceedings of the 61st ACM/IEEE Design Automation Conference, 2024

Formally Certified Approximate Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 36th International Conference, 2024

Improved Streaming Algorithm for the Klee's Measure Problem and Generalizations.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2024

Equivalence Testing: The Power of Bounded Adaptivity.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

Engineering an Exact Pseudo-Boolean Model Counter.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

An Approximate Skolem Function Counter.

[BibT_eX]

[DOI]

Brendan Juba

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Auditable Algorithms for Approximate Model Counting.

[BibT_eX]

[DOI]

S. Akshay

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Exact ASP Counting with Compact Encodings.

[BibT_eX]

[DOI]

Mohimenul Kabir

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Data for An Approximate Skolem Funcion Counter (AAAI-24 paper).

[BibT_eX]

[DOI]

Dataset, December, 2023

Model Counting Meets F0 Estimation.

[BibT_eX]

[DOI]

A. Pavan

N. Variyam Vinodchandran

Arnab Bhattacharyya

ACM Trans. Database Syst., September, 2023

Model Counting Meets Distinct Elements.

[BibT_eX]

[DOI]

Commun. ACM, September, 2023

Total Variation Distance Estimation Is as Easy as Probabilistic Inference.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

Tolerant Testing of High-Dimensional Samplers with Subcube Conditioning.

[BibT_eX]

[DOI]

Gunjan Kumar

CoRR, 2023

Explaining SAT Solving Using Causal Reasoning.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Probabilistic Query Evaluation: The Combined FPRAS Landscape.

[BibT_eX]

[DOI]

Timothy van Bremen

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Support Size Estimation: The Power of Conditioning.

[BibT_eX]

[DOI]

Diptarka Chakraborty

Gunjan Kumar

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

A Fast and Accurate ASP Counting Based Network Reliability Estimator.

[BibT_eX]

[DOI]

Mohimenul Kabir

Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

Scalable Probabilistic Routes.

[BibT_eX]

[DOI]

Victor C. Liang

Proceedings of 1st Workshop on AI-driven heterogeneous data management: Completing, 2023

Engineering an Efficient Approximate DNF-Counter.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Solving the Identifying Code Set Problem with Grouped Independent Support.

[BibT_eX]

[DOI]

Anna L. D. Latour

Arunabha Sen

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On Approximating Total Variation Distance.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Distribution Testing: The New Frontier for Formal Methods.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer-Aided Design, 2023

"How Biased are Your Features?": Computing Fairness Influence Functions with Global Sensitivity Analysis.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 2023

Synthesis with Explicit Dependencies.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2023

Rounding Meets Approximate Model Counting.

[BibT_eX]

[DOI]

Jiong Yang

Proceedings of the Computer Aided Verification - 35th International Conference, 2023

Testing of Horn Samplers.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Constraint Optimization over Semirings.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fast Converging Anytime Model Counting.

[BibT_eX]

[DOI]

Yong Lai

Roland H. C. Yap

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Model Counting Meets Distinct Elements in a Data Stream.

[BibT_eX]

[DOI]

SIGMOD Rec., 2022

Efficient Learning of Interpretable Classification Rules.

[BibT_eX]

[DOI]

Dmitry Malioutov

J. Artif. Intell. Res., 2022

How Biased is Your Feature?: Computing Fairness Influence Functions with Global Sensitivity Analysis.

[BibT_eX]

[DOI]

CoRR, 2022

CCDD: A Tractable Representation for Model Counting and Uniform Sampling.

[BibT_eX]

[DOI]

Yong Lai

Roland H. C. Yap

CoRR, 2022

Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size.

[BibT_eX]

[DOI]

N. V. Vinodchandran

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

On Scalable Testing of Samplers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing.

[BibT_eX]

[DOI]

Remi Delannoy

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Counting, Sampling, and Synthesis: The Quest for Scalability.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

A Scalable t-wise Coverage Estimator.

[BibT_eX]

[DOI]

N. Variyam Vinodchandran

Proceedings of the 44th IEEE/ACM 44th International Conference on Software Engineering, 2022

Arjun: An Efficient Independent Support Computation Technique and its Applications to Counting and Sampling.

[BibT_eX]

[DOI]

Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, 2022

INC: A Scalable Incremental Weighted Sampler.

[BibT_eX]

[DOI]

Victor C. Liang

Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

Distinct Elements in Streams: An Algorithm for the (Text) Book.

[BibT_eX]

[DOI]

N. V. Vinodchandran

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

On Quantitative Testing of Samplers.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

A Scalable Shannon Entropy Estimator.

[BibT_eX]

[DOI]

Brendan Juba

Proceedings of the Computer Aided Verification - 34th International Conference, 2022

Projected Model Counting: Beyond Independent Support.

[BibT_eX]

[DOI]

Jiong Yang

Proceedings of the Automated Technology for Verification and Analysis, 2022

Constraint-Driven Explanations for Black-Box ML Models.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

ApproxASP - a Scalable Approximate Answer Set Counter.

[BibT_eX]

[DOI]

Johannes Klaus Fichte

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Algorithmic Fairness Verification with Graphical Models.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Approximate Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Satisfiability - Second Edition, 2021

Model Counting meets F0 Estimation.

[BibT_eX]

[DOI]

CoRR, 2021

Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving.

[BibT_eX]

[DOI]

Nicolas Prevot

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Model Counting meets F0 Estimation.

[BibT_eX]

[DOI]

Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Estimating the Size of Union of Sets in Streaming Models.

[BibT_eX]

[DOI]

N. V. Vinodchandran

Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Testing Probabilistic Circuits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Gaussian Elimination Meets Maximum Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Program Synthesis as Dependency Quantified Formula Modulo Theory.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Partition Function Estimation: A Quantitative Study.

[BibT_eX]

[DOI]

Durgesh Agrawal

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Scalable Quantitative Verification For Deep Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering, 2021

Engineering an Efficient Boolean Functional Synthesis Engine.

[BibT_eX]

[DOI]

Proceedings of the IEEE/ACM International Conference On Computer Aided Design, 2021

Designing Samplers is Easy: The Boon of Testers.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Computer Aided Design, 2021

On the Usefulness of Linear Modular Arithmetic in Constraint Programming.

[BibT_eX]

[DOI]

Gilles Pesant

Mahshid Mohammadalitajrishi

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

Engineering an Efficient PB-XOR Solver.

[BibT_eX]

[DOI]

Jiong Yang

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Counting Minimal Unsatisfiable Subsets.

[BibT_eX]

[DOI]

Jaroslav Bendík

Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Predicting Forest Fire Using Remote Sensing Data And Machine Learning.

[BibT_eX]

[DOI]

Massimo Lupascu

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

The Power of Literal Equivalence in Model Counting.

[BibT_eX]

[DOI]

Yong Lai

Roland H. C. Yap

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Justicia: A Stochastic SAT Approach to Formally Verify Fairness.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Symmetric Component Caching for Model Counting on Combinatorial Instances.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Counting Maximal Satisfiable Subsets.

[BibT_eX]

[DOI]

Jaroslav Bendík

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Dataset for Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice.

[BibT_eX]

[DOI]

S. Akshay

Dataset, April, 2020

Induction Models on \mathbb{N}.

[BibT_eX]

[DOI]

A. Dileep

Ammar Fathin Sabili

CoRR, 2020

A Study of Symmetry Breaking Predicates and Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Baital: an adaptive weighted sampling approach for improved t-wise coverage.

[BibT_eX]

[DOI]

Eduard Baranov

Axel Legay

Proceedings of the ESEC/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2020

Designing New Phase Selection Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

On the Sparsity of XORs in Approximate Model Counting.

[BibT_eX]

[DOI]

Durgesh Agrawal

Bhavishya

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

On Testing of Samplers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Taming Discrete Integration via the Boon of Dimensionality.

[BibT_eX]

[DOI]

Jeffrey M. Dudek

Dror Fried

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Efficient Distance Approximation for Structured High-Dimensional Distributions via Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Induction Models on N.

[BibT_eX]

[DOI]

A. Dileep

Ammar Fathin Sabili

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice.

[BibT_eX]

[DOI]

S. Akshay

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Classification Rules in Relaxed Logical Form.

[BibT_eX]

[DOI]

Dmitry Malioutov

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Phase Transition Behavior in Knowledge Compilation.

[BibT_eX]

[DOI]

Rahul Gupta

Proceedings of the Principles and Practice of Constraint Programming, 2020

Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling.

[BibT_eX]

[DOI]

Stephan Gocht

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Manthan: A Data-Driven Approach for Boolean Function Synthesis.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Approximate Counting of Minimal Unsatisfiable Subsets.

[BibT_eX]

[DOI]

Jaroslav Bendík

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

A MaxSAT-Based Framework for Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Principled network reliability approximation: A counting-based approach.

[BibT_eX]

[DOI]

Roger Paredes

Leonardo Dueñas-Osorio

Reliab. Eng. Syst. Saf., 2019

Semantically-Regularized Logic Graph Embeddings.

[BibT_eX]

[DOI]

CoRR, 2019

Not all FPRASs are equal: demystifying FPRASs for DNF-counting.

[BibT_eX]

[DOI]

Aditya A. Shrotri

Constraints An Int. J., 2019

WAPS: Weighted and Projected Sampling.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

CrystalBall: Gazing in the Black Box of SAT Solving.

[BibT_eX]

[DOI]

Raghav Kulkarni

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Assessing Heuristic Machine Learning Explanations with Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Embedding Symbolic Knowledge into Deep Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

GANAK: A Scalable Probabilistic Exact Model Counter.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Phase Transition Behavior of Cardinality and XOR Constraints.

[BibT_eX]

[DOI]

Saurabh Joshi

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting (Extended Abstract).

[BibT_eX]

[DOI]

Aditya A. Shrotri

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Bosphorus: Bridging ANF and CNF Solvers.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2019

Dual Hashing-Based Algorithms for Discrete Integration.

[BibT_eX]

[DOI]

Alexis de Colnet

Proceedings of the Principles and Practice of Constraint Programming, 2019

Quantitative Verification of Neural Networks and Its Security Applications.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

IMLI: An Incremental Framework for MaxSAT-Based Learning of Interpretable Classification Rules.

[BibT_eX]

[DOI]

Proceedings of the 2019 AAAI/ACM Conference on AI, Ethics, and Society, 2019

BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

On the Hardness of Probabilistic Inference Relaxations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

On Testing of Uniform Samplers.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Constrained Counting and Sampling: Bridging the Gap between Theory and Practice.

[BibT_eX]

[DOI]

CoRR, 2018

Network Reliability Estimation in Theory and Practice.

[BibT_eX]

[DOI]

Roger Paredes

Leonardo Dueñas-Osorio

CoRR, 2018

Scalable Approximation of Quantitative Information Flow in Programs.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Knowledge Compilation meets Uniform Sampling.

[BibT_eX]

[DOI]

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

MLIC: A MaxSAT-Based Framework for Learning Interpretable Classification Rules.

[BibT_eX]

[DOI]

Dmitry Malioutov

Proceedings of the Principles and Practice of Constraint Programming, 2018

2017

The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas.

[BibT_eX]

[DOI]

Jeffrey M. Dudek

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Hashing-Based Approaches to Approximate DNF-Counting.

[BibT_eX]

[DOI]

Aditya A. Shrotri

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Counting-Based Reliability Estimation for Power-Transmission Grids.

[BibT_eX]

[DOI]

Leonardo Dueñas-Osorio

Roger Paredes

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

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

[BibT_eX]

[DOI]

Constraints An Int. J., 2016

Combining the k-CNF and XOR Phase-Transitions.

[BibT_eX]

[DOI]

Jeffrey M. Dudek

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Design and Verification of Distributed Phasers.

[BibT_eX]

[DOI]

John M. Mellor-Crummey

Proceedings of the Euro-Par 2016: Parallel Processing, 2016

Automatic data layout generation and kernel mapping for CPU+GPU architectures.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Compiler Construction, 2016

Constrained Sampling and Counting: Universal Hashing Meets SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Beyond NP, 2016

Approximate Probabilistic Inference via Word-Level Counting.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Distributed Phasers.

[BibT_eX]

[DOI]

Sri Raj Paul

Karthik Murthy

John M. Mellor-Crummey

CoRR, 2015

On Parallel Scalable Uniform SAT Witness Generation.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

From Weighted to Unweighted Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Sampling Techniques for Boolean Satisfiability.

[BibT_eX]

[DOI]

CoRR, 2014

Balancing Scalability and Uniformity in SAT Witness Generator.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Design Automation Conference 2014, 2014

Distribution-Aware Sampling and Weighted Model Counting for SAT.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

ADHA: automatic data layout framework for heterogeneous architectures.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Parallel Architectures and Compilation, 2014

2013

A Scalable Approximate Model Counter.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2013

A Scalable and Nearly Uniform Generator of SAT Witnesses.

[BibT_eX]

[DOI]