activity
20152022
most citedRelating Complexity-theoretic Parameters with SAT Solver Performance

5 citations · 5 across the 6 of their papers we have counts for

collaborators

28 papers

cs.LO2021

On the proof complexity of MCSAT

Gereon Kremer, Erika Abraham, Vijay Ganesh

Satisfiability Modulo Theories (SMT) and SAT solvers are critical components in many formal software tools, primarily due to the fact that they are able to easily solve logical pro…

cs.CL2021

String Theories involving Regular Membership Predicates: From Practice to Theory and Back

Murphy Berzish, Joel D. Day, Vijay Ganesh +4

Widespread use of string solvers in formal analysis of string-heavy programs has led to a growing demand for more efficient and reliable techniques which can be applied in this con…

cs.LO2021

On the Hierarchical Community Structure of Practical Boolean Formulas

Chunxiao Li, Jonathan Chung, Soham Mukherjee +5

Modern CDCL SAT solvers easily solve industrial instances containing tens of millions of variables and clauses, despite the theoretical intractability of the SAT problem. This gap…

cs.NE2020

Logic Guided Genetic Algorithms

Dhananjay Ashok, Joseph Scott, Sebastian Wetzel +2

We present a novel Auxiliary Truth enhanced Genetic Algorithm (GA) that uses logical or mathematical constraints as a means of data augmentation as well as to compute loss (in conj…

cs.LG2020

Amnesiac Machine Learning

Laura Graves, Vineel Nagisetty, Vijay Ganesh

The Right to be Forgotten is part of the recently enacted General Data Protection Regulation (GDPR) law that affects any data holder that has data on European Union residents. It g…

cs.AI2020

LGML: Logic Guided Machine Learning

Joseph Scott, Maysum Panju, Vijay Ganesh

We introduce Logic Guided Machine Learning (LGML), a novel approach that symbiotically combines machine learning (ML) and logic solvers with the goal of learning mathematical funct…