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

TOTAL DOCUMENTS

42

(FIVE YEARS 0)

H-INDEX

13

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540262763, 9783540316794

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas

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

10.1007/11499107_34 ◽

2005 ◽

pp. 423-429 ◽

Author(s):

Roman Gershman ◽

Ofer Strichman

Keyword(s):

Cost Effective ◽

Download Full-text

A New Approach to Model Counting

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

10.1007/11499107_24 ◽

2005 ◽

pp. 324-339 ◽

Author(s):

Wei Wei ◽

Bart Selman

Keyword(s):

New Approach ◽

Download Full-text

Solving Over-Constrained Problems with SAT Technology

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

10.1007/11499107_1 ◽

2005 ◽

pp. 1-15 ◽

Author(s):

Josep Argelich ◽

Felip Manyà

Keyword(s):

Constrained Problems

Download Full-text

DPvis – A Tool to Visualize the Structure of SAT Instances

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

10.1007/11499107_19 ◽

2005 ◽

pp. 257-268 ◽

Author(s):

Carsten Sinz ◽

Edda-Maria Dieringer

Download Full-text

Bounded Model Checking with QBF

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

10.1007/11499107_32 ◽

2005 ◽

pp. 408-414 ◽

Author(s):

Nachum Dershowitz ◽

Ziyad Hanna ◽

Jacob Katz

Keyword(s):

Model Checking ◽

Bounded Model Checking

Download Full-text

A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic

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

10.1007/11499107_18 ◽

2005 ◽

pp. 241-256 ◽

Author(s):

Hossein M. Sheini ◽

Karem A. Sakallah

Keyword(s):

Linear Arithmetic

Download Full-text

Optimizations for Compiling Declarative Models into Boolean Formulas

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

10.1007/11499107_14 ◽

2005 ◽

pp. 187-202 ◽

Author(s):

Darko Marinov ◽

Sarfraz Khurshid ◽

Suhabe Bugrara ◽

Lintao Zhang ◽

Martin Rinard

Keyword(s):

Boolean Formulas

Download Full-text

Benchmarking SAT Solvers for Bounded Model Checking

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

10.1007/11499107_25 ◽

2005 ◽

pp. 340-354 ◽

Author(s):

Emmanuel Zarpas

Keyword(s):

Model Checking ◽

Bounded Model Checking ◽

Download Full-text

Heuristics for Fast Exact Model Counting

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

10.1007/11499107_17 ◽

2005 ◽

pp. 226-240 ◽

Author(s):

Tian Sang ◽

Paul Beame ◽

Henry Kautz

Keyword(s):

Exact Model ◽

Download Full-text

Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable

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

10.1007/11499107_23 ◽

2005 ◽

pp. 309-323 ◽

Author(s):

Magnus Wahlström

Download Full-text