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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540797180, 9783540797197

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Local Restarts

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

10.1007/978-3-540-79719-7_25 ◽

2008 ◽

pp. 271-276 ◽

Cited By ~ 10

Author(s):

Vadim Ryvchin ◽

Ofer Strichman

Download Full-text

A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors

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

10.1007/978-3-540-79719-7_16 ◽

2008 ◽

pp. 161-167 ◽

Cited By ~ 3

Author(s):

Stephan Kottler ◽

Michael Kaufmann ◽

Carsten Sinz

Keyword(s):

Np Hard

Download Full-text

Modelling Max-CSP as Partial Max-SAT

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

10.1007/978-3-540-79719-7_1 ◽

2008 ◽

pp. 1-14 ◽

Cited By ~ 7

Author(s):

Josep Argelich ◽

Alba Cabiscol ◽

Inês Lynce ◽

Felip Manyà

Keyword(s):

Max Sat

Download Full-text

A CNF Class Generalizing Exact Linear Formulas

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

10.1007/978-3-540-79719-7_22 ◽

2008 ◽

pp. 231-245 ◽

Cited By ~ 1

Author(s):

Stefan Porschen ◽

Ewald Speckenmeyer

Download Full-text

SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers

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

10.1007/978-3-540-79719-7_8 ◽

2008 ◽

pp. 77-90 ◽

Cited By ~ 13

Author(s):

Germain Faure ◽

Robert Nieuwenhuis ◽

Albert Oliveras ◽

Enric Rodríguez-Carbonell

Keyword(s):

Linear Arithmetic

Download Full-text

Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms

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

10.1007/978-3-540-79719-7_21 ◽

2008 ◽

pp. 225-230 ◽

Cited By ~ 17

Author(s):

Joao Marques-Silva ◽

Vasco Manquinho

Keyword(s):

Maximum Satisfiability ◽

Satisfiability Algorithms

Download Full-text

Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms

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

10.1007/978-3-540-79719-7_9 ◽

2008 ◽

pp. 91-104 ◽

Cited By ~ 1

Author(s):

Yong Gao

Keyword(s):

Complete Problems ◽

Random Instances

Download Full-text

Improvements to Hybrid Incremental SAT Algorithms

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

10.1007/978-3-540-79719-7_17 ◽

2008 ◽

pp. 168-181 ◽

Cited By ~ 2

Author(s):

Florian Letombe ◽

Joao Marques-Silva

Download Full-text

Searching for Autarkies to Trim Unsatisfiable Clause Sets

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

10.1007/978-3-540-79719-7_18 ◽

2008 ◽

pp. 182-195 ◽

Cited By ~ 10

Author(s):

Mark Liffiton ◽

Karem Sakallah

Download Full-text

Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning

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

10.1007/978-3-540-79719-7_24 ◽

2008 ◽

pp. 257-270 ◽

Cited By ~ 2

Author(s):

Zbigniew Stachniak ◽

Anton Belov

Keyword(s):

Local Search ◽

Propositional Satisfiability ◽

Clause Learning

Download Full-text

Theory and Applications of Satisfiability Testing – SAT 2008 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Local Restarts

A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors

Modelling Max-CSP as Partial Max-SAT

A CNF Class Generalizing Exact Linear Formulas

SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers

Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms

Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms

Improvements to Hybrid Incremental SAT Algorithms

Searching for Autarkies to Trim Unsatisfiable Clause Sets

Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning

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