Handbook of Satisfiability

652 citations recorded by the source corpus.

ion YES NO YES Increase solution bound to cover satisfying solution

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Hashing-Based Approximate Probabilistic Inference in Hybrid Domains (2015, methodology): “It extends the model counting task, or #SAT, which is to count the number of assignments (that is, models) that satisfy a given logical sentence (Gomes et al., 2009).”
Automated Algorithm Selection: Survey and Perspectives (2018, background): “SAT is one of the most prominent and intensely studied combinatorial decision problems and has important applications in hard- and software verification (see, e.g., Biere et al., 2009).”
Abduction-Based Explanations for Machine Learning Models (2018, background): “If for some reason FOL is in-adequate to encode some ML model, one could consider second-order or even higher order logics.”
Do-calculus when the True Graph Is Unknown (2015, methodology): “This enables the application of modern constraint solving techniques, such as Boolean satisﬁability (SAT) solvers (Biere et al., 2009).”
Causal Discovery from Subsampled Time Series Data by Constraint Optimization (2016, methodology): “Keywords: causality; causal discovery; graphical models; time series; constraint satisfaction; constraint optimization.”