Reformulating propositional satisfiability as constraint satisfaction

DOI10.1007/3-540-44914-0_14MaRDI QIDQ4536728zbMATH OpenFDO

Authors Toby Walsh

Publication date 6 August 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44914-0_14

Mathematics Subject Classification ID

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

Recommendations

• SAT v CSP
• Propagation in CSP and SAT
• Reformulation of non-binary constraints
• 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
• A formalization of anytime constraint satisfaction
• On relation between constraint answer set programming and satisfiability modulo theories
• Reformulation of non-binary constraints
• 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: Reformulating propositional satisfiability as constraint satisfaction

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