scientific article; zbMATH DE number 1182571

MaRDI QIDQ4400641zbMATH OpenFDO

Authors J. Gu

Publication date 10 December 1998

zbMATH Keywords

algorithmcluster computingefficient software toolsSATsatisfiability problemsatisfiability testing

Mathematics Subject Classification ID

Classical propositional logic (03B05) Searching and sorting (68P10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) General topics in artificial intelligence (68T01) Search theory (90B40) Combinatorial optimization (90C27) Decision theory (91B06)

Recommendations

• The Multi-SAT algorithm
• Algorithms for the maximum satisfiability problem
• A dual algorithm for the satisfiability problem
• SAT-based MaxSAT algorithms
• scientific article; zbMATH DE number 4039349
• scientific article; zbMATH DE number 1342213
• scientific article; zbMATH DE number 1114002
• scientific article; zbMATH DE number 1113992
• Algorithms for Sat and upper bounds on their complexity

Cited in

(4)

• Experimental study on strategy of combining SAT algorithms
• The Multi-SAT algorithm
• scientific article; zbMATH DE number 1114002 (Why is no real title available?)
• scientific article; zbMATH DE number 1927173 (Why is no real title available?)

This page was built for publication:

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