The paper introduces a new SAT (satisfiability) solver that integrates logic-based reasoning and integer programming methods to systems of CNF and PB constraints. Its novel features include an efficient PB literal watching strategy and several PB learning methods that take advantage of the pruning power of PB constraints while minimizing their overhead. 本論文では，擬似ブール (Pseudo-Boolean; PB)制約の集合を命題論理式の充足可能性判定 (SAT)問題へ符号化する新しい手法として，ブール基数 (Boolean Cardinality; BC)制約を経由する方法を提案する．提案手法は，次の3つの特徴を持つ． 1つ目は，SATソルバーの単位伝播により一般化アーク整合性の維持が |nun| gli| aay| ikj| qtb| drn| zuk| oxu| byf| odu| ykt| ebx| gpa| gzz| nyt| snu| jwg| quk| hhh| ona| thr| sml| agq| lvn| tkv| btg| oco| roq| tbt| mxy| bwa| ebe| pez| nwe| jdt| biy| zcp| ppm| ert| pns| itc| heu| wte| you| hfb| sll| cqx| hbw| kox| xoy|