Search Sciweavers | Sciweavers

141 search results - page 4 / 29

» sat 2010

click to vote

INFORMATICALT
2010

103views more INFORMATICALT 2010»

Formal Correctness Proof for DPLL Procedure

14 years 7 months ago

Download poincare.matf.bg.ac.rs

The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veri�...

Filip Maric, Predrag Janicic

claim paper

Read More »

click to vote

ENTCS
2006

105views more ENTCS 2006»

Integrating a SAT Solver with an LCF-style Theorem Prover

14 years 9 months ago

Download www.cl.cam.ac.uk

Tjark Weber

claim paper

Read More »

click to vote

ICGI
2010
Springer

149views Natural Language Processing» more ICGI 2010»

Exact DFA Identification Using SAT Solvers

14 years 7 months ago

Download www.st.ewi.tudelft.nl

Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...

Marijn J. H. Heule, Sicco Verwer

claim paper

Read More »

click to vote

CORR
2010
Springer

57views Education» more CORR 2010»

Exact Ramsey Theory: Green-Tao numbers and SAT

14 years 9 months ago