Theory and Applications of Satisfiability Testing – SAT 2018 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

27
(FIVE YEARS 0)

H-INDEX

5
(FIVE YEARS 0)

Published By Springer International Publishing

9783319941431, 9783319941448
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fast and Flexible Probabilistic Model Counting

2018 ◽  
pp. 148-164 ◽  
Author(s):  
Dimitris Achlioptas ◽  
Zayd Hammoudeh ◽  
Panos Theodoropoulos
Keyword(s):  
Probabilistic Model ◽  
Model Counting

Chronological Backtracking

2018 ◽  
pp. 111-121 ◽  
Author(s):  
Alexander Nadel ◽  
Vadim Ryvchin

Local Soundness for QBF Calculi

2018 ◽  
pp. 217-234 ◽  
Author(s):  
Martin Suda ◽  
Bernhard Gleiss

Fast Sampling of Perfectly Uniform Satisfying Assignments

2018 ◽  
pp. 135-147 ◽  
Author(s):  
Dimitris Achlioptas ◽  
Zayd S. Hammoudeh ◽  
Panos Theodoropoulos

In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving

2018 ◽  
pp. 292-310 ◽  
Author(s):  
Marc Vinyals ◽  
Jan Elffers ◽  
Jesús Giráldez-Cru ◽  
Stephan Gocht ◽  
Jakob Nordström
Keyword(s):  
Cutting Planes ◽  
Sat Solving ◽  
Proof Systems

XOR-Satisfiability Set Membership Filters

2018 ◽  
pp. 401-418 ◽  
Author(s):  
Sean A. Weaver ◽  
Hannah J. Roberts ◽  
Michael J. Smith
Keyword(s):  
Set Membership
Load More ...
Sign in / Sign up

Export Citation Format

Share Document