SATRIX -- algorithms for Boolean satisfiability

zbMATH Open1121.68107MaRDI QIDQ3594567FDOQ3594567

Authors:

Publication date: 8 August 2007

Full work available at URL: http://www.shaker.de/de/content/catalogue/index.asp?lang=de&ID=8&ISBN=978-3-8322-6408-6

Recommendations

• SATLIB: An online resource for research on SAT
• Solving propositional satisfiability problems
• scientific article; zbMATH DE number 956858
• Handbook of satisfiability. In 2 parts
• scientific article; zbMATH DE number 5605058

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited In (5)

• Boolean satisfiability with transitivity constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Satisfiability testing for Boolean formulas using \(\Delta\)-trees
• Title not available (Why is that?)

This page was built for publication: SATRIX -- algorithms for Boolean satisfiability

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