An Improved SAT Algorithm in Terms of Formula Length

DOI10.1007/978-3-642-03367-4_13MaRDI QIDQ3183448zbMATH OpenOpenAlexFDO

Authors Yang Liu, Jianer Chen

Publication date 20 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03367-4_13

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithms – ESA 2005
• Theory and Applications of Satisfiability Testing
• A faster clause-shortening algorithm for SAT with no restriction on clause length
• scientific article; zbMATH DE number 1303594
• scientific article; zbMATH DE number 515744

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303594 (Why is no real title available?)
• scientific article; zbMATH DE number 1113992 (Why is no real title available?)
• A Computing Procedure for Quantification Theory
• A satisfiability tester for non-clausal propositional calculus
• Algorithms – ESA 2005
• Measure and conquer
• New worst-case upper bounds for SAT
• STACS 2005
• Theory and Applications of Satisfiability Testing
• Vertex cover: Further observations and further improvements

Cited in

(6)

• Improvements to Hybrid Incremental SAT Algorithms
• A fast algorithm for SAT in terms of formula length
• Further improvements for SAT in terms of formula length
• Algorithms – ESA 2005
• SAT-Based Formula Simplification
• An improved upper bound for SAT

This page was built for publication: An Improved SAT Algorithm in Terms of Formula Length

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