scientific article; zbMATH DE number 1759715

MaRDI QIDQ4536728zbMATH OpenFDO

Authors Toby Walsh

Publication date 6 August 2002

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 2080324
• Propagation in CSP and SAT
• scientific article; zbMATH DE number 2086994
• scientific article; zbMATH DE number 5575002
• Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem

Cited in

(10)

• Bridging constraint satisfaction and Boolean satisfiability
• The state of SAT
• Propagation in CSP and SAT
• scientific article; zbMATH DE number 1222101 (Why is no real title available?)
• On relation between constraint answer set programming and satisfiability modulo theories
• scientific article; zbMATH DE number 2086994 (Why is no real title available?)
• Logic Programming
• Constraint CNF: SAT and CSP Language Under One Roof.
• Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem
• A case study of mutual routing-scheduling reformulation

Describes a project that uses

Uses Software

• Walksat

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 Q4536728)