Representative Encodings to Translate Finite CSPs into SAT

DOI10.1007/978-3-319-07046-9_18zbMath1407.68445OpenAlexW9380573MaRDI QIDQ5418737

Steffen Hölldobler, Van-Hau Nguyen, Pedro Barahona

Publication date: 27 May 2014

Published in: Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07046-9_18

Mathematics Subject Classification ID

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

Related Items (2)

Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges

Uses Software

• CSP2SAT4J
• Treengeling

This page was built for publication: Representative Encodings to Translate Finite CSPs into SAT