To propose a link enter your email address:

and
 
 
 

Deadline Countdown

 
 

Heads up on SAT research

JSAT: the Journal on Satisfiability, Boolean Modeling and Computation

The SAT conferences: next meeting July 11-July 14, 2010, Edinburgh, Scotland, UK.

The SAT solver competitions

SAT gory details

  
 

SAT related books

Handbook of Satisfiability

Satisfiability & Verification

Test Pattern Generation using Boolean Proof Engines

Introduction to mathematics of satisfiability

Probleme SAT: progres et defis

  
 

Other SAT related sites

SATLIB: the satisfiability library
SAT-Ex: experimentations about SAT
QBFLIB: the QBF library
PBLIB: The pseudo-boolean library
SMTLIB: The Satisfiability Modulo Theory library
SAT4J:A SATisfiability library for Java 		 

 

Show   all the links
only papers 		   containing the keyword:     ordered by:  date
hits
Show all

1 elements available
 
  
Date:20-Jul-2010
Title:Extended Clause Learning. To appear in Artificial Intelligence.
Hits:200
Contributed by: Jinbo Huang
Keywords:null, null
 
  
 
This paper presents a new SAT algorithm that has the full power of extended resolution. Empirical results on an initial implementation indicate that very substantial, although at this stage not necessarily consistent, improvement can be observed.
 
 
 

 

© 2000-2001 Business & Technology Research Laboratory. © 2001-2005 Centre de Recherche en Informatique de Lens. Hosted by Innovation and Technology Research Lab. Please send any comment to daniel@satlive.org.