Boolean satisfiability and EDA applications

MaRDI QIDQ3574331zbMATH OpenFDO

Authors Joao Marques-Silva

Publication date 9 July 2010

zbMATH Keywords

SAT algorithmsEDA problems

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Propositional SAT solving
• scientific article; zbMATH DE number 5493266
• scientific article; zbMATH DE number 5605058
• Model checking with Boolean Satisfiability
• scientific article; zbMATH DE number 2090309

Cited in

(3)

• scientific article; zbMATH DE number 6405037 (Why is no real title available?)
• Automata Applications in Chip-Design Software
• scientific article; zbMATH DE number 5547835 (Why is no real title available?)

This page was built for publication: Boolean satisfiability and EDA applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3574331)