Kuldeep S. Meel

Orcid: 0000-0001-9423-5270

Affiliations:
  • National University of Singapore, School of Computing


According to our database1, Kuldeep S. Meel authored at least 123 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Equivalence Testing: The Power of Bounded Adaptivity.
CoRR, 2024

Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability.
Proceedings of the 27th International Conference on Database Theory, 2024

Engineering an Exact Pseudo-Boolean Model Counter.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

An Approximate Skolem Function Counter.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Auditable Algorithms for Approximate Model Counting.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Exact ASP Counting with Compact Encodings.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Model Counting Meets <i>F</i><sub>0</sub> Estimation.
ACM Trans. Database Syst., September, 2023

Model Counting Meets Distinct Elements.
Commun. ACM, September, 2023

Total Variation Distance Estimation Is as Easy as Probabilistic Inference.
Electron. Colloquium Comput. Complex., 2023

A faster FPRAS for #NFA.
CoRR, 2023

Locally-Minimal Probabilistic Explanations.
CoRR, 2023

Tolerant Testing of High-Dimensional Samplers with Subcube Conditioning.
CoRR, 2023

Explaining SAT Solving Using Causal Reasoning.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

Probabilistic Query Evaluation: The Combined FPRAS Landscape.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Support Size Estimation: The Power of Conditioning.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Scalable Probabilistic Routes.
Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

A Fast and Accurate ASP Counting Based Network Reliability Estimator.
Proceedings of the LPAR 2023: Proceedings of 24th International Conference on Logic for Programming, 2023

Engineering an Efficient Approximate DNF-Counter.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Solving the Identifying Code Set Problem with Grouped Independent Support.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On Approximating Total Variation Distance.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle?
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Distribution Testing: The New Frontier for Formal Methods.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

"How Biased are Your Features?": Computing Fairness Influence Functions with Global Sensitivity Analysis.
Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 2023

Synthesis with Explicit Dependencies.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2023

Rounding Meets Approximate Model Counting.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

Testing of Horn Samplers.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Constraint Optimization over Semirings.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fast Converging Anytime Model Counting.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Model Counting Meets Distinct Elements in a Data Stream.
SIGMOD Rec., 2022

Efficient Learning of Interpretable Classification Rules.
J. Artif. Intell. Res., 2022

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

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

Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

On Scalable Testing of Samplers.
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.
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.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

A Scalable t-wise Coverage Estimator.
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.
Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, 2022

INC: A Scalable Incremental Weighted Sampler.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

Distinct Elements in Streams: An Algorithm for the (Text) Book.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

On Quantitative Testing of Samplers.
Proceedings of the 28th International Conference on Principles and Practice of Constraint Programming, 2022

A Scalable Shannon Entropy Estimator.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

Projected Model Counting: Beyond Independent Support.
Proceedings of the Automated Technology for Verification and Analysis, 2022

Constraint-Driven Explanations for Black-Box ML Models.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

ApproxASP - a Scalable Approximate Answer Set Counter.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Algorithmic Fairness Verification with Graphical Models.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Approximate Model Counting.
Proceedings of the Handbook of Satisfiability - Second Edition, 2021

Model Counting meets F0 Estimation.
CoRR, 2021

Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Model Counting meets F<sub>0</sub> Estimation.
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.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

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

Gaussian Elimination Meets Maximum Satisfiability.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Program Synthesis as Dependency Quantified Formula Modulo Theory.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Partition Function Estimation: A Quantitative Study.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Scalable Quantitative Verification For Deep Neural Networks.
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering, 2021

Engineering an Efficient Boolean Functional Synthesis Engine.
Proceedings of the IEEE/ACM International Conference On Computer Aided Design, 2021

Designing Samplers is Easy: The Boon of Testers.
Proceedings of the Formal Methods in Computer Aided Design, 2021

On the Usefulness of Linear Modular Arithmetic in Constraint Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

Engineering an Efficient PB-XOR Solver.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Counting Minimal Unsatisfiable Subsets.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Predicting Forest Fire Using Remote Sensing Data And Machine Learning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

The Power of Literal Equivalence in Model Counting.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Justicia: A Stochastic SAT Approach to Formally Verify Fairness.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Symmetric Component Caching for Model Counting on Combinatorial Instances.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Counting Maximal Satisfiable Subsets.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Induction Models on \mathbb{N}.
CoRR, 2020

A Study of Symmetry Breaking Predicates and Model Counting.
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.
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.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

On the Sparsity of XORs in Approximate Model Counting.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

On Testing of Samplers.
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.
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.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Induction Models on N.
Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

Sparse Hashing for Scalable Approximate Model Counting: Theory and Practice.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Classification Rules in Relaxed Logical Form.
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.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Manthan: A Data-Driven Approach for Boolean Function Synthesis.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Approximate Counting of Minimal Unsatisfiable Subsets.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

A MaxSAT-Based Framework for Group Testing.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Principled network reliability approximation: A counting-based approach.
Reliab. Eng. Syst. Saf., 2019

Semantically-Regularized Logic Graph Embeddings.
CoRR, 2019

Not all FPRASs are equal: demystifying FPRASs for DNF-counting.
Constraints An Int. J., 2019

WAPS: Weighted and Projected Sampling.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

CrystalBall: Gazing in the Black Box of SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Assessing Heuristic Machine Learning Explanations with Model Counting.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Embedding Symbolic Knowledge into Deep Networks.
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.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Phase Transition Behavior of Cardinality and XOR Constraints.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting (Extended Abstract).
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Bosphorus: Bridging ANF and CNF Solvers.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2019

Dual Hashing-Based Algorithms for Discrete Integration.
Proceedings of the Principles and Practice of Constraint Programming, 2019

Quantitative Verification of Neural Networks and Its Security Applications.
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.
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.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

On the Hardness of Probabilistic Inference Relaxations.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

On Testing of Uniform Samplers.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

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

Network Reliability Estimation in Theory and Practice.
CoRR, 2018

Scalable Approximation of Quantitative Information Flow in Programs.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Knowledge Compilation meets Uniform Sampling.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

MLIC: A MaxSAT-Based Framework for Learning Interpretable Classification Rules.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Hashing-Based Approaches to Approximate DNF-Counting.
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.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
On computing minimal independent support and its applications to sampling and counting.
Constraints An Int. J., 2016

Combining the k-CNF and XOR Phase-Transitions.
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.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Design and Verification of Distributed Phasers.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

Automatic data layout generation and kernel mapping for CPU+GPU architectures.
Proceedings of the 25th International Conference on Compiler Construction, 2016

Constrained Sampling and Counting: Universal Hashing Meets SAT Solving.
Proceedings of the Beyond NP, 2016

Approximate Probabilistic Inference via Word-Level Counting.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Distributed Phasers.
CoRR, 2015

On Parallel Scalable Uniform SAT Witness Generation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

From Weighted to Unweighted Model Counting.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Sampling Techniques for Boolean Satisfiability.
CoRR, 2014

Balancing Scalability and Uniformity in SAT Witness Generator.
Proceedings of the 51st Annual Design Automation Conference 2014, 2014

Distribution-Aware Sampling and Weighted Model Counting for SAT.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

ADHA: automatic data layout framework for heterogeneous architectures.
Proceedings of the International Conference on Parallel Architectures and Compilation, 2014

2013
A Scalable Approximate Model Counter.
Proceedings of the Principles and Practice of Constraint Programming, 2013

A Scalable and Nearly Uniform Generator of SAT Witnesses.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013


  Loading...