default search action
Journal on Satisfiability, Boolean Modeling and Computation, Volume 8
Volume 8, Numbers 1/2, 2012
- Alberto Griggio:
A Practical Approach to Satisability Modulo Linear Integer Arithmetic. 1-27 - Francesco Alberti, Silvio Ghilardi, Elena Pagani, Silvio Ranise, Gian Paolo Rossi:
Universal Guards, Relativization of Quantifiers, and Failure Models in Model Checking Modulo Theories. 29-61 - Marcel Wild:
Compactly Generating All Satisfying Truth Assignments of a Horn Formula. 63-82
- Huan Chen, João Marques-Silva:
TG-Pro: A SAT-based ATPG System. 83-88 - Mikolás Janota, Inês Lynce, Vasco Manquinho, João Marques-Silva:
PackUp: Tools for Package Upgradability Solving. 89-94 - Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, Ryuzo Hasegawa:
QMaxSAT: A Partial Max-SAT Solver. 95-100
- Uwe Bubeck, Hans Kleine Büning:
Encoding Nested Boolean Functions as Quantified Boolean Formulas. 101-116
Volume 8, Numbers 3/4, 2012
- Allen Van Gelder:
Contrasat - A Contrarian SAT Solver. 117-122 - Anton Belov, João Marques-Silva:
MUSer2: An Efficient MUS Extractor. 123-128
Volume 8, Numbers 3/4, 2014
- Sean A. Weaver, Katrina J. Ray, Victor W. Marek, Andrew J. Mayer, Alden Walker:
Satisfiability-based Set Membership Filters. 129-148 - Florent Krzakala, Marc Mézard, Lenka Zdeborová:
Reweighted Belief Propagation and Quiet Planting for Random K-SAT. 149-171 - Konrad W. Schwerdtfeger:
A Computational Trichotomy for Connectivity of Boolean Satisfiability. 173-195
- Daniel Le Berre, Stéphanie Roussel:
Sat4j 2.3.2: on the fly solver configuration System Description. 197-202
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.