SAT encodings of pseudo-Boolean constraints with at-most-one relations

DOI10.1007/978-3-030-19212-9_8OpenAlexW2945958344MaRDI QIDQ2327243

Jordi Coll, Josep Suy, Mateu Villaret, Miquel Bofill

Publication date: 14 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-19212-9_8

zbMATH Keywords

encodingSATpseudo-Boolean

Mathematics Subject Classification ID

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

Related Items (2)

Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints

This page was built for publication: SAT encodings of pseudo-Boolean constraints with at-most-one relations