Bridging constraint satisfaction and Boolean satisfiability
From MaRDI portal
Publication:2634500
DOI10.1007/978-3-319-21810-6zbMath1410.68008OpenAlexW2395113865MaRDI QIDQ2634500
Publication date: 9 February 2016
Published in: Artificial Intelligence: Foundations, Theory, and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21810-6
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
On logical and extensional characterizations of attributed feature models ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ Combining restarts, nogoods and bag-connected decompositions for solving csps ⋮ The packing chromatic number of the infinite square lattice is between 13 and 15 ⋮ Resolution and the binary encoding of combinatorial principles
This page was built for publication: Bridging constraint satisfaction and Boolean satisfiability
