SwePub - sökning: id:"swepub:oai:lup.lub.lu.se:1...

Träfflista för sökning "id:"swepub:oai:lup.lub.lu.se:1e41b5ca-d051-4cc5-ab4d-058e2bf0cebc" "

Sökning: id:"swepub:oai:lup.lub.lu.se:1e41b5ca-d051-4cc5-ab4d-058e2bf0cebc"

Sortera/gruppera träfflistan

Sortering: Träffar per sida:

Numrering	Referens	Omslagsbild	Hitta
1.	Elffers, J., et al. (författare) A cardinal improvement to pseudo-boolean solving 2020 Ingår i: AAAI 2020 - 34th AAAI Conference on Artificial Intelligence. - : AAAI press. ; , s. 1495-1503 Konferensbidrag (refereegranskat)abstract Pseudo-Boolean solvers hold out the theoretical potential of exponential improvements over conflict-driven clause learning (CDCL) SAT solvers, but in practice perform very poorly if the input is given in the standard conjunctive normal form (CNF) format. We present a technique to remedy this problem by recovering cardinality constraints from CNF on the fly during search. This is done by collecting potential building blocks of cardinality constraints during propagation and combining these blocks during conflict analysis. Our implementation has a non-negligible but manageable overhead when detection is not successful, and yields significant gains for some SAT competition and crafted benchmarks for which pseudo-Boolean reasoning is stronger than CDCL. It also boosts performance for some native pseudo-Boolean formulas where this approach helps to improve learned constraints. Copyright

Skapa referenser, mejla, bekava och länka

Träfflista för sökning "id:"swepub:oai:lup.lub.lu.se:1e41b5ca-d051-4cc5-ab4d-058e2bf0cebc" "