mini tutorial on conflict driven clause learning solvers
play

Mini-tutorial on conflict-driven clause learning solvers Marijn J. - PowerPoint PPT Presentation

Feb 27, 2024 •517 likes •1.13k views

Mini-tutorial on conflict-driven clause learning solvers Marijn J. H. Heule The University of Texas at Austin 20/01/2014 @ BIRS Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 1 / 24 The Satisfiability (SAT) problem

  1. Mini-tutorial on conflict-driven clause learning solvers Marijn J. H. Heule The University of Texas at Austin 20/01/2014 @ BIRS Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 1 / 24

  2. The Satisfiability (SAT) problem ( x 5 ∨ x 8 ∨ ¯ x 2 ) ∧ ( x 2 ∨ ¯ x 1 ∨ ¯ x 3 ) ∧ (¯ x 8 ∨ ¯ x 3 ∨ ¯ x 7 ) ∧ (¯ x 5 ∨ x 3 ∨ x 8 ) ∧ x 6 ∨ ¯ x 1 ∨ ¯ x 5 ) ∧ ( x 8 ∨ ¯ x 9 ∨ x 3 ) ∧ ( x 2 ∨ x 1 ∨ x 3 ) ∧ (¯ x 1 ∨ x 8 ∨ x 4 ) ∧ (¯ x 9 ∨ ¯ x 6 ∨ x 8 ) ∧ ( x 8 ∨ x 3 ∨ ¯ x 9 ) ∧ ( x 9 ∨ ¯ x 3 ∨ x 8 ) ∧ ( x 6 ∨ ¯ x 9 ∨ x 5 ) ∧ (¯ ( x 2 ∨ ¯ x 3 ∨ ¯ x 8 ) ∧ ( x 8 ∨ ¯ x 6 ∨ ¯ x 3 ) ∧ ( x 8 ∨ ¯ x 3 ∨ ¯ x 1 ) ∧ (¯ x 8 ∨ x 6 ∨ ¯ x 2 ) ∧ ( x 7 ∨ x 9 ∨ ¯ x 2 ) ∧ ( x 8 ∨ ¯ x 9 ∨ x 2 ) ∧ (¯ x 1 ∨ ¯ x 9 ∨ x 4 ) ∧ ( x 8 ∨ x 1 ∨ ¯ x 2 ) ∧ ( x 3 ∨ ¯ x 4 ∨ ¯ x 6 ) ∧ (¯ x 1 ∨ ¯ x 7 ∨ x 5 ) ∧ (¯ x 7 ∨ x 1 ∨ x 6 ) ∧ (¯ x 5 ∨ x 4 ∨ ¯ x 6 ) ∧ (¯ x 4 ∨ x 9 ∨ ¯ x 8 ) ∧ ( x 2 ∨ x 9 ∨ x 1 ) ∧ ( x 5 ∨ ¯ x 7 ∨ x 1 ) ∧ (¯ x 7 ∨ ¯ x 9 ∨ ¯ x 6 ) ∧ ( x 2 ∨ x 5 ∨ x 4 ) ∧ ( x 8 ∨ ¯ x 4 ∨ x 5 ) ∧ ( x 5 ∨ x 9 ∨ x 3 ) ∧ (¯ x 5 ∨ ¯ x 7 ∨ x 9 ) ∧ ( x 2 ∨ ¯ x 8 ∨ x 1 ) ∧ (¯ x 7 ∨ x 1 ∨ x 5 ) ∧ ( x 1 ∨ x 4 ∨ x 3 ) ∧ ( x 1 ∨ ¯ x 9 ∨ ¯ x 4 ) ∧ ( x 3 ∨ x 5 ∨ x 6 ) ∧ (¯ x 6 ∨ x 3 ∨ ¯ x 9 ) ∧ (¯ x 7 ∨ x 5 ∨ x 9 ) ∧ ( x 7 ∨ ¯ x 5 ∨ ¯ x 2 ) ∧ ( x 4 ∨ x 7 ∨ x 3 ) ∧ ( x 4 ∨ ¯ x 9 ∨ ¯ x 7 ) ∧ ( x 5 ∨ ¯ x 1 ∨ x 7 ) ∧ ( x 5 ∨ ¯ x 1 ∨ x 7 ) ∧ ( x 6 ∨ x 7 ∨ ¯ x 3 ) ∧ (¯ x 8 ∨ ¯ x 6 ∨ ¯ x 7 ) ∧ ( x 6 ∨ x 2 ∨ x 3 ) ∧ (¯ x 8 ∨ x 2 ∨ x 5 ) Does there exist an assignment satisfying all clauses? Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 2 / 24

  3. Search for a satisfying assignment (or proof none exists) ( x 5 ∨ x 8 ∨ ¯ x 2 ) ∧ ( x 2 ∨ ¯ x 1 ∨ ¯ x 3 ) ∧ (¯ x 8 ∨ ¯ x 3 ∨ ¯ x 7 ) ∧ (¯ x 5 ∨ x 3 ∨ x 8 ) ∧ (¯ x 6 ∨ ¯ x 1 ∨ ¯ x 5 ) ∧ ( x 8 ∨ ¯ x 9 ∨ x 3 ) ∧ ( x 2 ∨ x 1 ∨ x 3 ) ∧ (¯ x 1 ∨ x 8 ∨ x 4 ) ∧ (¯ x 9 ∨ ¯ x 6 ∨ x 8 ) ∧ ( x 8 ∨ x 3 ∨ ¯ x 9 ) ∧ ( x 9 ∨ ¯ x 3 ∨ x 8 ) ∧ ( x 6 ∨ ¯ x 9 ∨ x 5 ) ∧ ( x 2 ∨ ¯ x 3 ∨ ¯ x 8 ) ∧ ( x 8 ∨ ¯ x 6 ∨ ¯ x 3 ) ∧ ( x 8 ∨ ¯ x 3 ∨ ¯ x 1 ) ∧ (¯ x 8 ∨ x 6 ∨ ¯ x 2 ) ∧ ( x 7 ∨ x 9 ∨ ¯ x 2 ) ∧ ( x 8 ∨ ¯ x 9 ∨ x 2 ) ∧ (¯ x 1 ∨ ¯ x 9 ∨ x 4 ) ∧ ( x 8 ∨ x 1 ∨ ¯ x 2 ) ∧ ( x 3 ∨ ¯ x 4 ∨ ¯ x 6 ) ∧ (¯ x 1 ∨ ¯ x 7 ∨ x 5 ) ∧ (¯ x 7 ∨ x 1 ∨ x 6 ) ∧ (¯ x 5 ∨ x 4 ∨ ¯ x 6 ) ∧ (¯ x 4 ∨ x 9 ∨ ¯ x 8 ) ∧ ( x 2 ∨ x 9 ∨ x 1 ) ∧ ( x 5 ∨ ¯ x 7 ∨ x 1 ) ∧ (¯ x 7 ∨ ¯ x 9 ∨ ¯ x 6 ) ∧ ( x 2 ∨ x 5 ∨ x 4 ) ∧ ( x 8 ∨ ¯ x 4 ∨ x 5 ) ∧ ( x 5 ∨ x 9 ∨ x 3 ) ∧ (¯ x 5 ∨ ¯ x 7 ∨ x 9 ) ∧ ( x 2 ∨ ¯ x 8 ∨ x 1 ) ∧ (¯ x 7 ∨ x 1 ∨ x 5 ) ∧ ( x 1 ∨ x 4 ∨ x 3 ) ∧ ( x 1 ∨ ¯ x 9 ∨ ¯ x 4 ) ∧ ( x 3 ∨ x 5 ∨ x 6 ) ∧ (¯ x 6 ∨ x 3 ∨ ¯ x 9 ) ∧ (¯ x 7 ∨ x 5 ∨ x 9 ) ∧ ( x 7 ∨ ¯ x 5 ∨ ¯ x 2 ) ∧ ( x 4 ∨ x 7 ∨ x 3 ) ∧ ( x 4 ∨ ¯ x 9 ∨ ¯ x 7 ) ∧ ( x 5 ∨ ¯ x 1 ∨ x 7 ) ∧ ( x 5 ∨ ¯ x 1 ∨ x 7 ) ∧ ( x 6 ∨ x 7 ∨ ¯ x 3 ) ∧ (¯ x 8 ∨ ¯ x 6 ∨ ¯ x 7 ) ∧ ( x 6 ∨ x 2 ∨ x 3 ) ∧ (¯ x 8 ∨ x 2 ∨ x 5 ) Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 3 / 24

  4. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ F extra Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  5. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  6. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  7. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 6 Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  8. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 6 x 1 = 0 7 Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  9. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 6 x 1 = 0 x 4 = 1 7 Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  10. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 6 x 1 = 0 x 4 = 1 x 3 = 1 x 3 = 0 7 Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  11. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 x 3 = 1 1 7 x 5 = 1 6 x 1 = 0 7 7 x 4 = 1 x 1 = 0 x 4 = 1 x 3 = 1 7 x 3 = 0 2 x 3 = 0 7 x 2 = 1 Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  12. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 x 3 = 1 1 7 x 5 = 1 6 x 1 = 0 7 7 x 4 = 1 x 1 = 0 x 4 = 1 x 3 = 1 7 x 3 = 0 2 x 3 = 0 7 x 2 = 1 (¯ x 2 ∨ ¯ x 4 ∨ ¯ x 5 ) Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  13. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 x 3 = 1 1 7 x 5 = 1 6 x 1 = 0 7 7 x 4 = 1 x 1 = 0 x 4 = 1 x 3 = 1 7 x 3 = 0 2 x 3 = 0 7 x 2 = 1 (¯ x 2 ∨ ¯ x 4 ∨ ¯ x 5 ) Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  14. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 2 x 4 = 0 x 3 = 1 1 x 1 = 1 7 x 5 = 1 6 x 1 = 0 7 7 x 4 = 1 x 1 = 0 x 4 = 1 x 3 = 1 7 x 3 = 0 2 x 3 = 0 7 x 2 = 1 (¯ x 2 ∨ ¯ x 4 ∨ ¯ x 5 ) Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  15. Conflict-driven SAT solvers: Search and Analysis ( x 1 ∨ x 4 ) ∧ 0 ( x 3 ∨ ¯ x 4 ∨ ¯ x 5 ) ∧ x 5 = 1 (¯ x 3 ∨ ¯ x 2 ∨ ¯ x 4 ) ∧ 1 F extra x 2 = 1 2 2 x 4 = 0 x 3 = 1 1 x 1 = 1 7 x 5 = 1 6 x 1 = 0 7 7 x 4 = 1 x 1 = 0 x 4 = 1 x 3 = 1 7 x 3 = 0 2 x 3 = 0 7 x 2 = 1 (¯ x 2 ∨ ¯ x 4 ∨ ¯ x 5 ) Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 4 / 24

  16. Conflict-driven SAT solvers: Pseudo-code 1: while TRUE do l decision := GetDecisionLiteral ( ) 2: If no l decision then return satisfiable 3: F := Simplify ( F ( l decision ← 1) ) 4: while F contains C falsified do 5: C conflict := AnalyzeConflict ( C falsified ) 6: If C conflict = ∅ then return unsatisfiable 7: BackTrack ( C conflict ) 8: F := Simplify ( F ∪ { C conflict } ) 9: end while 10: 11: end while Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 5 / 24

  17. Learning conflict clauses [Marques-SilvaSakallah’96] 1 5 x 4 =1 x 8 =1 x 17 =0 4 3 x 12 =0 7 x 6 =0 x 1 =1 7 7 x 18 =1 7 7 7 7 x 11 =1 x 2 =0 x 10 =0 x 3 =1 7 7 x 7 =1 7 x 18 =0 x 5 =0 6 x 13 =0 2 x 19 =1 Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 6 / 24

  18. Learning conflict clauses [Marques-SilvaSakallah’96] 1 5 x 4 =1 x 8 =1 x 17 =0 4 3 x 12 =0 7 x 6 =0 x 1 =1 7 7 x 18 =1 7 7 7 7 x 11 =1 x 2 =0 x 10 =0 x 3 =1 7 7 x 7 =1 7 x 18 =0 x 5 =0 6 x 13 =0 2 ( ¬ x 1 ∨ ¬ x 3 ∨ x 5 ∨ x 17 ∨ ¬ x 19 ) x 19 =1 tri-asserting clause Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 6 / 24

  19. Learning conflict clauses [Marques-SilvaSakallah’96] 1 5 x 4 =1 x 8 =1 x 17 =0 4 3 x 12 =0 7 x 6 =0 x 1 =1 7 7 x 18 =1 7 7 7 7 x 11 =1 x 2 =0 x 10 =0 x 3 =1 7 7 x 7 =1 7 x 18 =0 x 5 =0 6 x 13 =0 2 ( x 10 ∨ ¬ x 8 ∨ x 17 ∨ ¬ x 19 ) x 19 =1 first unique implication point Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 6 / 24

  20. Learning conflict clauses [Marques-SilvaSakallah’96] 1 5 x 4 =1 x 8 =1 x 17 =0 4 3 x 12 =0 7 x 6 =0 x 1 =1 7 7 x 18 =1 7 7 7 7 x 11 =1 x 2 =0 x 10 =0 x 3 =1 7 7 x 7 =1 7 x 18 =0 x 5 =0 6 x 13 =0 2 ( x 2 ∨ ¬ x 4 ∨ ¬ x 8 ∨ x 17 ∨ ¬ x 19 ) x 19 =1 second unique implication point Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 6 / 24

  21. Average Learned Clause Length Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 7 / 24

  22. Data-structures Data-structures Watch pointers Marijn J. H. Heule (UT) Mini-tutorial on CDCL solvers BIRS, January 2014 8 / 24

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Conflict-Driven Clause Learning Marijn J.H. Heule http://www.cs.cmu.edu/~mheule/15816-f19/

Conflict-Driven Clause Learning Marijn J.H. Heule http://www.cs.cmu.edu/~mheule/15816-f19/

Conflict-Driven Clause Learning Marijn J.H. Heule http://www.cs.cmu.edu/~mheule/15816-f19/ Automated Reasoning and Satisfiability, September 16, 2019 1/33 The Satisfiability (SAT) problem ( x 5 x 8 x 2 ) ( x 2 x 1 x

881 views • 74 slides
Conflict-Driven Clause Learning Current Trends in AI Bart Bogaerts March 13, 2020 1 THANKS

Conflict-Driven Clause Learning Current Trends in AI Bart Bogaerts March 13, 2020 1 THANKS

Conflict-Driven Clause Learning Current Trends in AI Bart Bogaerts March 13, 2020 1 THANKS Many slides provided by Joao Marques Silva Material of a SAT/SMT summer school http: //satsmt2013.ics.aalto.fi/slides/Marques-Silva.pdf

1.07k views • 106 slides
Conflict-Driven Clause Learning Armin Biere SAT/SMT/AR Summer School 2019 Lisbon, Portugal July

Conflict-Driven Clause Learning Armin Biere SAT/SMT/AR Summer School 2019 Lisbon, Portugal July

Conflict-Driven Clause Learning Armin Biere SAT/SMT/AR Summer School 2019 Lisbon, Portugal July 4, 2019 Dress Code Summer School Speaker as SAT Problem propositional logic: variables tie shirt negation (not) disjunction (or)

1.09k views • 82 slides
Proofs in Conflict-Driven Theory Combination Maria Paola Bonacina, Stphane Graham-Lengrand, and

Proofs in Conflict-Driven Theory Combination Maria Paola Bonacina, Stphane Graham-Lengrand, and

Proofs in Conflict-Driven Theory Combination Maria Paola Bonacina, Stphane Graham-Lengrand, and Natarajan Shankar CPP2018, 9th January 2018 1/30 Context: Satisfiability Modulo Theories (SMT) CDCL (Conflict-Driven Clause Learning)

1.57k views • 122 slides
Introduction Clause exchange in parallel solvers Lazy clause exchange Experiments

Introduction Clause exchange in parallel solvers Lazy clause exchange Experiments

Introduction Clause exchange in parallel solvers Lazy clause exchange Experiments Conclusion . . . . . . . . . . . . . . Lazy clause exchange policy for parallel SAT solvers Gilles Audemard CRIL, Lens, France Laurent

980 views • 24 slides
Clause Size Reduction with all-UIP Learning Nick Feng and Fahiem Bacchus University of Toronto

Clause Size Reduction with all-UIP Learning Nick Feng and Fahiem Bacchus University of Toronto

Clause Size Reduction with all-UIP Learning Nick Feng and Fahiem Bacchus University of Toronto Introduction Clause Learning Clause Learning is an essential technique in SAT solvers (1996) u Clause Learning Clause Learning is an essential

663 views • 51 slides
? Results of CASC (2016) Very Sketchy Anatomy of Winning ATPs First/Higher-Order Theorem

? Results of CASC (2016) Very Sketchy Anatomy of Winning ATPs First/Higher-Order Theorem

Proof Search in Conflict Resolution Lifting CDCL (Conflict-Driven Clause Learning) to First-Order Logic Bruno Woltzenlogel Paleo joint work with: Daniyar Itegulov (ITMO, St. Petersburg, Russia) Ezequiel Postan (National University

911 views • 46 slides
Conflict Directed Clause Learning for the Maximum Weighted Clique Problem Emmanuel Hebrard 1 and

Conflict Directed Clause Learning for the Maximum Weighted Clique Problem Emmanuel Hebrard 1 and

Conflict Directed Clause Learning for the Maximum Weighted Clique Problem Emmanuel Hebrard 1 and George Katsirelos 2 1 LAAS-CNRS, Universit 2 MIAT, INRA e de Toulouse The Maximum Weight Clique Problem 5 b d 9 Given a graph G with weight

915 views • 76 slides
Tutorial on SAT Solvers Combinatorial Problem Solving (CPS) Enric Rodr guez-Carbonell May

Tutorial on SAT Solvers Combinatorial Problem Solving (CPS) Enric Rodr guez-Carbonell May

Tutorial on SAT Solvers Combinatorial Problem Solving (CPS) Enric Rodr guez-Carbonell May 26, 2020 SAT Solvers SAT solvers take as input a CNF formula F and return: sat (+ model): if F is satisfiable unsat : if F is unsatisfiable

273 views • 5 slides
Tutorial on SMT Solvers Combinatorial Problem Solving (CPS) Enric Rodr guez-Carbonell April

Tutorial on SMT Solvers Combinatorial Problem Solving (CPS) Enric Rodr guez-Carbonell April

Tutorial on SMT Solvers Combinatorial Problem Solving (CPS) Enric Rodr guez-Carbonell April 23, 2019 SMT Solvers SMT solvers take as input a (quantifier-free) first-order logic formula F over a background theory T , and return: sat (+

207 views • 10 slides
X Schedule 4 Transactional Charges Clause 9 Clause 10 2 RWE npower

X Schedule 4 Transactional Charges Clause 9 Clause 10 2 RWE npower

RWE npower DUoSA Consolidation Group Payment Terms Sub-group 28 th July 2005 General Framework Existing Proposed Clause 6 Charges Clause 6 Clause 7 Billing & Payments Clause 7 Clause 8 Site

389 views • 4 slides
Equilibrium and Balayage A mini-tutorial A. Martnez-Finkelshtein (U. Almera) Optimal

Equilibrium and Balayage A mini-tutorial A. Martnez-Finkelshtein (U. Almera) Optimal

Equilibrium and Balayage A mini-tutorial A. Martnez-Finkelshtein (U. Almera) Optimal point configurations and orthogonal polynomials CIEM Castro Urdiales April 19, 2017 Equilibrium and Balayage A mini-tutorial A.

553 views • 34 slides
Motivation: conflict-driven reasoning from PL to FOL SGGS: model representation and FO clausal

Motivation: conflict-driven reasoning from PL to FOL SGGS: model representation and FO clausal

Outline Motivation: conflict-driven reasoning from PL to FOL SGGS: model representation and FO clausal propagation SGGS inferences: instance generation and conflict solving Discussion SGGS: conflict-driven first-order reasoning 1 Maria Paola

582 views • 42 slides
CDSAT: Conflict-Driven SATisfiability modulo theories and assignments 1 Maria Paola Bonacina

CDSAT: Conflict-Driven SATisfiability modulo theories and assignments 1 Maria Paola Bonacina

The conflict-driven reasoning paradigm Conflict-driven reasoning in theory combination The CDSAT transition system Discussion CDSAT: Conflict-Driven SATisfiability modulo theories and assignments 1 Maria Paola Bonacina Dipartimento di

610 views • 45 slides
Conflict-driven Reasoning Conflict-Driven SATisfiability 2 CDCL : propositional conflict-driven

Conflict-driven Reasoning Conflict-Driven SATisfiability 2 CDCL : propositional conflict-driven

The Eos SMT/SMA-Solver: A Preliminary Report 1 Giulio Mazzi Universit` a Degli Studi di Verona Lisbon, 7th July 2019 1 Joint work with Maria Paola Bonacina G. Mazzi (Universit` a di Verona) Eos SMT/SMA-solver Lisbon, 7th July 2019 1 / 31

430 views • 31 slides
Conflict Driven Learning and Non-chronological Backtracking x1 + x4 x1 + x3 + x8 x1 + x8

Conflict Driven Learning and Non-chronological Backtracking x1 + x4 x1 + x3 + x8 x1 + x8

Conflict Driven Learning and Non-chronological Backtracking x1 + x4 x1 + x3 + x8 x1 + x8 + x12 x2 + x11 x7 + x3 + x9 x7 + x8 + x9 x7 + x8 + x10 x7 + x10 + x12 Conflict Driven Learning and Non-chronological

607 views • 29 slides
Conflict Resolution with Power and Privilege in Mind August 31st & September 2nd, 2020 Kad

Conflict Resolution with Power and Privilege in Mind August 31st & September 2nd, 2020 Kad

Conflict Resolution with Power and Privilege in Mind August 31st & September 2nd, 2020 Kad Smith, Liz Derias-Tyehimba, and Learkana Chong Our Team / About CompassPoint Full screen, or minimize Zoom screen Gallery View Option

1.07k views • 39 slides
PRODUCTIVE CONFLICT RESOLUTION Leadership on Demand AGENDA Overview Style Assessment

PRODUCTIVE CONFLICT RESOLUTION Leadership on Demand AGENDA Overview Style Assessment

PRODUCTIVE CONFLICT RESOLUTION Leadership on Demand AGENDA Overview Style Assessment Case Study Conflict Resolution Tips WHAT IS CONFLICT? Conflict : A disagreement between two or more parties Causes: Incompatible

466 views • 12 slides
Introduction A pessimist sees difficulty in every opportunity; an optimist sees the

Introduction A pessimist sees difficulty in every opportunity; an optimist sees the

3/2/2018 Conflict Resolution Difficult Patients Difficult Employees Section I Introduction A pessimist sees difficulty in every opportunity; an optimist sees the opportunity in every difficulty. - Sir Winston Churchill 2 Conflict

407 views • 9 slides
Exascale Science Rick Stevens Argonne National Laboratory University of Chicago Outline

Exascale Science Rick Stevens Argonne National Laboratory University of Chicago Outline

Getting Ready for Exascale Science Rick Stevens Argonne National Laboratory University of Chicago Outline What we are doing at ANL BG/P and DOEs Incite Program for allocating resources Potential paths to Exascale Systems How

960 views • 65 slides
Conflict of Interest Codes Webinar for State Agencies Presented By Fair Political Practices

Conflict of Interest Codes Webinar for State Agencies Presented By Fair Political Practices

Conflict of Interest Codes Webinar for State Agencies Presented By Fair Political Practices Commission Legal Division advice@fppc.ca.gov 1-866-275-3772 (ASK FPPC) 1 The visual aids used in FPPC presentations are guides which contain only

447 views • 25 slides
Todays Teens will rule the world! In 25 years they will be making decisions that affect YOU!

Todays Teens will rule the world! In 25 years they will be making decisions that affect YOU!

Todays Teens will rule the world! In 25 years they will be making decisions that affect YOU! To Download Slides: Miomo.com/grammar My passion is to prepare young people to be Competitive with Good Character to lead independent &

1.27k views • 59 slides
Plan for Today SLR (Simple LR) Problem with LR(0) SLR modification, follow sets strike

Plan for Today SLR (Simple LR) Problem with LR(0) SLR modification, follow sets strike

Plan for Today SLR (Simple LR) Problem with LR(0) SLR modification, follow sets strike again Building the LR Parsing Table for LR(1) First and Follow sets building the table Debugging shift/reduce and reduce/reduce errors LR

261 views • 9 slides
Tractable Policy Management Framework DAIS ITA for IoT Geeth de Mel, IBM United Kingdom Ltd.,

Tractable Policy Management Framework DAIS ITA for IoT Geeth de Mel, IBM United Kingdom Ltd.,

Tractable Policy Management Framework DAIS ITA for IoT Geeth de Mel, IBM United Kingdom Ltd., UK Distributed Analytics Emre Goynugur, Murat Sensoy, Ozyegin University, Turkey and Information Seraphin Calo, IBM Thomas J. Watson Research

270 views • 14 slides

More recommend