Efficient SAT-Based Encodings of Conditional Cardinality Constraints

DOI10.29007/kfjbzbMath1415.68185arXiv1804.00211OpenAlexW2908513458MaRDI QIDQ5222954

Lakhdar Saïs, Badran Baddaoui, Abdelhamid Boudane, Saïd Jabbour

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.00211

zbMATH Keywords

modellingcardinality constraintspropositional satisfiability

Mathematics Subject Classification ID

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

Related Items (1)

Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models

This page was built for publication: Efficient SAT-Based Encodings of Conditional Cardinality Constraints