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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540372066, 9783540372073

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP

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

10.1007/11814948_38 ◽

2006 ◽

pp. 424-429 ◽

Cited By ~ 69

Author(s):

Marc Thurley

Download Full-text

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity

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

10.1007/11814948_3 ◽

2006 ◽

pp. 11-21

Author(s):

Arist Kojevnikov ◽

Alexander S. Kulikov

Download Full-text

Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares

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

10.1007/11814948_34 ◽

2006 ◽

pp. 368-381 ◽

Cited By ~ 2

Author(s):

Daijue Tang ◽

Sharad Malik

Keyword(s):

Quantified Boolean Formulas ◽

Boolean Formulas ◽

Don't Cares

Download Full-text

On SAT Modulo Theories and Optimization Problems

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

10.1007/11814948_18 ◽

2006 ◽

pp. 156-169 ◽

Cited By ~ 71

Author(s):

Robert Nieuwenhuis ◽

Albert Oliveras

Keyword(s):

Optimization Problems ◽

Sat Modulo Theories

Download Full-text

Encoding CNFs to Empower Component Analysis

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

10.1007/11814948_9 ◽

2006 ◽

pp. 61-74 ◽

Cited By ~ 1

Author(s):

Mark Chavira ◽

Adnan Darwiche

Keyword(s):

Component Analysis

Download Full-text

SAT in Bioinformatics: Making the Case with Haplotype Inference

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

10.1007/11814948_16 ◽

2006 ◽

pp. 136-141 ◽

Cited By ~ 29

Author(s):

Inês Lynce ◽

João Marques-Silva

Keyword(s):

Haplotype Inference

Download Full-text

Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs

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

10.1007/11814948_7 ◽

2006 ◽

pp. 48-53 ◽

Cited By ~ 1

Author(s):

Allen Van Gelder

Keyword(s):

Preliminary Report ◽

Resolution Proofs

Download Full-text

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time

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

10.1007/11814948_26 ◽

2006 ◽

pp. 266-276 ◽

Cited By ~ 13

Author(s):

Evgeny Dantsin ◽

Alexander Wolpert

Keyword(s):

Max Sat

Download Full-text

A Dichotomy Theorem for Typed Constraint Satisfaction Problems

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

10.1007/11814948_23 ◽

2006 ◽

pp. 226-239 ◽

Cited By ~ 1

Author(s):

Su Chen ◽

Tomasz Imielinski ◽

Karin Johnsgard ◽

Donald Smith ◽

Mario Szegedy

Keyword(s):

Constraint Satisfaction ◽

Constraint Satisfaction Problems ◽

Dichotomy Theorem

Download Full-text

Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$

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

10.1007/11814948_15 ◽

2006 ◽

pp. 130-135 ◽

Cited By ~ 2

Author(s):

Roberto Sebastiani ◽

Michele Vescovi

Keyword(s):

Description Logics

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

sharpSAT – Counting Models with Advanced Component Caching and Implicit BCP

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity

Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares

On SAT Modulo Theories and Optimization Problems

Encoding CNFs to Empower Component Analysis

SAT in Bioinformatics: Making the Case with Haplotype Inference

Preliminary Report on Input Cover Number as a Metric for Propositional Resolution Proofs

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time

A Dichotomy Theorem for Typed Constraint Satisfaction Problems

Encoding the Satisfiability of Modal and Description Logics into SAT: The Case Study of K(m)/ $\mathcal{ALC}$

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