Share
Embed
SATソルバーと制約ソルバー ~基盤技術と最新動向~
2025.12.01 シンポジウム: 制約充足、探索、列挙、最適化 ― よい「答え」を見つける技術の最先端
tsoh
November 30, 2025
Transcript
108 slides
-
SAT ιϧόʔͱ੍ιϧόʔ ʙج൫ٕज़ͱ࠷৽ಈʙ ߶ल (ͦ͏ ͚ͨͻͰ) ໊ݹେֶ 2025
12 ݄ 1 (݄) @ ܚጯٛक़େֶ٢Ωϟϯύε γϯϙδϜɿ ੍ॆɺ୳ࡧɺྻڍɺ࠷దԽ ʕ Α͍ʮ͑ʯΛݟ͚ͭΔٕज़ͷ࠷ઌ ୈ 134 ճਓೳجຊݚڀձ (SIG-FPAI) in ਓೳֶձ߹ಉݚڀձ 2025 (SIGAIs) 1 / 45 -
߹ͤʹର͢Δ੍ιϧόʔ ιϧόʔ CaDiCaL, Kissat Exact, SCIP-NaPS OR-Tools (CP-SAT), ACE CP
Optimizer, Fun-sCOP Clingo Z3, CVC5 SCIP, Gurobi, CPLEX 3 / 45 -
߹ͤʹର͢Δ੍ιϧόʔ ιϧόʔ هड़Ͱ͖Δ੍ CaDiCaL, Kissat SAT ໋ཧࣜʢCNFʣ Exact, SCIP-NaPS
PB 0-1 ઢܗෆࣜ OR-Tools (CP-SAT), ACE CSP ࢉज़ɼཧɼ֎Ԇత੍ CP Optimizer, Fun-sCOP άϩʔόϧ੍ Clingo ASP Ұ֊ड़ޠཧࣜ Z3, CVC5 SMT ཧ͖ཧࣜ SCIP, Gurobi, CPLEX ཧ࠷దԽ ࣮//ઢܗ/ೋ࣍ ʢࠞ߹ʣෆࣜ 3 / 45 -
߹ͤʹର͢Δ੍ιϧόʔ ιϧόʔ هड़Ͱ͖Δ੍ CaDiCaL, Kissat SAT ໋ཧࣜʢCNFʣ Exact, SCIP-NaPS
PB 0-1 ઢܗෆࣜ OR-Tools (CP-SAT), ACE CSP ࢉज़ɼཧɼ֎Ԇత੍ CP Optimizer, Fun-sCOP άϩʔόϧ੍ Clingo ASP Ұ֊ड़ޠཧࣜ Z3, CVC5 SMT ཧ͖ཧࣜ SCIP, Gurobi, CPLEX ཧ࠷దԽ ࣮//ઢܗ/ೋ࣍ ʢࠞ߹ʣෆࣜ X ֤ιϧόʔҟͳΔೖྗݴޠ (੍) Λ͓࣋ͬͯΓಘҙͳ ͕ҟͳΔɽ·ͨղ͘͜ͱ͕Ͱ͖ΔͷൣғҟͳΔɽ X ߹͍ͤΖ͍Ζͳ੍ιϧόʔͰղ͘͜ͱ͕Ͱ͖Δɽ 3 / 45 -
߹ͤʹର͢Δ੍ιϧόʔ ιϧόʔ هड़Ͱ͖Δ੍ CaDiCaL, Kissat SAT ໋ཧࣜʢCNFʣ Exact, SCIP-NaPS
PB 0-1 ઢܗෆࣜ OR-Tools (CP-SAT) , ACE CSP ࢉज़ɼཧɼ֎Ԇత੍ CP Optimizer, Fun-sCOP άϩʔόϧ੍ Clingo ASP Ұ֊ड़ޠཧࣜ Z3, CVC5 SMT ཧ͖ཧࣜ SCIP, Gurobi, CPLEX ཧ࠷దԽ ࣮//ઢܗ/ೋ࣍ ʢࠞ߹ʣෆࣜ X ֤ιϧόʔҟͳΔೖྗݴޠ (੍) Λ͓࣋ͬͯΓಘҙͳ ͕ҟͳΔɽ·ͨղ͘͜ͱ͕Ͱ͖ΔͷൣғҟͳΔɽ X ߹͍ͤΖ͍Ζͳ੍ιϧόʔͰղ͘͜ͱ͕Ͱ͖Δɽ ଟ͘ͷιϧόʔ͕ SAT ιϧόʔͷٕज़Λ༻͍ͯ͠Δɽ 3 / 45 -
Q. ԿނΘΕΔͷ͔? Armin Biere ઌੜͷ Twitter (@ArminBiere) ΑΓ (2020
7 ݄ 29 ) 4 / 45 -
Q. ԿނΘΕΔͷ͔? Armin Biere ઌੜͷ Twitter (@ArminBiere) ΑΓ (2020
7 ݄ 29 ) ܧଓతͳߴԽ 4 / 45 -
Q. ԿނΘΕΔͷ͔? Armin Biere ઌੜͷ Twitter (@ArminBiere) ΑΓ (2020
7 ݄ 29 ) ܧଓతͳߴԽ ܧଓతͳߴԽ + ֦ுੑ (CNFͱCDCL) 4 / 45 -
SAT ٕज़ͷԠ༻ SAT PB ASP ALLSAT #SAT QBF SMT MaxSAT
CSP/COP ج൫ٕज़ DPLL/CDCL 5 / 45 -
SAT ٕज़ͷԠ༻ SAT PB ASP ALLSAT #SAT QBF SMT MaxSAT
CSP/COP ج൫ٕज़ DPLL/CDCL 5 / 45 -
ൃද༰ X SAT ιϧόʔ (DPLL/CDCL) X SAT ιϧόʔͷ֦ு SAT
ූ߸Խ LCG ιϧόʔ: OR-Tools (CP-SAT) SMT ιϧόʔ: Z3, CVC X ߹ͤʹԿΛ͑ྑ͍ͷ? 2 ࣍ݩۣܗύοΩϯάΛྫʹͨ͠ੑೳධՁͷҰྫ CPLEX, Gurobi, SCIP CP Optimizer, OR-Tools (CP-SAT), ACE Z3, CVC5 6 / 45 -
SAT ͱ SAT (Boolean Satisability Problem) ༩͑ΒΕ໋ͨཧࣜΛਅʹ͢Δׂ͕ͯଘࡏ͢Δ͔ఆ͢Δ ྫɿCNF
ࣜ (p1 ∨ p2 ∨ p3 ) ∧ (¬p1 ∨ ¬p2 ) ∧ (¬p1 ∨ ¬p3 ) ∧ (¬p2 ∨ ¬p3 ) 7 / 45 -
SAT ͱ SAT (Boolean Satisability Problem) ༩͑ΒΕ໋ͨཧࣜΛਅʹ͢Δׂ͕ͯଘࡏ͢Δ͔ఆ͢Δ ྫɿCNF
ࣜ (p1 ∨ p2 ∨ p3 ) ∧ (¬p1 ∨ ¬p2 ) ∧ (¬p1 ∨ ¬p3 ) ∧ (¬p2 ∨ ¬p3 ) ղ p1 = T, p2 = F, p3 = F 7 / 45 -
SAT ͱ SAT (Boolean Satisability Problem) ༩͑ΒΕ໋ͨཧࣜΛਅʹ͢Δׂ͕ͯଘࡏ͢Δ͔ఆ͢Δ ྫɿCNF
ࣜ ( p1 ∨ p2 ∨ p3 ) ∧ (¬p1 ∨ ¬p2 ) ∧ (¬p1 ∨ ¬p3 ) ∧ ( ¬p2 ∨ ¬p3 ) ղ p1 = T, p2 = F, p3 = F NP શͷ 1 ͭͰ͋Γɼଟ͘ͷ߹ͤ SAT Λ༻͍ͯ දݱͰ͖Δɽ 7 / 45 -
SAT ιϧόʔͱ SAT Λࣗಈతʹղ͘ϓϩάϥϜ ೖྗ CNF ܗࣜͷཧࣜ ग़ྗ X ॆՄೳ
(SAT) + ղ X ॆෆೳ (UNSAT) 8 / 45 -
SAT ιϧόʔͱ SAT Λࣗಈతʹղ͘ϓϩάϥϜ ೖྗ CNF ܗࣜͷཧࣜ ग़ྗ X ॆՄೳ
(SAT) + ղ X ॆෆೳ (UNSAT) ओͳΞϧΰϦζϜ X DPLL (1962) ਂ͞༏ઌ୳ࡧ X CDCL (2000 ࠒ) ֶशʹΑΔޮԽ 8 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c ¬e 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c ¬e f 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c ¬e f g 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c ¬e f g ¬i 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c ¬e f g ¬i 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c ¬e f g ¬i ໃ६ൃੜ: h ∧ ¬h 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c όοΫτϥοΫ 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c e సͯ͠ܧଓ 9 / 45 -
DPLL [Davis+, 1962] C1 : a ∨ b C2 :
c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c e సͯ͠ܧଓ DPLL ≒ ਂ͞༏ઌ୳ࡧ + ୯Ґ 9 / 45 -
CDCL [Bayardo Jr.+, 1997, Marques-Silva+, 1999] C1 : a ∨
b C2 : c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c ¬e f g ¬i ໃ६ൃੜ: h ∧ ¬h 10 / 45 -
CDCL [Bayardo Jr.+, 1997, Marques-Silva+, 1999] C1 : a ∨
b C2 : c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i LC8 : ¬b ∨ ¬f Lv 1 Lv 2 Lv 3 ܾఆ ¬a b c ¬e f g ¬i ֶशઅΛੜ: ¬b ∨ ¬f 10 / 45 -
CDCL [Bayardo Jr.+, 1997, Marques-Silva+, 1999] C1 : a ∨
b C2 : c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i LC8 : ¬b ∨ ¬f Lv 1 Lv 2 Lv 3 ܾఆ ¬a b Lv 2 όοΫδϟϯϓ 10 / 45 -
CDCL [Bayardo Jr.+, 1997, Marques-Silva+, 1999] C1 : a ∨
b C2 : c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i LC8 : ¬b ∨ ¬f Lv 1 Lv 2 Lv 3 ܾఆ ¬a b ¬f e ୯Ґ 10 / 45 -
CDCL [Bayardo Jr.+, 1997, Marques-Silva+, 1999] C1 : a ∨
b C2 : c ∨ d C3 : a ∨ e ∨ f C4 : ¬b ∨ ¬f ∨ g C5 : ¬f ∨ h C6 : ¬b ∨ ¬h ∨ i C7 : ¬g ∨ ¬i LC8 : ¬b ∨ ¬f Lv 1 Lv 2 Lv 3 ܾఆ ¬a b ¬f e CDCL ≒ DPLL + ໃ६ղੳ + અֶश 10 / 45 -
SAT ιϧόʔͷΈͷྺ࢙ X 1960 DPLL (Davis-Putnam-Logemann-Loveland) [Davis+, 1962]
X 1990 CDCL (Conict Driven Clause Learning) [Bayardo Jr.+, 1997, Marques-Silva+, 1999] X 2000 Ҏ߱ มબώϡʔϦεςΟοΫ VSIDS [Moskewicz+, 2001] 2 ϦςϥϧΥον [Moskewicz+, 2001] Ϧελʔτ [Luby+, 1993, Selman+, 1996, Eén+, 2003] Phase Saving [Pipatsrisawat+, 2007] ֶशઅͷධՁई [Audemard+, 2009, ುౡ+, 2012] 11 / 45 -
SAT ιϧόʔͷΈͷྺ࢙ X 1960 DPLL (Davis-Putnam-Logemann-Loveland) [Davis+, 1962]
X 1990 CDCL (Conict Driven Clause Learning) [Bayardo Jr.+, 1997, Marques-Silva+, 1999] X 2000 Ҏ߱ มબώϡʔϦεςΟοΫ VSIDS [Moskewicz+, 2001] 2 ϦςϥϧΥον [Moskewicz+, 2001] Ϧελʔτ [Luby+, 1993, Selman+, 1996, Eén+, 2003] Phase Saving [Pipatsrisawat+, 2007] ֶशઅͷධՁई [Audemard+, 2009, ುౡ+, 2012] Ͳͷٕज़͕Ͳͷ͘Β͍ޮ͍͍ͯΔͷ͔? 11 / 45 -
ߴԽٕज़ͷߩݙ (Katebi ଞʹΑΔ) [Katebi+, 2011] X 2WL: 2 ϦςϥϧΥον, RST:
Ϧελʔτ, PHS: Phase Saving ੨ࣈ: DPLL ʹͦͷٕज़ΛՃͨ͠ιϧόʔ 12 / 45 -
ߴԽٕज़ͷߩݙ (Katebi ଞʹΑΔ) [Katebi+, 2011] X 2WL: 2 ϦςϥϧΥον, RST:
Ϧελʔτ, PHS: Phase Saving ࣈ: MiniSat 2.2 ͔Βͦͷٕज़Λআͨ͠ιϧόʔ 12 / 45 -
ߴԽٕज़ͷߩݙ (Katebi ଞʹΑΔ) [Katebi+, 2011] X 2WL: 2 ϦςϥϧΥον, RST:
Ϧελʔτ, PHS: Phase Saving ࣈ: MiniSat 2.2 ͔Βͦͷٕज़Λআͨ͠ιϧόʔ ܧଓͨ͠ߴԽΛࢧ͑Δͷ ຖ։࠵͞ΕΔ SAT ιϧόʔͷࠃࡍڝٕձʂ 12 / 45 -
SAT ιϧόʔͷࠃࡍڝٕձ (SAT Competition) త X ઓతͳϕϯνϚʔΫΛΈ͚ͭΔ͜ͱ X SAT ιϧόʔ։ൃͷଅਐ͢Δ͜ͱ
X ݱঢ়ͷιϧόʔͷεφοϓγϣοτධՁΛߦ͏͜ͱ ྺ࢙ 1992 ͔Β SAT ιϧόʔͷࠃࡍڝٕձ (SAT Competition, SATRace, SAT Challenge) ͕։࠵͞Ε͍ͯΔɽ X 3 competitions in the 90s (1992, 1993, 1996) X 17 SAT Competitions (2002) ˞ 2025 ࣌ X 5 SAT Races (2006, 2008, 2010, 2015, 2019) X 1 SAT Challenge (2012) 13 / 45 -
SAT ιϧόʔͷࠃࡍڝٕձ ࢀՃιϧόʔͷιʔείʔυ͕ݪଇެ։ X ࠷৽ͷٕज़ɾ࣮Λ୭ͰೖखͰ͖ɼࣗͷΞΠσΞΛ্ ͤͰ͖Δ X ৽نࢀೖͷෑډ͕͘ͳΔ X ڝ૪͕ܹ͘͠ͳΔ
X ΄΅ຖ༏উιϧόʔ͕มΘΓɼ༏উιϧόʔʹԿΒ͔ͷ ৽͍͠ΞΠσΞ͕ೖ͍ͬͯΔɽ ͜ͷ׆ൃͳڝٕձ͕ SAT ιϧόʔͷੑೳ্ͱίϛϡχςΟͷৢ ʹେ͖͘ߩݙ͍ͯ͠Δʂ 2025 Ͳ͏͔ͩͬͨ? 2025 ͷ༏উιϧόදతͳ࣮Ͱ͋Δ Kissat ͷެ։ίʔυͷ ώϡʔϦεςΟοΫઓུΛ LLM Λ༻͍ͯࣗಈ࠷దԽͨ͠ͷɽ 14 / 45 -
ൃද༰ X SAT ιϧόʔ (DPLL/CDCL) X SAT ιϧόʔͷ֦ு SAT
ූ߸Խ LCG ιϧόʔ: OR-Tools (CP-SAT) SMT ιϧόʔ: Z3, CVC X ߹ͤʹԿΛ͑ྑ͍ͷ? 2 ࣍ݩۣܗύοΩϯάΛྫʹͨ͠ੑೳධՁͷҰྫ CPLEX, Gurobi, SCIP CP Optimizer, OR-Tools (CP-SAT), ACE Z3, CVC5 15 / 45 -
Ͳ͏໋ͬͯࣜҎ֎ͷ੍Λѻ͑ΔΑ͏ ʹ͢Δͷ͔? ߹ͤͷྫ ม: x, y ∈ {2, 3, 4,
5, 6} ੍: (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ 4) ∨ (2x + y ≤ 13) ූ߸ԽΛ͏ํ๏ มΛ໋ม͓Αͼཧࣜʹม͢Δ ੍Λ໋ཧࣜʹม͢Δ 16 / 45 -
ූ߸Խ [de Kleer, 1989] ΞΠσΞ ֤ม x ͱͦͷυϝΠϯͷ֤ i ʹରͯ͠ɼx
= i Λද໋͢ ม px=i Λ༻͍Δɽ ม x ∈ {2, 3, 4, 5, 6} ʹରͯ͠༻͍Δ໋ม px=2 , px=3 , px=4 , px=5 , px=6 มৗʹͪΐ͏Ͳ 1 ͭʹ͔͠औΒͳ͍͜ͱΛҎԼͷઅͰ දݱ͢Δɽ (px=2 ∨ px=3 ∨ px=4 ∨ px=5 ∨ px=6 ) ∧ (গͳ͘ͱ 1 ͭ) ∧ 2≤i<j≤6 ¬px=i ∨ ¬px=j (ߴʑ 1 ͭ) 17 / 45 -
ූ߸Խ [de Kleer, 1989] px=2 px=3 px=4 px=5 px=6 x
= 2 T F F F F x = 3 F T F F F x = 4 F F T F F x = 5 F F F T F x = 6 F F F F T มͷׂʹԠͯ͡ɼ໋ม 1 ͚ͭͩ T ͱͳΔɽ͍ ΘΏΔ one-hot දݱͰ͋Δɽ 18 / 45 -
ූ߸Խ [de Kleer, 1989, Walsh, 2000] ੍ x + y
≤ 7 (x, y ∈ {2, 3, 4, 5, 6}) ɼҧ (ਤதͷ × ) Λ ྻڍ͢Δ͜ͱͰҎԼͷ 15 અʹූ߸Խ͞ΕΔɽ ¬(px=2 ∧ py=6 ) ¬(px=3 ∧ py=5 ) ¬(px=3 ∧ py=6 ) ¬(px=4 ∧ py=4 ) ¬(px=4 ∧ py=5 ) ¬(px=4 ∧ py=6 ) ¬(px=5 ∧ py=3 ) ¬(px=5 ∧ py=4 ) ¬(px=5 ∧ py=5 ) ¬(px=5 ∧ py=6 ) ¬(px=6 ∧ py=2 ) ¬(px=6 ∧ py=3 ) ¬(px=6 ∧ py=4 ) ¬(px=6 ∧ py=5 ) ¬(px=6 ∧ py=6 ) x y 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 X X X X X X X X X X X X X X X 19 / 45 -
ॱংූ߸Խ [Tamura+, 2009] ΞΠσΞ ֤ม x ͱͦͷυϝΠϯͷ֤ i ʹରͯ͠ɼx ≥
i Λද໋͢ ม px≥i Λ༻͍Δɽ ֤ม x ʹରͯ͠༻͍Δ໋ม px≥3 , px≥4 , px≥5 , px≥6 มͷͷॱংؔΛҎԼͷઅͰදݱ͢Δɽ ¬px≥6 ∨ px≥5 (x ≥ 6 ͳΒ x ≥ 5) ¬px≥5 ∨ px≥4 (x ≥ 5 ͳΒ x ≥ 4) ¬px≥4 ∨ px≥3 (x ≥ 4 ͳΒ x ≥ 3) 20 / 45 -
ॱংූ߸Խ [Tamura+, 2009] px≥2 px≥3 px≥4 px≥5 x = 2
F F F F x = 3 T F F F x = 4 T T F F x = 5 T T T F x = 6 T T T T มͷׂʹԠͯ͡ɼ໋ม 1 ਐ (aka. thermometer) දݱͱͳΔɽ 21 / 45 -
ॱংූ߸Խ [Tamura+, 2009] ੍ x + y ≤ 7 (x,
y ∈ {2, 3, 4, 5, 6}) ɼҧ͢ΔൣғΛද͢͜ͱ ͰҎԼͷ 5 અʹූ߸Խ͞ΕΔɽ ¬py≥6 ¬(px≥3 ∧ py≥5 ) ¬(px≥4 ∧ py≥4 ) ¬(px≥5 ∧ py≥3 ) ¬px≥6 x y 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 X X X X X X X X X X X X X X X 22 / 45 -
ॱংූ߸Խ [Tamura+, 2009] ੍ x + y ≤ 7 (x,
y ∈ {2, 3, 4, 5, 6}) ɼҧ͢ΔൣғΛද͢͜ͱ ͰҎԼͷ 5 અʹූ߸Խ͞ΕΔɽ ¬py≥6 ¬(px≥3 ∧ py≥5 ) ¬(px≥4 ∧ py≥4 ) ¬(px≥5 ∧ py≥3 ) ¬px≥6 x y 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 X X X X X X X X X X X X X X X 22 / 45 -
ॱংූ߸Խ [Tamura+, 2009] ੍ x + y ≤ 7 (x,
y ∈ {2, 3, 4, 5, 6}) ɼҧ͢ΔൣғΛද͢͜ͱ ͰҎԼͷ 5 અʹූ߸Խ͞ΕΔɽ ¬py≥6 ¬(px≥3 ∧ py≥5 ) ¬(px≥4 ∧ py≥4 ) ¬(px≥5 ∧ py≥3 ) ¬px≥6 x y 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 X X X X X X X X X X X X X X X 22 / 45 -
ॱংූ߸Խ [Tamura+, 2009] ੍ x + y ≤ 7 (x,
y ∈ {2, 3, 4, 5, 6}) ɼҧ͢ΔൣғΛද͢͜ͱ ͰҎԼͷ 5 અʹූ߸Խ͞ΕΔɽ ¬py≥6 ¬(px≥3 ∧ py≥5 ) ¬(px≥4 ∧ py≥4 ) ¬(px≥5 ∧ py≥3 ) ¬px≥6 x y 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 X X X X X X X X X X X X X X X 22 / 45 -
ॱংූ߸Խ [Tamura+, 2009] ੍ x + y ≤ 7 (x,
y ∈ {2, 3, 4, 5, 6}) ɼҧ͢ΔൣғΛද͢͜ͱ ͰҎԼͷ 5 અʹූ߸Խ͞ΕΔɽ ¬py≥6 ¬(px≥3 ∧ py≥5 ) ¬(px≥4 ∧ py≥4 ) ¬(px≥5 ∧ py≥3 ) ¬px≥6 x y 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 X X X X X X X X X X X X X X X 22 / 45 -
ॱংූ߸Խ [Tamura+, 2009] ੍ x + y ≤ 7 (x,
y ∈ {2, 3, 4, 5, 6}) ɼҧ͢ΔൣғΛද͢͜ͱ ͰҎԼͷ 5 અʹූ߸Խ͞ΕΔɽ ¬py≥6 ¬(px≥3 ∧ py≥5 ) ¬(px≥4 ∧ py≥4 ) ¬(px≥5 ∧ py≥3 ) ¬px≥6 x y 1 2 3 4 5 6 7 0 1 2 3 4 5 6 7 X X X X X X X X X X X X X X X 22 / 45 -
߹ͤͷSAT ූ߸Խ Ҏ߱ɼDE, OE Λූ߸Խɼॱংූ߸ԽΛදࣸ͢૾ͱ͢Δɽ x, y ∈ {2, 3,
4, 5, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) ∧ (x − y ≤ 4) ∨ (2x + y ≤ 13) ݩͷ OE(x) OE(y) p ∨ q r ∨ s p ↔ OE(x + y ≤ 7) q ↔ OE(x − 2y ≥ 3) r ↔ OE(x − y ≤ −4) s ↔ OE(2x + y ≤ 13) SAT (ॱংූ߸Խ) ⇐⇒ ͜ͷΑ͏ʹූ߸ԽʹΑΓ CNF ΛಘΔ͜ͱ͕Ͱ͖ΕɼSAT ιϧ όʔͰղ͘͜ͱ͕Ͱ͖Δɽ 23 / 45 -
ൃද༰ X SAT ιϧόʔ (DPLL/CDCL) X SAT ιϧόʔͷ֦ு SAT
ූ߸Խ LCG ιϧόʔ: OR-Tools (CP-SAT) SMT ιϧόʔ: Z3, CVC X ߹ͤʹԿΛ͑ྑ͍ͷ? 2 ࣍ݩۣܗύοΩϯάΛྫʹͨ͠ੑೳධՁͷҰྫ CPLEX, Gurobi, SCIP CP Optimizer, OR-Tools (CP-SAT), ACE Z3, CVC5 24 / 45 -
LCG ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) CNF (SAT ιϧόʔ) OE(x) ∧ OE(y) DE(x) ∧ DE(y) ChannelingCon Lv 1 Lv 2 ܾఆ ੍ث (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) 25 / 45 -
LCG ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) CNF (SAT ιϧόʔ) OE(x) ∧ OE(y) DE(x) ∧ DE(y) ChannelingCon Lv 1 Lv 2 ܾఆ px=2 ੍ث (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) 25 / 45 -
LCG ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) CNF (SAT ιϧόʔ) OE(x) ∧ OE(y) DE(x) ∧ DE(y) ChannelingCon Lv 1 Lv 2 ܾఆ px=2 ੍ث (x + y ≤ 7) ∨ (x − 2y ≥ 3) x = 2 → (y ≤ 5) ∨ ⊥ (x − y ≤ −4) ∨ (2x + y ≥ 13) x = 2 → (y ≥ 6) ∨ ⊥ 25 / 45 -
LCG ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) CNF (SAT ιϧόʔ) OE(x) ∧ OE(y) DE(x) ∧ DE(y) ChannelingCon Lv 1 Lv 2 ܾఆ px=2 py=4 ੍ث (x + y ≤ 7) ∨ (x − 2y ≥ 3) x = 2 → (y ≤ 5) ∨ ⊥ (x − y ≤ −4) ∨ (2x + y ≥ 13) x = 2 → (y ≥ 6) ∨ ⊥ 25 / 45 -
LCG ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) CNF (SAT ιϧόʔ) OE(x) ∧ OE(y) DE(x) ∧ DE(y) ChannelingCon Lv 1 Lv 2 ܾఆ px=2 py=4 ੍ʹΑΓໃ६ݕग़ ੍ث (x + y ≤ 7) ∨ (x − 2y ≥ 3) x = 2 → (y ≤ 5) ∨ ⊥ (x − y ≤ −4) ∨ (2x + y ≥ 13) x = 2 → (y ≥ 6) ∨ ⊥ 25 / 45 -
LCG ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) CNF (SAT ιϧόʔ) OE(x) ∧ OE(y) DE(x) ∧ DE(y) ChannelingCon px=2 → py≤5 px=2 → py≥6 ¬px=2 ∨ ¬py=4 Lv 1 Lv 2 ܾఆ અͱֶशઅΛ CNF ʹՃ͠ bj ੍ث (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) 25 / 45 -
LCG ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) CNF (SAT ιϧόʔ) OE(x) ∧ OE(y) DE(x) ∧ DE(y) ChannelingCon px=2 → py≤5 px=2 → py≥6 ¬px=2 ∨ ¬py=4 Lv 1 Lv 2 ܾఆ ੍ث (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) (ྑ͍ͱ͜Ζ) গͳ͍અͰղ͖࢝ΊΔ͜ͱ͕Ͱ͖Δɽ (ѱ͍ͱ͜Ζ) ֶशઅͷ֫ಘ͕͘ͳΔɽ 25 / 45 -
ൃද༰ X SAT ιϧόʔ (DPLL/CDCL) X SAT ιϧόʔͷ֦ு SAT
ූ߸Խ LCG ιϧόʔ: OR-Tools (CP-SAT) SMT ιϧόʔ: Z3, CVC X ߹ͤʹԿΛ͑ྑ͍ͷ? 2 ࣍ݩۣܗύοΩϯάΛྫʹͨ͠ੑೳධՁͷҰྫ CPLEX, Gurobi, SCIP CP Optimizer, OR-Tools (CP-SAT), ACE Z3, CVC5 26 / 45 -
SMT ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) ∨ (x − 2y ≥ 3) (x − y ≤ −4) ∨ (2x + y ≥ 13) CNF (SAT ιϧόʔ) Lv 1 Lv 2 ܾఆ എܠཧιϧόʔ 27 / 45 -
SMT ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) p ∨ (x − 2y ≥ 3) q (x − y ≤ −4) r ∨ (2x + y ≥ 13) s CNF (SAT ιϧόʔ) p ∨ q r ∨ s Lv 1 Lv 2 ܾఆ എܠཧιϧόʔ 27 / 45 -
SMT ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) p ∨ (x − 2y ≥ 3) q (x − y ≤ −4) r ∨ (2x + y ≥ 13) s CNF (SAT ιϧόʔ) p ∨ q r ∨ s Lv 1 Lv 2 ܾఆ q എܠཧιϧόʔ x − 2y ≥ 3 27 / 45 -
SMT ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) p ∨ (x − 2y ≥ 3) q (x − y ≤ −4) r ∨ (2x + y ≥ 13) s CNF (SAT ιϧόʔ) p ∨ q r ∨ s Lv 1 Lv 2 ܾఆ q r എܠཧιϧόʔ x − 2y ≥ 3 x − y ≤ −4 27 / 45 -
SMT ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) p ∨ (x − 2y ≥ 3) q (x − y ≤ −4) r ∨ (2x + y ≥ 13) s CNF (SAT ιϧόʔ) p ∨ q r ∨ s Lv 1 Lv 2 ܾఆ q r ཧʹΑΓໃ६ݕग़ എܠཧιϧόʔ x − 2y ≥ 3 x − y ≤ −4 27 / 45 -
SMT ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) p ∨ (x − 2y ≥ 3) q (x − y ≤ −4) r ∨ (2x + y ≥ 13) s CNF (SAT ιϧόʔ) p ∨ q r ∨ s ¬q ∨ ¬r Lv 1 Lv 2 ܾఆ q ֶशઅ ¬q ∨ ¬r ΛՃ͠ backjump എܠཧιϧόʔ x − 2y ≥ 3 27 / 45 -
SMT ιϧόʔ ݩͷ x, y ∈ {2, . . .
, 6} (x + y ≤ 7) p ∨ (x − 2y ≥ 3) q (x − y ≤ −4) r ∨ (2x + y ≥ 13) s CNF (SAT ιϧόʔ) p ∨ q r ∨ s ¬q ∨ ¬r Lv 1 Lv 2 ܾఆ q ¬r ୯Ґ എܠཧιϧόʔ x − 2y ≥ 3 x − y > −4 (ྑ͍ͱ͜Ζ) SAT ͱཧιϧόʔͷ͕ग़དྷΔɽ (ѱ͍ͱ͜Ζ) ԣஅతͳֶश͕͍͠ɽ 27 / 45 -
ൃද༰ X SAT ιϧόʔ (DPLL/CDCL) X SAT ιϧόʔͷ֦ு SAT
ූ߸Խ LCG ιϧόʔ: OR-Tools (CP-SAT) SMT ιϧόʔ: Z3, CVC X ߹ͤʹԿΛ͑ྑ͍ͷ? 2 ࣍ݩۣܗύοΩϯάΛྫʹͨ͠ੑೳධՁͷҰྫ CPLEX, Gurobi, SCIP CP Optimizer, OR-Tools (CP-SAT), ACE Z3, CVC5 28 / 45 -
ۣܗύοΩϯάΛྫʹͨ͠ੑೳධՁ త ߹ͤʹ͓͚Διϧόʔੑೳͷ 1 ͭͷࢀߟࢿྉΛ࡞Δ͜ͱ ൺֱͨ͠ιϧόʔ X ཧ࠷దԽιϧόʔ: CPLEX, Gurobi,
SCIP, OR-Tools CBC X CP ιϧόʔ: OR-Tools (CP-SAT), ACE X SMT ιϧόʔ: Z3, CVC5 ϕϯνϚʔΫ: Consecutive Square Packing X ೖྗ: n X ੍: 1x1, 2x2, ..., nxn ͷਖ਼ํܗΛॏͳΒͣʹஔ͢Δ X ग़ྗ: શͯͷਖ਼ํܗΛஔ͢Δͷʹඞཁͳ࠷খͷਖ਼ํܗίϯ ςφͷล 10 ͔Β 100 ·Ͱͷ 90 ͓Αͼ 500, 1000 ͷ 2 ͷ߹ܭ 92 ɽ 29 / 45 -
ܭࢉػ࣮ݧ (ଓ͖) ࣮ݧઃఆ X CPU: Intel(R) Xeon(R) Gold 6346 CPU
@ 3.10GHz X MEM: 128 GB X ੍࣌ؒݶ: 1800 ඵ X ࣮ߦ֤ιϧόʔͷઃఆͰγϯάϧεϨουʹ੍ݶ ධՁࢦඪ ࠷దΛݟ͚ͭͨͱܭࢉ࣌ؒ (ΧΫλεϓϩοτ) ੍ݶ࣌ؒʹݟ͚ͭͨ࠷ྑղͷ࣭ (ώʔτϚοϓ) ँࣙ ͜ͷൺֱͰ Gurobi ࣾɼIBM ͔ࣾΒି༩͞Εֶͨज़ϥΠηϯεΛ ༻͠·ͨ͠ɽޚྱਃ্͛͠·͢ɽ 30 / 45 -
1) ࠷దΛݟ͚ͭͨͱܭࢉ࣌ؒ 2 4 6 8 10 12 14 16
Number of Instances Solved 0 200 400 600 800 1000 1200 1400 Wall Clock Time (seconds) ace cplex cpoptimizer cvc5 gurobi_indicator_int_all gurobi_indicator_int_obj gurobi_indicator_mip ortools_cbc ortools_cpsat scip z3 31 / 45 -
2) ੍ݶ࣌ؒʹݟ͚ͭͨ࠷ྑղͷ࣭ X ԣ࣠: ΠϯελϯεͷೖྗαΠζ n X ॎ࣠: ιϧόʔ X
৭: =࠷ྑ, =ղग़͕ͨ࠷ѱ, =ղ͕ग़ͳ͔ͬͨ ⋆=࠷ద 10 20 30 40 50 60 70 80 90 100 Z3 SCIP GRB-IO CPOpt OR-SAT 32 / 45 -
SAT ٕज़ͷԠ༻ SAT PB ASP ALLSAT #SAT QBF SMT MaxSAT
CSP/COP ج൫ٕज़ DPLL/CDCL 33 / 45 -
SAT ٕज़ͷԠ༻ SAT PB ASP ALLSAT #SAT QBF SMT MaxSAT
CSP/COP ج൫ٕज़ DPLL/CDCL 33 / 45 -
ϋΠϒϦουූ߸Խ [Soh+, 2017] X ॱংූ߸Խ [Tamura+, 2009] (࣮: Sugar MA>
) ੑೳྑ͍͕ɼͷن͕େ͖͘ͳΔͱੑೳ͕ѱ͘ͳΔɽ X ରූ߸Խ [Iwama+, 1994] ੑೳѱ͍͕ɼ ͷن͕େ͖ͯ͘ղ͘͜ͱ͕Ͱ ͖Δɽ X ϋΠϒϦουූ߸Խ [Soh+, 2017] (࣮: Fun-sCOP MA> ) ҙͷූ߸ԽΛνϟωϦϯά੍ແ͠Ͱ߹ͤΔ͜ͱ͕Ͱ͖Δ ූ߸Խ๏ɽ ॱংූ߸Խͱରූ߸ԽΛ༥߹͢Δ͜ͱͰྑ͍ͱ͜ΖΛ߹ͤ ͨූ߸ԽΛ࡞Δ͜ͱ͕Մೳɽ ֤มॱংූ߸Խ͘͠ରූ߸ԽͷͲͪΒ͔ҰͭͰ ූ߸Խ͞Εɼ੍֤྆ํͷූ߸ԽมΛؚΉ͜ͱ͕Ͱ͖Δɽ 34 / 45 -
ϋΠϒϦουූ߸Խ: ྫ ม x1 , x2 ∈ {0, 1, 2,
3} Λߟ͑Δ. ੍ 2x1 + x2 ≥ 5 τL {x2} ◦ τO {x1} ʹΑͬͯҎԼͷΑ͏ʹූ߸Խ͞ΕΔ. (τL {x2} ◦ τO {x1} )(2x1 + x2 ≥ 5) ⇐⇒ τO {x1} (2x1 + px2,0 + 2px2,1 ≥ 5) ⇐⇒ ∧ d1∈{0,1,2,3} (x1 ≥ d1 + 1) ∨ (px2,0 + 2px2,1 ≥ 5 − 2d1 ) ⇐⇒ (px1≤1 ) ∧ (px1≤2 ∨ (px2,0 + 2px2,1 ≥ 3)) ∧ (px1≤3 ∨ (px2,0 + 2px2,1 ≥ 1)) 35 / 45 -
։ൃͨ͠CSP ιϧόʔFun-sCOP ͷྺ ࠃࡍ CSP ιϧόʔڝٕձ XCSP3 2005 ʹͦͷલ͕࢝·ͬͨྺ࢙ͷ͋Δࠃࡍ
CSP ιϧ όʔڝٕձͰ͋Γɼੈք֤ࠃͷڭҭݚڀػؔͰ։ൃ͞Ε͍ͯΔ CSP ιϧόʔ͕ଟࢀՃ͍ͯ͠Δ. X Fun-sCOP 2018 Ҏ߱ XCSP3 ʹ͓͚Δ࠷ॏཁͳ෦Ͱ ͋Δ Main CSP ʹຖճࢀՃ͠ҎԼͷΛ͓͞Ί͍ͯΔɽ X 2018 ༏উ X 2019 ४༏উ X 2022 ४༏উ X 2023 ४༏উ X 2024 3 Ґೖ ࠃࡍձٞ CP18 ͷ݁Ռൃද 36 / 45 -
γεςϜੜֶͱҨࢠ੍ޚωοτϫʔΫ X γεςϜੜֶͱɼੜͷ׆ಈΛҨࢠɾλϯύΫ࣭ɾࡉ ๔ͳͲ͕૬ޓʹ࡞༻͢ΔෳࡶͳγεςϜͱͯ͠ଊ͑ɼͦͷશ ମతͳڍಈػೳΛཧղ͠Α͏ͱ͢ΔֶͰ͋Δɽ The Nobel Committee for Physiology
or Medicine / Illustration: Annika Röhl Ҩࢠ a λϯύΫ࣭ a Ҩࢠ b λϯύΫ࣭ b X Ҩࢠ੍ޚωοτϫʔΫͱɼҨࢠͷ૬ޓ࡞༻ΛΛҨ ࢠɼลΛௐઅҼࢠͱͨ͠άϥϑͰදݱͨ͠ͷͰ͋Δɽ 37 / 45 -
ϒʔϦΞϯωοτϫʔΫͱෆಈ ϒʔϦΞϯωοτϫʔΫ (BN) BN Ҩࢠ੍ޚωοτϫʔΫͷදతͳཧϞσϧͷ 1 ͭͰ͋ ΔɽҨࢠͷঢ়ଶΛ 1 ͱ
0 ͷೋɼௐઅҼࢠ໋ཧࣜͰද͢ɽ v1 v2 v3 vt+1 1 = vt 2 vt+1 2 = ¬vt 3 vt+1 3 = ¬vt 1 ∧ vt 2 ঢ়ଶભҠਤͱෆಈ 000 010 011 001 100 110 111 101 े͘ભҠΛଓ͚Δͱ 110 (ෆ ಈ) ʹ౸ୡ͠ભҠ͠ͳ͘ͳΔ (≓ ࡉ๔ͷఆৗ (࠷ऴ) ঢ়ଶ)ɽ 38 / 45 -
SAT ܕBN ෆಈܭιϧόʔ [Higuchi+, 2025] ͜Ε·Ͱͷख๏ΛෆಈͷܭʹԠ༻͢Δ͜ͱͰطଘݚڀΛେ͖ ্͘ճΔੑೳΛୡͨ͠ɽ 0.01 0.1 1
10 100 1000 0 50 100 150 200 250 300 CPU Time [s] Solved Instances PyBoolNet fASP-conj SAF fASP-src Hybrid Enum. AEON Direct Count. Indirect Count. Hybrid Count. 39 / 45 -
ະͷෆಈͷܭ [Higuchi+, 2025] ෆಈͷ͕ະͰ࣮͋ͬͨੈքͷωοτϫʔΫʹର͠ɼͦͷ Λਖ਼֬ʹܭ͢Δ͜ͱʹޭͨ͠ (IJCAI 2025 Ͱൃද). Instance #Vars
#Attractors #113 ER-STRESS 182 1168455003694263561093120 #122 NSP14 168 33278627362665583108034953216 #124 NSP9-PROTEIN 252 13611294676837538538534984297270728458240 #144 SNF1-AMPK-PATHWAY 202 10096027719780900754667077632 #220 H.-RESPONSE-IN-L. 342 2656331146614175432704000 #221 MYCOBACTERIAL-L. 317 2473901162496 Alzheimer 762 1355318094474400392445140020586319209- -7103960354330270737143428036029317120 Cholocystokinin 383 47935169240579835005239296 Yeast-Pheromone 246 5711631030629640192 40 / 45 -
·ͱΊ X SAT ιϧόʔͱ੍ιϧόʔͷجૅٕज़ͱ࠷৽ಈΛհ DPLL/CDCL ΞϧΰϦζϜ͕ج൫ٕज़ X SAT ιϧόʔͷ֦ுͱԠ༻
SAT ූ߸Խ (ූ߸Խɾॱংූ߸Խ) ʹΑΔม LCG ιϧόʔ (OR-Tools CP-SAT): Ԇූ߸ԽͰޮԽ SMT ιϧόʔ (Z3, CVC5): ཧͱΈ߹Θͤͨਪ 2 ࣍ݩۣܗύοΩϯάͷੑೳධՁ X ۙͷݚڀՌ ϋΠϒϦουූ߸Խ (Fun-sCOP): ॱংූ߸Խͱରූ߸Խͷ༥߹ ϒʔϧ੍ޚωοτϫʔΫͷෆಈܭ (IJCAI 2025) ASP: એݴతͳهड़ͱ࣮༻γεςϜ (ASPITAL) 43 / 45 -
·ͱΊ X SAT ιϧόʔͱ੍ιϧόʔͷجૅٕज़ͱ࠷৽ಈΛհ DPLL/CDCL ΞϧΰϦζϜ͕ج൫ٕज़ X SAT ιϧόʔͷ֦ுͱԠ༻
SAT ූ߸Խ (ූ߸Խɾॱংූ߸Խ) ʹΑΔม LCG ιϧόʔ (OR-Tools CP-SAT): Ԇූ߸ԽͰޮԽ SMT ιϧόʔ (Z3, CVC5): ཧͱΈ߹Θͤͨਪ 2 ࣍ݩۣܗύοΩϯάͷੑೳධՁ X ۙͷݚڀՌ ϋΠϒϦουූ߸Խ (Fun-sCOP): ॱংූ߸Խͱରූ߸Խͷ༥߹ ϒʔϧ੍ޚωοτϫʔΫͷෆಈܭ (IJCAI 2025) ASP: એݴతͳهड़ͱ࣮༻γεςϜ (ASPITAL) Take Home Message: SAT can be your best friend! 43 / 45 -
ݚڀϓϩδΣΫτ X ࠓհͨ͠ݚڀ൪ݪກଇઌੜ (໊ݹେֶ) ͱುౡӳઌ ੜ (ࢁསେֶ) ͱߦ͖ͬͯͨɽ X ࠓ͔Β
3 ਓͰ৽͘͠ KRR (Knowledge Representation and Reasoning) ϓϩδΣΫτΛ࢝Ίͨɽ X େֶͰ൪ݪઌੜͱೋਓͰݚڀࣨΛӡӦ͍ͯ͠Δɽ X ڵຯͷ͋Δํͥͻ࿈བྷΛʂ 44 / 45 -
Algorithm 1: SAT ιϧόʔ (CDCL) ೖྗ: CNF ܗࣜͷཧࣜ ψɼ෦ׂͯ α
ग़ྗ: SAT ͘͠ UNSAT ܾఆϨϕϧ ← 0; while true do ! (res, α) ← ୯Ґ(ψ, α); " if res = done then return SAT; # if res = conflict then $ if ܾఆϨϕϧ = 0 then return UNSAT; % (C, bl) ← ໃ६ղੳ(ψ, ν) ; // ֶशઅͱ bl Λܭࢉ & ψ ← ψ ∪ {C} ; // ֶशઅͷՃ ' ν ← {(xi , vi ) ∈ ν | level(xi ) ≤ bl} ; // backjump dl ← bl; else dl ← dl + 1; ! ະׂͯม x ͱͦͷ v ΛબͿ; " α ← α ∪ {(x, v)}; 2 / 11 -
Algorithm 2: LCG ιϧόʔ ೖྗ: (X, D, C)ɼ෦ׂͯ α, ग़ྗ:
SAT/ UNSAT 1 (P, ψ) ← มΛූ߸Խ(X, D); dl ← 0; 2 while true do 3 (res, α) ← ୯Ґ(ψ, α); 4 (res, α) ← ੍(C, α); 5 if res = done then return SAT; 6 if res = conflict then 7 if dl = 0 then return UNSAT; // ໋Ϩϕϧ/Ϩϕϧͷ/ֶशઅͱ bl Λܭࢉ 8 (C, bl) ← ໃ६ղੳ(ψ, C, α) ; 9 ψ ← ψ ∪ C ; // ֶशઅͷՃ 10 α ← {(pi , vi ) ∈ α | level(pi ) ≤ bl} ; // backjump 11 dl ← bl; 12 else 13 dl ← dl + 1; 14 ະׂͯม p ∈ P ͱͦͷ v ΛબͿ; 15 α ← α ∪ {(p, v)}; 3 / 11 -
Algorithm 3: SMT ιϧόʔ ೖྗ: (X, T)ɼ෦ׂͯ α, ग़ྗ: SAT/
UNSAT 1 (P, ψ) ← ໋நԽ(X, T); dl ← 0; 2 while true do 3 (res, α) ← ୯Ґ(ψ, α); 4 (res, α) ← ཧ(T, α); 5 if res = done then return SAT; 6 if res = conflict then 7 if dl = 0 then return UNSAT; // ໋ϨϕϧͱཧϨϕϧͷֶशઅͱ bl Λܭࢉ 8 (C, bl) ← ໃ६ղੳ(ψ, T, α) ; 9 ψ ← ψ ∪ C ; // ֶशઅͷՃ 10 α ← {(pi , vi ) ∈ α | level(pi ) ≤ bl} ; // backjump 11 dl ← bl; 12 else 13 dl ← dl + 1; 14 ະׂͯม p ∈ P ͱͦͷ v ΛબͿ; 15 α ← α ∪ {(p, v)}; 4 / 11 -
Reference I Audemard, Gilles and Simon, Laurent (2009). Predicting learnt
clauses quality in modern SAT solvers. In Proceedings of the 21st International Joint Conference on Articial Intelligence (IJCAI 2009), pages 399404. Bayardo Jr., Roberto J. and Schrag, Robert (1997). Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th National Conference on Articial Intelligence (AAAI 1997), pages 203208. Davis, Martin, Logemann, George , and Loveland, Donald W. (1962). A machine program for theorem-proving. Communications of the ACM, 5(7):394397. 5 / 11 -
Reference II de Kleer, Johan (1989). A comparison of ATMS
and CSP techniques. In Proceedings of the 11th International Joint Conference on Articial Intelligence (IJCAI 1989), pages 290296. Eén, Niklas and Sörensson, Niklas (2003). An extensible SAT-solver. In Proceedings of the 6th International Conference on Theory and Applications of Satisability Testing (SAT 2003), LNCS 2919, pages 502518. ುౡ ӳ, ؠপ ࣏ , Ҫ্ ࠀາ (2012). Glueminisat 2.2.5: ୯ҐൖΛଅֶ͢शઅͷੵۃత֫ಘઓུʹ جͮ͘ߴ SAT ιϧόʔ. ίϯϐϡʔλιϑτΣΞ, 29(4):211230. 6 / 11 -
Reference III Higuchi, Rei, Soh, Takehide, Berre, Daniel Le, Magnin,
Morgan, Banbara, Mutsunori , and Tamura, Naoyuki (2025). A sat-based method for counting all singleton attractors in boolean networks. In Proceedings of the Thirty-Fourth International Joint Conference on Articial Intelligence, IJCAI 2025, Montreal, Canada, August 16-22, 2025, pages 26012609. ijcai.org. ງԬ ਅະ, ߶ल , ాଜ ೭ (2021). Cdcl ܕ sat ιϧόʔͷ෦ಈ࡞ՄࢹԽπʔϧ. B3. 7 / 11 -
Reference IV Iwama, Kazuo and Miyazaki, Shuichi (1994). SAT-variable complexity
of hard combinatorial problems. In Proceedings of the IFIP 13th World Computer Congress, pages 253258. Katebi, Hadi, Sakallah, Karem A. , and Silva, João P. Marques (2011). Empirical study of the anatomy of modern sat solvers. In Proceedings of the 14th International Conference on Theory and Applications of Satisability Testing (SAT 2011), LNCS 6695, pages 343356. Luby, Michael, Sinclair, Alistair , and Zuckerman, David (1993). Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47(4):173180. 8 / 11 -
Reference V Marques-Silva, João P. and Sakallah, Karem A. (1999).
GRASP: A search algorithm for propositional satisability. IEEE Transactions on Computers, 48(5):506521. Moskewicz, Matthew W., Madigan, Conor F., Zhao, Ying, Zhang, Lintao , and Malik, Sharad (2001). Cha: Engineering an ecient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC 2001), pages 530535. Pipatsrisawat, Knot and Darwiche, Adnan (2007). A lightweight component caching scheme for satisability solvers. In Proceedings of the 10th International Conference on Theory and Applications of Satisability Testing (SAT 2007), LNCS 4501, pages 294299. 9 / 11 -
Reference VI Selman, Bart, Kautz, Henry , and Cohen, Bram
(1996). Local search strategies for satisability testing. In Johnson, David J. and Trick, Michael A., editors, Cliques, Coloring, and Satisability: the Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 521532. American Mathematical Society. Soh, Takehide, Banbara, Mutsunori , and Tamura, Naoyuki (2017). Proposal and evaluation of hybrid encoding of CSP to SAT integrating order and log encodings. International Journal on Articial Intelligence Tools, 26(1):129. 10 / 11 -
Reference VII Tamura, Naoyuki, Taga, Akiko, Kitagawa, Satoshi , and
Banbara, Mutsunori (2009). Compiling nite linear CSP into SAT. Constraints, 14(2):254272. Walsh, Toby (2000). SAT v CSP. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP 2000), pages 441456. 11 / 11