scientific article; zbMATH DE number 1759715

zbMATH Open0989.68526MaRDI QIDQ4536728FDOQ4536728

Authors: Toby Walsh 

Publication date: 6 August 2002

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (10)

• The state of SAT
• Title not available (Why is that?)
• Constraint CNF: SAT and CSP Language Under One Roof.
• A case study of mutual routing-scheduling reformulation
• On relation between constraint answer set programming and satisfiability modulo theories
• Propagation in CSP and SAT
• Bridging constraint satisfaction and Boolean satisfiability
• Logic Programming
• Title not available (Why is that?)
• Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem

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)