Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325869zbMATH OpenOpenAlexFDO

Authors Christian Bessiere, Emmanuel Hebrard, Toby Walsh

Publication date 24 July 2009

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

Full work available at URL https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

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

Recommendations

• Local consistency and SAT-solvers
• scientific article; zbMATH DE number 2080324
• meSAT: multiple encodings of CSP to SAT
• Theory and Applications of Satisfiability Testing
• Efficient encodings from CSP into SAT, and from MaxCSP into MaxSAT

Cited in

(14)

• Set constraint model and automated encoding into SAT: application to the social golfer problem
• The state of SAT
• Modelling and solving temporal reasoning as propositional satisfiability
• On SAT representations of XOR constraints
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 2080324 (Why is no real title available?)
• Modelling Max-CSP as Partial Max-SAT
• Approximately propagation complete and conflict propagating constraint encodings
• Mapping CSP into Many-Valued SAT
• scientific article; zbMATH DE number 2016108 (Why is no real title available?)
• Local consistency and SAT-solvers
• GAC Via Unit Propagation
• Consistency and localizability
• Dealing with satisfiability and \(n\)-ary CSPs in a logical framework

This page was built for publication: Theory and Applications of Satisfiability Testing

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