Handbook of satisfiability

By Armin Biere, Marijn J. H. Heule, Hans van Maaren, Thomas J. Walsh. 2009

464 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/a70dfba7d322ca38fc91cc103eea0bc0a5332f5a

How researchers see this paper

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

1. Antti Hyttinen
2. Frederick Eberhardt
3. Matti Järvisalo
4. Joris M. Mooij
5. Patrik O. Hoyer
6. Bernhard Schölkopf
7. Jan Peters
8. Frédéric Koriche

Citations in the corpus

• Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure (2013, methodology): “We employ a Boolean sat-isfiability (SAT) solver (Biere et al., 2009) to determine the backbone, which can be directly interpreted as the solution to the structure discovery task.”
• Compiling Combinatorial Prediction Games (2018, background): “As SAT encodings of discrete solution spaces are frequently used in academic and industrial applications (Biere et al., 2009), our setting covers an important class of combinatorial prediction games.”