Publications/Presentations
Publications
-
MapleSSV SAT Solver for SAT Competition 2021
Saeed Nejati, Md Solimul Chowdhury, Vijay Ganesh
Solver Description, SAT competition 2021
[pdf] -
New Concurrent and Distributed Painless solvers: P-MCOMSPS, P-MCOMSPS-COM, P-MCOMSPS-MPI, and P-MCOMSPS-COM-MPI
Vincent Vallade, Ludovic Le Frioux, Razvan Oanea, Souheib Baarir, Julien Sopena, Fabrice Kordon, Saeed Nejati, Vijay Ganesh
Solver Description, SAT competition 2021
[pdf] -
On the Hierarchical Community Structure of Practical SAT Formulas
Chunxiao Li, Jonathan Chung, Soham Mukherjee, Marc Vinyals, Noah Fleming, Antonina Kolokolova, Alice Mu, and Vijay Ganesh
[pdf] [bib] -
Towards a Complexity-theoretic Understanding of Restarts in SAT solvers
Chunxiao Li, Noah Fleming, Marc Vinyals, Toniann Pitassi and Vijay Ganesh
23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020)
July 3, 2020
[pdf] [bib] -
Machine Learning for SAT Solvers
Jia Hui Liang
PhD Thesis (University of Waterloo)
December 5, 2018
[pdf] [bib] -
Machine Learning-based Restart Policy for CDCL SAT Solvers
Jia Hui Liang, Chanseok Oh, Minu Mathews, Ciza Thomas, Chunxiao Li, Vijay Ganesh
21st International Conference on Theory and Applications of Satisfiability Testing (SAT 2018)
July 9, 2018
[pdf] [bib] -
An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate
Jia Hui Liang, Hari Govind V K, Pascal Poupart, Krzysztof Czarnecki, Vijay Ganesh
20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017)
August 29, 2017
Best student paper honourable mention
[pdf] [bib]* Also presented at the Sister conference best paper track of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018)
-
Learning Rate Based Branching Heuristic for SAT Solvers
Jia Hui Liang, Vijay Ganesh, Pascal Poupart, and Krzysztof Czarnecki
19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016)
July 5, 2016
[pdf] [bib]* Also presented at the Sister conferences and journals track of the 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017)
-
Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
Saeed Nejati, Jia Hui Liang, Vijay Ganesh, Catherine Gebotys and Krzysztof Czarnecki
Pragmatics of SAT 2016
July 4, 2016
[pdf] [bib] -
Exponential Recency Weighted Average Branching Heuristic for SAT Solvers
Jia Hui Liang, Vijay Ganesh, Pascal Poupart, and Krzysztof Czarnecki
13th AAAI Conference on Artificial Intelligence (AAAI 2016)
February 12, 2016
[pdf] [bib] -
Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers
Jia Hui Liang, Vijay Ganesh, Ed Zulkoski, Atulan Zaman, and Krzysztof Czarnecki
11th Haifa Verification Conference (HVC 2016)
November, 17, 2015
[pdf] [bib] -
SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers
Zack Newsham, William Lindsay, Vijay Ganesh, Jia Hui Liang, Sebastian Fischmeister, and Krzysztof Czarnecki
18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015)
September 24, 2015
[pdf] [bib] -
SAT-based Analysis of Large Real-world Feature Models is Easy
Jia Hui Liang, Vijay Ganesh, Krzysztof Czarnecki, and Venkatesh Raman
19th International Software Product Line Conference (SPLC 2015)
July 20, 2015
Best paper award
[pdf] [bib] -
Impact of Community Structure on SAT Solver Performance
Zack Newsham, Vijay Ganesh, Sebastian Fischmeister, Gilles Audemard, and Laurent Simon
17th International Conference on Theory and Applications of Satisfiability Testing (SAT 2014)
July 16, 2014
Best student paper award
[pdf] [bib]
Presentations
-
Chunxiao Li, On the Hierarchical Community Structure of Practical SAT Formulas
SAT conference 2021,
July 8, 2021 -
Vijay Ganesh, A Foundational Perspective, Lectures [1] [2] [3+4]
Marktoberdorf Summer School 2018, Marktoberdorf, Germany
July 31-August 11, 2018 -
Jia Hui Liang, Machine Learning for SAT Solvers
Invited Tutorial
CP 2018, Lille, France
August 29, 2018 -
Jia Hui Liang, An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate
Invited Talk
IJCAI 2018, Stockholm, Sweden
July 17, 2018 -
Jia Hui Liang, Machine Learning-Based Restart Policy for CDCL SAT Solvers
SAT 2018, Oxford, England
July 9, 2018 -
Jia Hui Liang, An Empirical Study of Branching Heuristics Through the Lens of Global Learning Rate
SAT 2017, Melbourne, Australia
August 29, 2017 -
Vijay Ganesh, On the Unreasonable Effectiveness of Boolean SAT Solvers
MPI, Saarbrücken, Germany
April 24, 2017 -
Vijay Ganesh, Towards a Deeper Empirical Understanding of CDCL SAT Solvers
Automata, Logic and Games, Institute for Mathematical Sciences, Singapore
August 29, 2016 -
Vijay Ganesh, A Deeper Understanding of SAT Solver Branching Heuristics
Theoretical Foundations of SAT Solving Workshop, The Fields Institute, Toronto, Canada
August 16, 2016 -
Vijay Ganesh, Towards a Deeper Empirical Understanding of CDCL SAT Solvers
CSTVA 2016 Keynote, Saarbrücken, Germany
July 17, 2016 -
Vijay Ganesh, Learning Rate Based Branching Heuristic for SAT Solvers
SAT 2016, Bordeaux, France
July 5, 2016 -
Saeed Nejati, Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
POS 2016, Bordeaux, France
July 4, 2016 -
Vijay Ganesh, An Introduction to CDCL Solvers
Chebyshev Labs, St. Petersburg, Russia
April 29, 2016 -
Jia Hui Liang, Exponential Recency Weighted Average Branching Heuristic for SAT Solvers
AAAI 2016, Phoenix, United States
February 12, 2016 -
Jia Hui Liang, Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers
HVC 2015, Haifa, Israel
September 24, 2015 -
Jia Hui Liang, SAT-based Analysis of Large Real-world Feature Models is Easy
SPLC 2015, Nashville, United States
July 20, 2015 -
Zack Newsham, Impact of Community Structure on SAT Solver Performance
SAT 2014, Vienna, Austria
July 16, 2014