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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319243177, 9783319243184

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Recognition of Nested Gates in CNF Formulas

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_19 ◽

2015 ◽

pp. 255-271 ◽

Cited By ~ 1

Author(s):

Markus Iser ◽

Norbert Manthey ◽

Carsten Sinz

Keyword(s):

Cnf Formulas

Download Full-text

Mining Backbone Literals in Incremental SAT

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_8 ◽

2015 ◽

pp. 88-103 ◽

Cited By ~ 1

Author(s):

Alexander Ivrii ◽

Vadim Ryvchin ◽

Ofer Strichman

Download Full-text

On Compiling CNFs into Structured Deterministic DNNFs

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_15 ◽

2015 ◽

pp. 199-214 ◽

Cited By ~ 5

Author(s):

Simone Bova ◽

Florent Capelli ◽

Stefan Mengel ◽

Friedrich Slivovsky

Download Full-text

HordeSat: A Massively Parallel Portfolio SAT Solver

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_12 ◽

2015 ◽

pp. 156-172 ◽

Cited By ~ 23

Author(s):

Tomáš Balyo ◽

Peter Sanders ◽

Carsten Sinz

Keyword(s):

Massively Parallel ◽

Sat Solver

Download Full-text

$$\#\exists $$ SAT: Projected Model Counting

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_10 ◽

2015 ◽

pp. 121-137 ◽

Cited By ~ 4

Author(s):

Rehan Abdul Aziz ◽

Geoffrey Chu ◽

Christian Muise ◽

Peter Stuckey

Keyword(s):

Model Counting

Download Full-text

QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_25 ◽

2015 ◽

pp. 343-359 ◽

Cited By ~ 6

Author(s):

Kuan-Hua Tu ◽

Tzu-Chien Hsu ◽

Jie-Hong R. Jiang

Keyword(s):

Sat Solving ◽

Clause Learning

Download Full-text

Search-Space Partitioning for Parallelizing SMT Solvers

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_27 ◽

2015 ◽

pp. 369-386 ◽

Cited By ~ 5

Author(s):

Antti E. J. Hyvärinen ◽

Matteo Marescotti ◽

Natasha Sharygina

Keyword(s):

Search Space ◽

Space Partitioning ◽

Smt Solvers

Download Full-text

A New Approach to Partial MUS Enumeration

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_28 ◽

2015 ◽

pp. 387-404 ◽

Cited By ~ 4

Author(s):

Christian Zielke ◽

Michael Kaufmann

Keyword(s):

New Approach

Download Full-text

Between SAT and UNSAT: The Fundamental Difference in CDCL SAT

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_23 ◽

2015 ◽

pp. 307-323 ◽

Cited By ~ 9

Author(s):

Chanseok Oh

Keyword(s):

Fundamental Difference

Download Full-text

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances

Lecture Notes in Computer Science - Theory and Applications of Satisfiability Testing -- SAT 2015 ◽

10.1007/978-3-319-24318-4_22 ◽

2015 ◽

pp. 299-306 ◽

Cited By ~ 6

Author(s):

Ravi Mangal ◽

Xin Zhang ◽

Aditya V. Nori ◽

Mayur Naik

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Recognition of Nested Gates in CNF Formulas

Mining Backbone Literals in Incremental SAT

On Compiling CNFs into Structured Deterministic DNNFs

HordeSat: A Massively Parallel Portfolio SAT Solver

$$\#\exists $$ SAT: Projected Model Counting

QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving

Search-Space Partitioning for Parallelizing SMT Solvers

A New Approach to Partial MUS Enumeration

Between SAT and UNSAT: The Fundamental Difference in CDCL SAT

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances

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