A New Look at BDDs for Pseudo-Boolean Constraints
From MaRDI portal
Publication:3143578
DOI10.1613/jair.3653zbMath1252.68267arXiv1401.5860OpenAlexW3104744353MaRDI QIDQ3143578
Albert Oliveras, Enric Rodríguez-Carbonell, Robert Nieuwenhuis, Valentin Mayer-Eichberger, Ignasi Abío
Publication date: 3 December 2012
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.5860
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (11)
Propositional SAT Solving ⋮ Shared aggregate sets in answer set programming ⋮ Coupling different integer encodings for SAT ⋮ Improving the Normalization of Weight Rules in Answer Set Programs ⋮ Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints ⋮ Exact and approximate determination of the Pareto front using minimal correction subsets ⋮ A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ Boosting Answer Set Optimization with Weighted Comparator Networks ⋮ Non-clausal redundancy properties ⋮ SAT encodings for pseudo-Boolean constraints together with at-most-one constraints
Uses Software
This page was built for publication: A New Look at BDDs for Pseudo-Boolean Constraints
