answer set solving in practice
play

Answer Set Solving in Practice Torsten Schaub University of Potsdam - PowerPoint PPT Presentation

May 13, 2023 •30 likes •1.98k views

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de Potassco Slide Packages are licensed under a Creative Commons Attribution 3.0 Unported License. Torsten Schaub (KRR@UP) Answer Set Solving in

  1. clasp Parallel solving Parallel CDCL-style solving in clasp while work available while no (result) message to send communicate // exchange information with other solver propagate // deterministically assign literals if no conflict then if all variables assigned then send solution else decide // non-deterministically assign some literal else if root-level conflict then send unsatisfiable else if external conflict then send unsatisfiable else analyze // analyze conflict and add conflict constraint backjump // unassign literals until conflict constraint is unit communicate // exchange results (and receive work) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 378 / 463

  2. clasp Parallel solving Parallel CDCL-style solving in clasp while work available while no (result) message to send communicate // exchange information with other solver propagate // deterministically assign literals if no conflict then if all variables assigned then send solution else decide // non-deterministically assign some literal else if root-level conflict then send unsatisfiable else if external conflict then send unsatisfiable else analyze // analyze conflict and add conflict constraint backjump // unassign literals until conflict constraint is unit communicate // exchange results (and receive work) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 378 / 463

  3. clasp Parallel solving Parallel CDCL-style solving in clasp while work available while no (result) message to send communicate // exchange information with other solver propagate // deterministically assign literals if no conflict then if all variables assigned then send solution else decide // non-deterministically assign some literal else if root-level conflict then send unsatisfiable else if external conflict then send unsatisfiable else analyze // analyze conflict and add conflict constraint backjump // unassign literals until conflict constraint is unit communicate // exchange results (and receive work) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 378 / 463

  4. clasp Parallel solving Parallel CDCL-style solving in clasp while work available while no (result) message to send communicate // exchange information with other solver propagate // deterministically assign literals if no conflict then if all variables assigned then send solution else decide // non-deterministically assign some literal else if root-level conflict then send unsatisfiable else if external conflict then send unsatisfiable else analyze // analyze conflict and add conflict constraint backjump // unassign literals until conflict constraint is unit communicate // exchange results (and receive work) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 378 / 463

  5. clasp Parallel solving Parallel CDCL-style solving in clasp while work available while no (result) message to send communicate // exchange information with other solver propagate // deterministically assign literals if no conflict then if all variables assigned then send solution else decide // non-deterministically assign some literal else if root-level conflict then send unsatisfiable else if external conflict then send unsatisfiable else analyze // analyze conflict and add conflict constraint backjump // unassign literals until conflict constraint is unit communicate // exchange results (and receive work) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 378 / 463

  6. clasp Parallel solving Multi-threaded architecture of clasp Coordination SharedContext ParallelContext Preprocessing Threads S 1 S 2 . . . S n Propositional Enumerator Enumerator Program Program Variables T W . . . S Counter Builder Builder P 1 P 2 . . .P n Atoms Bodies Queue Static Nogoods Preprocessor Preprocessor Preprocessor Preprocessor Shared Nogoods Nogood Nogood Implication Graph Distributor Distributor Logic Solver 1. . . n Conflict Conflict Program Recorded Nogoods Resolution Resolution Decision Decision Propagation Heuristic Heuristic Post Post Unit Unit Post Post Assignment Propagation Propagation Propagation Propagation Propagation Propagation Atoms/Bodies Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 379 / 463

  7. clasp Parallel solving Multi-threaded architecture of clasp Coordination SharedContext ParallelContext Preprocessing Threads S 1 S 2 . . . S n Propositional Enumerator Enumerator Program Program Variables T W . . . S Counter Builder Builder P 1 P 2 . . .P n Atoms Bodies Queue Static Nogoods Preprocessor Preprocessor Preprocessor Preprocessor Shared Nogoods Nogood Nogood Implication Graph Distributor Distributor Logic Solver 1. . . n Conflict Conflict Program Recorded Nogoods Resolution Resolution Decision Decision Propagation Heuristic Heuristic Post Post Unit Unit Post Post Assignment Propagation Propagation Propagation Propagation Propagation Propagation Atoms/Bodies Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 379 / 463

  8. clasp Parallel solving Multi-threaded architecture of clasp Coordination SharedContext ParallelContext Preprocessing Threads S 1 S 2 . . . S n Propositional Enumerator Enumerator Program Program Variables T W . . . S Counter Builder Builder P 1 P 2 . . .P n Atoms Bodies Queue Static Nogoods Preprocessor Preprocessor Preprocessor Preprocessor Shared Nogoods Nogood Nogood Implication Graph Distributor Distributor Logic Solver 1. . . n Conflict Conflict Program Recorded Nogoods Resolution Resolution Decision Decision Propagation Heuristic Heuristic Post Post Unit Unit Post Post Assignment Propagation Propagation Propagation Propagation Propagation Propagation Atoms/Bodies Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 379 / 463

  9. clasp Parallel solving Multi-threaded architecture of clasp Coordination SharedContext ParallelContext Preprocessing Threads S 1 S 2 . . . S n Propositional Enumerator Enumerator Program Program Variables T W . . . S Counter Builder Builder P 1 P 2 . . .P n Atoms Bodies Queue Static Nogoods Preprocessor Preprocessor Preprocessor Preprocessor Shared Nogoods Nogood Nogood Implication Graph Distributor Distributor Logic Solver 1. . . n Conflict Conflict Program Recorded Nogoods Resolution Resolution Decision Decision Propagation Heuristic Heuristic Post Post Unit Unit Post Post Assignment Propagation Propagation Propagation Propagation Propagation Propagation Atoms/Bodies Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 379 / 463

  10. clasp Parallel solving clasp in context Compare clasp (2.0.5) to the multi-threaded SAT solvers cryptominisat (2.9.2) manysat (1.1) miraxt (2009) plingeling (587f) all run with four and eight threads in their default settings 160/300 benchmarks from crafted category at SAT’11 all solvable by ppfolio in 1000 seconds crafted SAT benchmarks are closest to ASP benchmarks Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 380 / 463

  11. clasp Parallel solving clasp in context clasp-t1 -t4 120 -t8 cryptominisat-2.9.2-t4 -t8 miraxt-2009-t4 -t8 plingeling-587-t4 100 -t8 manysat-1.1-t4 -t8 Solved instances 80 60 40 20 1 10 100 1000 Time in seconds Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 381 / 463

  12. clasp Configuration Outline 1 Potassco 2 gringo 3 clasp Features Parallel solving Configuration Disjunctive solving Domain heuristics 4 clingo 5 clingcon Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 382 / 463

  13. clasp Configuration Using clasp --help[=<n>],-h : Print {1=basic|2=more|3=full} help and exit --parallel-mode,-t <arg>: Run parallel search with given number of threads <arg>: <n {1..64}>[,<mode {compete|split}>] <n> : Number of threads to use in search <mode>: Run competition or splitting based search [compete] --configuration=<arg> : Configure default configuration [frumpy] <arg>: {frumpy|jumpy|handy|crafty|trendy|chatty} frumpy: Use conservative defaults jumpy : Use aggressive defaults handy : Use defaults geared towards large problems crafty: Use defaults geared towards crafted problems trendy: Use defaults geared towards industrial problems "-t 4": Use 4 competing threads initialized via the default portfolio --print-portfolio,-g : Print default portfolio and exit Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 383 / 463

  14. clasp Configuration Using clasp --help[=<n>],-h : Print {1=basic|2=more|3=full} help and exit --parallel-mode,-t <arg>: Run parallel search with given number of threads <arg>: <n {1..64}>[,<mode {compete|split}>] <n> : Number of threads to use in search <mode>: Run competition or splitting based search [compete] --configuration=<arg> : Configure default configuration [frumpy] <arg>: {frumpy|jumpy|handy|crafty|trendy|chatty} frumpy: Use conservative defaults jumpy : Use aggressive defaults handy : Use defaults geared towards large problems crafty: Use defaults geared towards crafted problems trendy: Use defaults geared towards industrial problems "-t 4": Use 4 competing threads initialized via the default portfolio --print-portfolio,-g : Print default portfolio and exit Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 383 / 463

  15. clasp Configuration Using clasp --help[=<n>],-h : Print {1=basic|2=more|3=full} help and exit --parallel-mode,-t <arg>: Run parallel search with given number of threads <arg>: <n {1..64}>[,<mode {compete|split}>] <n> : Number of threads to use in search <mode>: Run competition or splitting based search [compete] --configuration=<arg> : Configure default configuration [frumpy] <arg>: {frumpy|jumpy|handy|crafty|trendy|chatty} frumpy: Use conservative defaults jumpy : Use aggressive defaults handy : Use defaults geared towards large problems crafty: Use defaults geared towards crafted problems trendy: Use defaults geared towards industrial problems "-t 4": Use 4 competing threads initialized via the default portfolio --print-portfolio,-g : Print default portfolio and exit Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 383 / 463

  16. clasp Configuration Using clasp --help[=<n>],-h : Print {1=basic|2=more|3=full} help and exit --parallel-mode,-t <arg>: Run parallel search with given number of threads <arg>: <n {1..64}>[,<mode {compete|split}>] <n> : Number of threads to use in search <mode>: Run competition or splitting based search [compete] --configuration=<arg> : Configure default configuration [frumpy] <arg>: {frumpy|jumpy|handy|crafty|trendy|chatty} frumpy: Use conservative defaults jumpy : Use aggressive defaults handy : Use defaults geared towards large problems crafty: Use defaults geared towards crafted problems trendy: Use defaults geared towards industrial problems "-t 4": Use 4 competing threads initialized via the default portfolio --print-portfolio,-g : Print default portfolio and exit Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 383 / 463

  17. clasp Configuration Using clasp --help[=<n>],-h : Print {1=basic|2=more|3=full} help and exit --parallel-mode,-t <arg>: Run parallel search with given number of threads <arg>: <n {1..64}>[,<mode {compete|split}>] <n> : Number of threads to use in search <mode>: Run competition or splitting based search [compete] --configuration=<arg> : Configure default configuration [frumpy] <arg>: {frumpy|jumpy|handy|crafty|trendy|chatty} frumpy: Use conservative defaults jumpy : Use aggressive defaults handy : Use defaults geared towards large problems crafty: Use defaults geared towards crafted problems trendy: Use defaults geared towards industrial problems "-t 4": Use 4 competing threads initialized via the default portfolio --print-portfolio,-g : Print default portfolio and exit Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 383 / 463

  18. clasp Configuration Comparing configurations on queensA.lp n frumpy jumpy handy crafty trendy -t 4 50 0.063 0.023 3.416 0.030 1.805 0.061 100 20.364 0.099 7.891 0.136 7.321 0.121 150 60.000 0.212 14.522 0.271 19.883 0.347 200 60.000 0.415 15.026 0.667 32.476 0.753 500 60.000 3.199 60.000 7.471 60.000 6.104 (times in seconds, cut-off at 60 seconds) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 384 / 463

  19. clasp Configuration Comparing configurations on queensA.lp n frumpy jumpy handy crafty trendy -t 4 50 0.063 0.023 3.416 0.030 1.805 0.061 100 20.364 0.099 7.891 0.136 7.321 0.121 150 60.000 0.212 14.522 0.271 19.883 0.347 200 60.000 0.415 15.026 0.667 32.476 0.753 500 60.000 3.199 60.000 7.471 60.000 6.104 (times in seconds, cut-off at 60 seconds) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 384 / 463

  20. clasp Configuration Comparing configurations on queensA.lp n frumpy jumpy handy crafty trendy -t 4 50 0.063 0.023 3.416 0.030 1.805 0.061 100 20.364 0.099 7.891 0.136 7.321 0.121 150 60.000 0.212 14.522 0.271 19.883 0.347 200 60.000 0.415 15.026 0.667 32.476 0.753 500 60.000 3.199 60.000 7.471 60.000 6.104 (times in seconds, cut-off at 60 seconds) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 384 / 463

  21. clasp Configuration Comparing configurations on queensA.lp n frumpy jumpy handy crafty trendy -t 4 50 0.063 0.023 3.416 0.030 1.805 0.061 100 20.364 0.099 7.891 0.136 7.321 0.121 150 60.000 0.212 14.522 0.271 19.883 0.347 200 60.000 0.415 15.026 0.667 32.476 0.753 500 60.000 3.199 60.000 7.471 60.000 6.104 (times in seconds, cut-off at 60 seconds) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 384 / 463

  22. clasp Configuration Comparing configurations on queensA.lp n frumpy jumpy handy crafty trendy -t 4 50 0.063 0.023 3.416 0.030 1.805 0.061 100 20.364 0.099 7.891 0.136 7.321 0.121 150 60.000 0.212 14.522 0.271 19.883 0.347 200 60.000 0.415 15.026 0.667 32.476 0.753 500 60.000 3.199 60.000 7.471 60.000 6.104 (times in seconds, cut-off at 60 seconds) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 384 / 463

  23. clasp Configuration clasp ’s default portfolio for parallel solving via clasp --print-portfolio [solver.0]: --heuristic=Vsids,92 --restarts=L,60 --deletion=basic,50,0 --del-max=2000000 --del-estimate=1 --del-cfl=+,2000, [solver.1]: --heuristic=Vsids --restarts=D,100,0.7 --deletion=basic,50,0 --del-init=3.0,500,19500 --del-grow=1.1,20. [solver.2]: --heuristic=Berkmin --restarts=x,100,1.5 --deletion=basic,75 --del-init=3.0,200,40000 --del-max=400000 [solver.3]: --restarts=x,128,1.5 --deletion=basic,75,0 --del-init=10.0,1000,9000 --del-grow=1.1,20.0 --del-cfl=+,100 [solver.4]: --heuristic=Vsids --restarts=L,100 --deletion=basic,75,2 --del-init=3.0,1000,20000 --del-grow=1.1,25,x,1 [solver.5]: --heuristic=Vsids --restarts=D,100,0.7 --deletion=sort,50,2 --del-max=200000 --del-init=20.0,1000,14000 [solver.6]: --heuristic=Berkmin,512 --restarts=x,100,1.5 --deletion=basic,75 --del-init=3.0,200,40000 --del-max=4000 [solver.7]: --heuristic=Vsids --reverse-arcs=1 --otfs=1 --local-restarts --save-progress=0 --contraction=250 --counter-restart=7 [solver.8]: --heuristic=Vsids --restarts=L,256 --counter-restart=3 --strengthen=recursive --update-lbd --del-glue=2 [solver.9]: --heuristic=Berkmin,512 --restarts=F,16000 --lookahead=atom,50 [solver.10]: --heuristic=Vmtf --strengthen=no --contr=0 --restarts=x,100,1.3 --del-init=3.0,800,9200 [solver.11]: --heuristic=Vsids --strengthen=recursive --restarts=x,100,1.5,15 --contraction=0 [solver.12]: --heuristic=Vsids --restarts=L,128 --save-p --otfs=1 --init-w=2 --contr=0 --opt-heu=3 [solver.13]: --heuristic=Berkmin,512 --restarts=x,100,1.5,6 --local-restarts --init-w=2 --contr=0 [solver.14]: --no-lookback --heuristic=Unit --lookahead=atom --deletion=no --restarts=no clasp ’s portfolio is fully customizable configurations are assigned in a round-robin fashion to threads during parallel solving -t 4 uses four threads with crafty , trendy , frumpy , and jumpy Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 385 / 463

  24. clasp Configuration clasp ’s default portfolio for parallel solving via clasp --print-portfolio [solver.0]: --heuristic=Vsids,92 --restarts=L,60 --deletion=basic,50,0 --del-max=2000000 --del-estimate=1 --del-cfl=+,2000, [solver.1]: --heuristic=Vsids --restarts=D,100,0.7 --deletion=basic,50,0 --del-init=3.0,500,19500 --del-grow=1.1,20. [solver.2]: --heuristic=Berkmin --restarts=x,100,1.5 --deletion=basic,75 --del-init=3.0,200,40000 --del-max=400000 [solver.3]: --restarts=x,128,1.5 --deletion=basic,75,0 --del-init=10.0,1000,9000 --del-grow=1.1,20.0 --del-cfl=+,100 [solver.4]: --heuristic=Vsids --restarts=L,100 --deletion=basic,75,2 --del-init=3.0,1000,20000 --del-grow=1.1,25,x,1 [solver.5]: --heuristic=Vsids --restarts=D,100,0.7 --deletion=sort,50,2 --del-max=200000 --del-init=20.0,1000,14000 [solver.6]: --heuristic=Berkmin,512 --restarts=x,100,1.5 --deletion=basic,75 --del-init=3.0,200,40000 --del-max=4000 [solver.7]: --heuristic=Vsids --reverse-arcs=1 --otfs=1 --local-restarts --save-progress=0 --contraction=250 --counter-restart=7 [solver.8]: --heuristic=Vsids --restarts=L,256 --counter-restart=3 --strengthen=recursive --update-lbd --del-glue=2 [solver.9]: --heuristic=Berkmin,512 --restarts=F,16000 --lookahead=atom,50 [solver.10]: --heuristic=Vmtf --strengthen=no --contr=0 --restarts=x,100,1.3 --del-init=3.0,800,9200 [solver.11]: --heuristic=Vsids --strengthen=recursive --restarts=x,100,1.5,15 --contraction=0 [solver.12]: --heuristic=Vsids --restarts=L,128 --save-p --otfs=1 --init-w=2 --contr=0 --opt-heu=3 [solver.13]: --heuristic=Berkmin,512 --restarts=x,100,1.5,6 --local-restarts --init-w=2 --contr=0 [solver.14]: --no-lookback --heuristic=Unit --lookahead=atom --deletion=no --restarts=no clasp ’s portfolio is fully customizable configurations are assigned in a round-robin fashion to threads during parallel solving -t 4 uses four threads with crafty , trendy , frumpy , and jumpy Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 385 / 463

  25. clasp Configuration clasp ’s default portfolio for parallel solving via clasp --print-portfolio [solver.0]: --heuristic=Vsids,92 --restarts=L,60 --deletion=basic,50,0 --del-max=2000000 --del-estimate=1 --del-cfl=+,2000, [solver.1]: --heuristic=Vsids --restarts=D,100,0.7 --deletion=basic,50,0 --del-init=3.0,500,19500 --del-grow=1.1,20. [solver.2]: --heuristic=Berkmin --restarts=x,100,1.5 --deletion=basic,75 --del-init=3.0,200,40000 --del-max=400000 [solver.3]: --restarts=x,128,1.5 --deletion=basic,75,0 --del-init=10.0,1000,9000 --del-grow=1.1,20.0 --del-cfl=+,100 [solver.4]: --heuristic=Vsids --restarts=L,100 --deletion=basic,75,2 --del-init=3.0,1000,20000 --del-grow=1.1,25,x,1 [solver.5]: --heuristic=Vsids --restarts=D,100,0.7 --deletion=sort,50,2 --del-max=200000 --del-init=20.0,1000,14000 [solver.6]: --heuristic=Berkmin,512 --restarts=x,100,1.5 --deletion=basic,75 --del-init=3.0,200,40000 --del-max=4000 [solver.7]: --heuristic=Vsids --reverse-arcs=1 --otfs=1 --local-restarts --save-progress=0 --contraction=250 --counter-restart=7 [solver.8]: --heuristic=Vsids --restarts=L,256 --counter-restart=3 --strengthen=recursive --update-lbd --del-glue=2 [solver.9]: --heuristic=Berkmin,512 --restarts=F,16000 --lookahead=atom,50 [solver.10]: --heuristic=Vmtf --strengthen=no --contr=0 --restarts=x,100,1.3 --del-init=3.0,800,9200 [solver.11]: --heuristic=Vsids --strengthen=recursive --restarts=x,100,1.5,15 --contraction=0 [solver.12]: --heuristic=Vsids --restarts=L,128 --save-p --otfs=1 --init-w=2 --contr=0 --opt-heu=3 [solver.13]: --heuristic=Berkmin,512 --restarts=x,100,1.5,6 --local-restarts --init-w=2 --contr=0 [solver.14]: --no-lookback --heuristic=Unit --lookahead=atom --deletion=no --restarts=no clasp ’s portfolio is fully customizable configurations are assigned in a round-robin fashion to threads during parallel solving -t 4 uses four threads with crafty , trendy , frumpy , and jumpy Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 385 / 463

  26. clasp Disjunctive solving Outline 1 Potassco 2 gringo 3 clasp Features Parallel solving Configuration Disjunctive solving Domain heuristics 4 clingo 5 clingcon Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 386 / 463

  27. clasp Disjunctive solving clasp clasp is a multi-threaded solver for disjunctive logic programs aiming at an equitable interplay between “generating” and “testing” solver units allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 387 / 463

  28. clasp Disjunctive solving clasp clasp is a multi-threaded solver for disjunctive logic programs aiming at an equitable interplay between “generating” and “testing” solver units allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks Preprocessing Non-HCF SCCs HCC 1 ... HCC k Shared Data Data Data Generator Tester 1 Tester k Solver 1 Solver 1 ... Solver 1 . . . . . . . . . Solver n Solver n Solver n Generator Tester Configuration Configuration Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 387 / 463

  29. clasp Domain heuristics Outline 1 Potassco 2 gringo 3 clasp Features Parallel solving Configuration Disjunctive solving Domain heuristics 4 clingo 5 clingcon Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 388 / 463

  30. clasp Domain heuristics hclasp clasp allows for incorporating domain-specific heuristics into ASP solving input language for expressing domain-specific heuristics solving capacities for integrating domain-specific heuristics Example _heuristics(occ(A,T),factor,T) :- action(A), time(T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 389 / 463

  31. clasp Domain heuristics hclasp clasp allows for incorporating domain-specific heuristics into ASP solving input language for expressing domain-specific heuristics solving capacities for integrating domain-specific heuristics Example _heuristics(occ(A,T),factor,T) :- action(A), time(T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 389 / 463

  32. clasp Domain heuristics Basic CDCL decision algorithm loop propagate // compute deterministic consequences if no conflict then if all variables assigned then return variable assignment else decide // non-deterministically assign some literal else if top-level conflict then return unsatisfiable else analyze // analyze conflict and add a conflict constraint backjump // undo assignments until conflict constraint is unit Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 390 / 463

  33. clasp Domain heuristics Basic CDCL decision algorithm loop propagate // compute deterministic consequences if no conflict then if all variables assigned then return variable assignment else decide // non-deterministically assign some literal else if top-level conflict then return unsatisfiable else analyze // analyze conflict and add a conflict constraint backjump // undo assignments until conflict constraint is unit Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 390 / 463

  34. clasp Domain heuristics Inside decide Heuristic functions h : A → [0 , + ∞ ) s : A → { T , F } and Algorithmic scheme 1 h ( a ) := α × h ( a ) + β ( a ) for each a ∈ A 2 U := A \ ( A T ∪ A F ) 3 C := argmax a ∈ U h ( a ) 4 a := τ ( C ) 5 A := A ∪ { a �→ s ( a ) } Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 391 / 463

  35. clasp Domain heuristics Inside decide Heuristic functions h : A → [0 , + ∞ ) s : A → { T , F } and Algorithmic scheme 1 h ( a ) := α × h ( a ) + β ( a ) for each a ∈ A 2 U := A \ ( A T ∪ A F ) 3 C := argmax a ∈ U h ( a ) 4 a := τ ( C ) 5 A := A ∪ { a �→ s ( a ) } Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 391 / 463

  36. clasp Domain heuristics Inside decide Heuristic functions h : A → [0 , + ∞ ) s : A → { T , F } and Algorithmic scheme 1 h ( a ) := α × h ( a ) + β ( a ) for each a ∈ A 2 U := A \ ( A T ∪ A F ) 3 C := argmax a ∈ U h ( a ) 4 a := τ ( C ) 5 A := A ∪ { a �→ s ( a ) } Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 391 / 463

  37. clasp Domain heuristics Heuristic language elements Heuristic predicate heuristic Heuristic modifiers (atom, a , and integer, v ) init for initializing the heuristic value of a with v factor for amplifying the heuristic value of a by factor v level for ranking all atoms; the rank of a is v sign for attributing the sign of v as truth value to a Heuristic atoms _heuristic(occurs(A,T),factor,T) :- action(A), time(T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 392 / 463

  38. clasp Domain heuristics Heuristic language elements Heuristic predicate heuristic Heuristic modifiers (atom, a , and integer, v ) init for initializing the heuristic value of a with v factor for amplifying the heuristic value of a by factor v level for ranking all atoms; the rank of a is v sign for attributing the sign of v as truth value to a Heuristic atoms _heuristic(occurs(A,T),factor,T) :- action(A), time(T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 392 / 463

  39. clasp Domain heuristics Heuristic language elements Heuristic predicate heuristic Heuristic modifiers (atom, a , and integer, v ) init for initializing the heuristic value of a with v factor for amplifying the heuristic value of a by factor v level for ranking all atoms; the rank of a is v sign for attributing the sign of v as truth value to a Heuristic atoms _heuristic(occurs(A,T),factor,T) :- action(A), time(T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 392 / 463

  40. clasp Domain heuristics Heuristic language elements Heuristic predicate heuristic Heuristic modifiers (atom, a , and integer, v ) init for initializing the heuristic value of a with v factor for amplifying the heuristic value of a by factor v level for ranking all atoms; the rank of a is v sign for attributing the sign of v as truth value to a Heuristic atoms _heuristic(occurs(mv,5),factor,5) :- action(mv), time(5). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 392 / 463

  41. clasp Domain heuristics Heuristic language elements Heuristic predicate heuristic Heuristic modifiers (atom, a , and integer, v ) init for initializing the heuristic value of a with v factor for amplifying the heuristic value of a by factor v level for ranking all atoms; the rank of a is v sign for attributing the sign of v as truth value to a Heuristic atoms _heuristic(occurs(mv,5),factor,5) :- action(mv), time(5). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 392 / 463

  42. clasp Domain heuristics Heuristic language elements Heuristic predicate heuristic Heuristic modifiers (atom, a , and integer, v ) init for initializing the heuristic value of a with v factor for amplifying the heuristic value of a by factor v level for ranking all atoms; the rank of a is v sign for attributing the sign of v as truth value to a Heuristic atoms _heuristic(occurs(mv,5),factor,5) :- action(mv), time(5). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 392 / 463

  43. clasp Domain heuristics Heuristic language elements Heuristic predicate heuristic Heuristic modifiers (atom, a , and integer, v ) init for initializing the heuristic value of a with v factor for amplifying the heuristic value of a by factor v level for ranking all atoms; the rank of a is v sign for attributing the sign of v as truth value to a Heuristic atoms _heuristic(occurs(mv,5),factor,5) :- action(mv), time(5). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 392 / 463

  44. clasp Domain heuristics Simple STRIPS planner time(1..t). holds(P,0) :- init(P). 1 { occurs(A,T) : action(A) } 1 :- time(T). :- occurs(A,T), pre(A,F), not holds(F,T-1). holds(F,T) :- holds(F,T-1), not nolds(F,T), time(T). holds(F,T) :- occurs(A,T), add(A,F). nolds(F,T) :- occurs(A,T), del(A,F). :- query(F), not holds(F,t). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 393 / 463

  45. clasp Domain heuristics Simple STRIPS planner time(1..t). holds(P,0) :- init(P). 1 { occurs(A,T) : action(A) } 1 :- time(T). :- occurs(A,T), pre(A,F), not holds(F,T-1). holds(F,T) :- holds(F,T-1), not nolds(F,T), time(T). holds(F,T) :- occurs(A,T), add(A,F). nolds(F,T) :- occurs(A,T), del(A,F). :- query(F), not holds(F,t). _heuristic(occurs(A,T),factor,2) :- action(A), time(T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 393 / 463

  46. clasp Domain heuristics Simple STRIPS planner time(1..t). holds(P,0) :- init(P). 1 { occurs(A,T) : action(A) } 1 :- time(T). :- occurs(A,T), pre(A,F), not holds(F,T-1). holds(F,T) :- holds(F,T-1), not nolds(F,T), time(T). holds(F,T) :- occurs(A,T), add(A,F). nolds(F,T) :- occurs(A,T), del(A,F). :- query(F), not holds(F,t). _heuristic(occurs(A,T),level,1) :- action(A), time(T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 393 / 463

  47. clasp Domain heuristics Simple STRIPS planner time(1..t). holds(P,0) :- init(P). 1 { occurs(A,T) : action(A) } 1 :- time(T). :- occurs(A,T), pre(A,F), not holds(F,T-1). holds(F,T) :- holds(F,T-1), not nolds(F,T), time(T). holds(F,T) :- occurs(A,T), add(A,F). nolds(F,T) :- occurs(A,T), del(A,F). :- query(F), not holds(F,t). _heuristic(occurs(A,T),factor,T) :- action(A), time(T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 393 / 463

  48. clasp Domain heuristics Simple STRIPS planner time(1..t). holds(P,0) :- init(P). 1 { occurs(A,T) : action(A) } 1 :- time(T). :- occurs(A,T), pre(A,F), not holds(F,T-1). holds(F,T) :- holds(F,T-1), not nolds(F,T), time(T). holds(F,T) :- occurs(A,T), add(A,F). nolds(F,T) :- occurs(A,T), del(A,F). :- query(F), not holds(F,t). _heuristic(A,level,V) :- _heuristic(A,true, V). _heuristic(A,sign, 1) :- _heuristic(A,true, V). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 393 / 463

  49. clasp Domain heuristics Simple STRIPS planner time(1..t). holds(P,0) :- init(P). 1 { occurs(A,T) : action(A) } 1 :- time(T). :- occurs(A,T), pre(A,F), not holds(F,T-1). holds(F,T) :- holds(F,T-1), not nolds(F,T), time(T). holds(F,T) :- occurs(A,T), add(A,F). nolds(F,T) :- occurs(A,T), del(A,F). :- query(F), not holds(F,t). _heuristic(A,level,V) :- _heuristic(A,false,V). _heuristic(A,sign,-1) :- _heuristic(A,false,V). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 393 / 463

  50. clasp Domain heuristics Simple STRIPS planner time(1..t). holds(P,0) :- init(P). 1 { occurs(A,T) : action(A) } 1 :- time(T). :- occurs(A,T), pre(A,F), not holds(F,T-1). holds(F,T) :- holds(F,T-1), not nolds(F,T), time(T). holds(F,T) :- occurs(A,T), add(A,F). nolds(F,T) :- occurs(A,T), del(A,F). :- query(F), not holds(F,t). _heuristic(holds(F,T-1),true, t-T+1) :- holds(F,T). _heuristic(holds(F,T-1),false,t-T+1) :- fluent(F), time(T), not holds(F,T). Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 393 / 463

  51. clasp Domain heuristics Heuristic modifications to functions h and s ν ( V a , m ( A )) — “ value for modifier m on atom a wrt assignment A ” init and factor d 0 ( a ) = ν ( V a , init ( A 0 )) + h 0 ( a ) � ν ( V a , factor ( A i )) × h i ( a ) if V a , factor ( A i ) � = ∅ d i ( a ) = h i ( a ) otherwise sign  if ν ( V a , sign ( A i )) > 0 T  t i ( a ) = if ν ( V a , sign ( A i )) < 0 F s i ( a ) otherwise  A ′ ⊆ A ℓ A i ( A ′ ) = argmax a ∈A ′ ν ( V a , level ( A i )) level Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 394 / 463

  52. clasp Domain heuristics Heuristic modifications to functions h and s ν ( V a , m ( A )) — “ value for modifier m on atom a wrt assignment A ” init and factor d 0 ( a ) = ν ( V a , init ( A 0 )) + h 0 ( a ) � ν ( V a , factor ( A i )) × h i ( a ) if V a , factor ( A i ) � = ∅ d i ( a ) = h i ( a ) otherwise sign  if ν ( V a , sign ( A i )) > 0 T  t i ( a ) = if ν ( V a , sign ( A i )) < 0 F s i ( a ) otherwise  A ′ ⊆ A ℓ A i ( A ′ ) = argmax a ∈A ′ ν ( V a , level ( A i )) level Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 394 / 463

  53. clasp Domain heuristics Heuristic modifications to functions h and s ν ( V a , m ( A )) — “ value for modifier m on atom a wrt assignment A ” init and factor d 0 ( a ) = ν ( V a , init ( A 0 )) + h 0 ( a ) � ν ( V a , factor ( A i )) × h i ( a ) if V a , factor ( A i ) � = ∅ d i ( a ) = h i ( a ) otherwise sign  if ν ( V a , sign ( A i )) > 0 T  t i ( a ) = if ν ( V a , sign ( A i )) < 0 F s i ( a ) otherwise  A ′ ⊆ A ℓ A i ( A ′ ) = argmax a ∈A ′ ν ( V a , level ( A i )) level Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 394 / 463

  54. clasp Domain heuristics Heuristic modifications to functions h and s ν ( V a , m ( A )) — “ value for modifier m on atom a wrt assignment A ” init and factor d 0 ( a ) = ν ( V a , init ( A 0 )) + h 0 ( a ) � ν ( V a , factor ( A i )) × h i ( a ) if V a , factor ( A i ) � = ∅ d i ( a ) = h i ( a ) otherwise sign  if ν ( V a , sign ( A i )) > 0 T  t i ( a ) = if ν ( V a , sign ( A i )) < 0 F s i ( a ) otherwise  A ′ ⊆ A ℓ A i ( A ′ ) = argmax a ∈A ′ ν ( V a , level ( A i )) level Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 394 / 463

  55. clasp Domain heuristics Heuristic modifications to functions h and s ν ( V a , m ( A )) — “ value for modifier m on atom a wrt assignment A ” init and factor d 0 ( a ) = ν ( V a , init ( A 0 )) + h 0 ( a ) � ν ( V a , factor ( A i )) × h i ( a ) if V a , factor ( A i ) � = ∅ d i ( a ) = h i ( a ) otherwise sign  if ν ( V a , sign ( A i )) > 0 T  t i ( a ) = if ν ( V a , sign ( A i )) < 0 F s i ( a ) otherwise  A ′ ⊆ A ℓ A i ( A ′ ) = argmax a ∈A ′ ν ( V a , level ( A i )) level Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 394 / 463

  56. clasp Domain heuristics Heuristic modifications to functions h and s ν ( V a , m ( A )) — “ value for modifier m on atom a wrt assignment A ” init and factor d 0 ( a ) = ν ( V a , init ( A 0 )) + h 0 ( a ) � ν ( V a , factor ( A i )) × h i ( a ) if V a , factor ( A i ) � = ∅ d i ( a ) = h i ( a ) otherwise sign  if ν ( V a , sign ( A i )) > 0 T  t i ( a ) = if ν ( V a , sign ( A i )) < 0 F s i ( a ) otherwise  A ′ ⊆ A ℓ A i ( A ′ ) = argmax a ∈A ′ ν ( V a , level ( A i )) level Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 394 / 463

  57. clasp Domain heuristics Heuristic modifications to functions h and s ν ( V a , m ( A )) — “ value for modifier m on atom a wrt assignment A ” init and factor d 0 ( a ) = ν ( V a , init ( A 0 )) + h 0 ( a ) � ν ( V a , factor ( A i )) × h i ( a ) if V a , factor ( A i ) � = ∅ d i ( a ) = h i ( a ) otherwise sign  if ν ( V a , sign ( A i )) > 0 T  t i ( a ) = if ν ( V a , sign ( A i )) < 0 F s i ( a ) otherwise  A ′ ⊆ A ℓ A i ( A ′ ) = argmax a ∈A ′ ν ( V a , level ( A i )) level Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 394 / 463

  58. clasp Domain heuristics Inside decide , heuristically modified for each a ∈ A 0 h ( a ) := d ( a ) 1 h ( a ) := α × h ( a ) + β ( a ) for each a ∈ A 2 U := ℓ A ( A \ ( A T ∪ A F )) 3 C := argmax a ∈ U d ( a ) 4 a := τ ( C ) 5 A := A ∪ { a �→ t ( a ) } Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 395 / 463

  59. clasp Domain heuristics Inside decide , heuristically modified for each a ∈ A 0 h ( a ) := d ( a ) 1 h ( a ) := α × h ( a ) + β ( a ) for each a ∈ A 2 U := ℓ A ( A \ ( A T ∪ A F )) 3 C := argmax a ∈ U d ( a ) 4 a := τ ( C ) 5 A := A ∪ { a �→ t ( a ) } Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 395 / 463

  60. clasp Domain heuristics Inside decide , heuristically modified for each a ∈ A 0 h ( a ) := d ( a ) 1 h ( a ) := α × h ( a ) + β ( a ) for each a ∈ A 2 U := ℓ A ( A \ ( A T ∪ A F )) 3 C := argmax a ∈ U d ( a ) 4 a := τ ( C ) 5 A := A ∪ { a �→ t ( a ) } Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 395 / 463

  61. clasp Domain heuristics Selected high scores from systematic experiments Setting Labyrinth Sokoban Hanoi Tower base configuration 9,108 s (14) 2,844 s (3) 9,137 s (11) 24,545,667 19,371,267 41,016,235 a , init , 2 95% (12) 94% 91% (1) 84% 85% (9) 89% a , factor , 4 78% (8) 30% 120% (1) 107% 109% (11) 110% a , factor , 16 78% (10) 23% 120% (1) 107% 109% (11) 110% a , level , 1 90% (12) 5% 119% (2) 91% 126% (15) 120% f , init , 2 103% (14) 123% 74% (2) 71% 97% (10) 109% f , factor , 2 98% (12) 49% 116% (3) 134% 55% (6) 70% f , sign , -1 94% (13) 89% 105% (1) 100% 92% (12) 92% base configuration versus 38 (static) heuristic modifications (action, a, and fluent, f) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 396 / 463

  62. clasp Domain heuristics Selected high scores from systematic experiments Setting Labyrinth Sokoban Hanoi Tower base configuration 9,108 s (14) 2,844 s (3) 9,137 s (11) 24,545,667 19,371,267 41,016,235 a , init , 2 95% (12) 94% 91% (1) 84% 85% (9) 89% a , factor , 4 78% (8) 30% 120% (1) 107% 109% (11) 110% a , factor , 16 78% (10) 23% 120% (1) 107% 109% (11) 110% a , level , 1 90% (12) 5% 119% (2) 91% 126% (15) 120% f , init , 2 103% (14) 123% 74% (2) 71% 97% (10) 109% f , factor , 2 98% (12) 49% 116% (3) 134% 55% (6) 70% f , sign , -1 94% (13) 89% 105% (1) 100% 92% (12) 92% base configuration versus 38 (static) heuristic modifications (action, a, and fluent, f) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 396 / 463

  63. clasp Domain heuristics Abductive problems with optimization Setting Diagnosis Expansion Repair (H) Repair (S) base configuration 111.1 s (115) 161.5 s (100) 101.3 s (113) 33.3 s (27) sign,-1 324.5 s (407) 7.6 s (3) 8.4 s (5) 3.1 s (0) sign,-1 factor,2 310.1 s (387) 7.4 s (2) 3.5 s (0) 3.2 s (1) sign,-1 factor,8 305.9 s (376) 7.7 s (2) 3.1 s (0) 2.9 s (0) sign,-1 level,1 76.1 s (83) 6.6 s (2) 0.8 s (0) 2.2 s (1) level,1 77.3 s (86) 12.9 s (5) 3.4 s (0) 2.1 s (0) (abducibles subject to optimization) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 397 / 463

  64. clasp Domain heuristics Abductive problems with optimization Setting Diagnosis Expansion Repair (H) Repair (S) base configuration 111.1 s (115) 161.5 s (100) 101.3 s (113) 33.3 s (27) sign,-1 324.5 s (407) 7.6 s (3) 8.4 s (5) 3.1 s (0) sign,-1 factor,2 310.1 s (387) 7.4 s (2) 3.5 s (0) 3.2 s (1) sign,-1 factor,8 305.9 s (376) 7.7 s (2) 3.1 s (0) 2.9 s (0) sign,-1 level,1 76.1 s (83) 6.6 s (2) 0.8 s (0) 2.2 s (1) level,1 77.3 s (86) 12.9 s (5) 3.4 s (0) 2.1 s (0) (abducibles subject to optimization) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 397 / 463

  65. clasp Domain heuristics Planning Competition Benchmarks _heuristic(holds(F,T-1),true, t-T+1) :- holds(F,T). _heuristic(holds(F,T-1),false,t-T+1) :- fluent(F), time(T), not holds(F,T). Problem base configuration heuristic base c. (SAT) heur. (SAT) Blocks’00 134.4 s (180/61) 9.2 s (239/3) 163.2 s (59) 2.6 s (0) Elevator’00 3.1 s (279/0) 0.0 s (279/0) 3.4 s (0) 0.0 s (0) Freecell’00 288.7 s (147/115) 184.2 s (194/74) 226.4 s (47) 52.0 s (0) Logistics’00 145.8 s (148/61) 115.3 s (168/52) 113.9 s (23) 15.5 s (3) Depots’02 400.3 s (51/184) 297.4 s (115/135) 389.0 s (64) 61.6 s (0) Driverlog’02 308.3 s (108/143) 189.6 s (169/92) 245.8 s (61) 6.1 s (0) Rovers’02 245.8 s (138/112) 165.7 s (179/79) 162.9 s (41) 5.7 s (0) Satellite’02 398.4 s (73/186) 229.9 s (155/106) 364.6 s (82) 30.8 s (0) Zenotravel’02 350.7 s (101/169) 239.0 s (154/116) 224.5 s (53) 6.3 s (0) Total 252.8 s (1225/1031) 158.9 s (1652/657) 187.2 s (430) 17.1 s (3) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 398 / 463

  66. clasp Domain heuristics Planning Competition Benchmarks _heuristic(holds(F,T-1),true, t-T+1) :- holds(F,T). _heuristic(holds(F,T-1),false,t-T+1) :- fluent(F), time(T), not holds(F,T). Problem base configuration heuristic base c. (SAT) heur. (SAT) Blocks’00 134.4 s (180/61) 9.2 s (239/3) 163.2 s (59) 2.6 s (0) Elevator’00 3.1 s (279/0) 0.0 s (279/0) 3.4 s (0) 0.0 s (0) Freecell’00 288.7 s (147/115) 184.2 s (194/74) 226.4 s (47) 52.0 s (0) Logistics’00 145.8 s (148/61) 115.3 s (168/52) 113.9 s (23) 15.5 s (3) Depots’02 400.3 s (51/184) 297.4 s (115/135) 389.0 s (64) 61.6 s (0) Driverlog’02 308.3 s (108/143) 189.6 s (169/92) 245.8 s (61) 6.1 s (0) Rovers’02 245.8 s (138/112) 165.7 s (179/79) 162.9 s (41) 5.7 s (0) Satellite’02 398.4 s (73/186) 229.9 s (155/106) 364.6 s (82) 30.8 s (0) Zenotravel’02 350.7 s (101/169) 239.0 s (154/116) 224.5 s (53) 6.3 s (0) Total 252.8 s (1225/1031) 158.9 s (1652/657) 187.2 s (430) 17.1 s (3) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 398 / 463

  67. clasp Domain heuristics Planning Competition Benchmarks _heuristic(holds(F,T-1),true, t-T+1) :- holds(F,T). _heuristic(holds(F,T-1),false,t-T+1) :- fluent(F), time(T), not holds(F,T). Problem base configuration heuristic base c. (SAT) heur. (SAT) Blocks’00 134.4 s (180/61) 9.2 s (239/3) 163.2 s (59) 2.6 s (0) Elevator’00 3.1 s (279/0) 0.0 s (279/0) 3.4 s (0) 0.0 s (0) Freecell’00 288.7 s (147/115) 184.2 s (194/74) 226.4 s (47) 52.0 s (0) Logistics’00 145.8 s (148/61) 115.3 s (168/52) 113.9 s (23) 15.5 s (3) Depots’02 400.3 s (51/184) 297.4 s (115/135) 389.0 s (64) 61.6 s (0) Driverlog’02 308.3 s (108/143) 189.6 s (169/92) 245.8 s (61) 6.1 s (0) Rovers’02 245.8 s (138/112) 165.7 s (179/79) 162.9 s (41) 5.7 s (0) Satellite’02 398.4 s (73/186) 229.9 s (155/106) 364.6 s (82) 30.8 s (0) Zenotravel’02 350.7 s (101/169) 239.0 s (154/116) 224.5 s (53) 6.3 s (0) Total 252.8 s (1225/1031) 158.9 s (1652/657) 187.2 s (430) 17.1 s (3) Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 398 / 463

  68. clingo Outline 1 Potassco 2 gringo 3 clasp 4 clingo 5 clingcon 6 claspfolio 7 clavis Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 399 / 463

  69. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  70. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  71. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  72. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  73. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  74. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving After Clingo = gringo | clasp Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  75. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving Clingo = gringo ∗ | clasp ∗ After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  76. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving Clingo = ( gringo ∗ | clasp ∗ ) ∗ After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  77. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving Clingo = ( gringo ∗ | clasp ∗ ) ∗ After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  78. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving Clingo = ( gringo ∗ | clasp ∗ ) ∗ After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

  79. clingo Clingo species Before Clingo = gringo | clasp Clingo — easy solving iClingo — incremental solving oClingo — reactive solving Clingo = ( gringo ∗ | clasp ∗ ) ∗ After Clingo — easy solving + incremental solving + reactive solving + complex solving Clingo series 4 = ASP + Control Multi-shot ASP solving deals with continously changing programs Torsten Schaub (KRR@UP) Answer Set Solving in Practice December 9, 2014 400 / 463

Recommend

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de Potassco Slide Packages are licensed under a Creative Commons Attribution 3.0 Unported License. Torsten Schaub (KRR@UP) Answer Set Solving in

1.67k views • 134 slides
Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de Potassco Slide Packages are licensed under a Creative Commons Attribution 3.0 Unported License. Torsten Schaub (KRR@UP) Answer Set Solving in

1.75k views • 132 slides
Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de Potassco Slide Packages are licensed under a Creative Commons Attribution 3.0 Unported License. Torsten Schaub (KRR@UP) Answer Set Solving in

1.27k views • 113 slides
Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de Potassco Slide Packages are licensed under a Creative Commons Attribution 3.0 Unported License. Torsten Schaub (KRR@UP) Answer Set Solving in

1.83k views • 168 slides
Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de

Answer Set Solving in Practice Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de Potassco Slide Packages are licensed under a Creative Commons Attribution 3.0 Unported License. Torsten Schaub (KRR@UP) Answer Set Solving in

1.66k views • 161 slides
Answer Set Solving in Practice Torsten Schaub University of Potsdam Torsten Schaub (KRR@UP) ASP

Answer Set Solving in Practice Torsten Schaub University of Potsdam Torsten Schaub (KRR@UP) ASP

Answer Set Solving in Practice Torsten Schaub University of Potsdam Torsten Schaub (KRR@UP) ASP in Practice 1 / 69 Outline 1 Motivation 2 Introduction 3 Modeling by Example Graph Coloring Queens Traveling Salesperson 4 Meta Programming 5

1.92k views • 179 slides
Answer Set Solving in Practice Martin Gebser and Torsten Schaub University of Potsdam

Answer Set Solving in Practice Martin Gebser and Torsten Schaub University of Potsdam

Answer Set Solving in Practice Martin Gebser and Torsten Schaub University of Potsdam torsten@cs.uni-potsdam.de Potassco Slide Packages are licensed under a Creative Commons Attribution 3.0 Unported License. M. Gebser and T. Schaub (KRR@UP)

1.47k views • 113 slides
Outline Motivation Answer Set Programming is a well-known declarative problem solving approach.

Outline Motivation Answer Set Programming is a well-known declarative problem solving approach.

Motivation Motivation Outline Motivation Answer Set Programming is a well-known declarative problem solving approach. Answer Set Programs with Queries over Subprograms 1 Motivation Christoph Redl The Saturation Technique and its

259 views • 10 slides
Answer Set Programming, the Solving Paradigm for Knowledge Representation and Reasoning Martin

Answer Set Programming, the Solving Paradigm for Knowledge Representation and Reasoning Martin

Answer Set Programming, the Solving Paradigm for Knowledge Representation and Reasoning Martin Gebser Torsten Schaub University of Potsdam Martin Gebser (University of Potsdam) Answer Set Programming 1 / 33 Outline 1 Motivation 2

1.36k views • 105 slides
Physics 201 Test 2 practice Short Answer (4 points each) 1 What is the other half of the

Physics 201 Test 2 practice Short Answer (4 points each) 1 What is the other half of the

Physics 201 Test 2 practice Short Answer (4 points each) 1 What is the other half of the action/reaction pair associated with the normal force of a table supporting a book? 2 Give an algebraic expression for the net force acting on a skydiver

375 views • 3 slides
Table of Contents I Answer Set Programming ASP Solvers Example: Hamiltonian Cycles Choice Rules

Table of Contents I Answer Set Programming ASP Solvers Example: Hamiltonian Cycles Choice Rules

Table of Contents I Answer Set Programming ASP Solvers Example: Hamiltonian Cycles Choice Rules Solving Puzzles Yulia Kahl College of Charleston Artificial Intelligence 1 Reading Read Chapter 6, Answer-Set Programming Paradigm , in the

199 views • 15 slides
Winn Sales 15 May 2016 Peerceptiv Practice Issue Spotter Exam Assignment 2 Answer Key Plus

Winn Sales 15 May 2016 Peerceptiv Practice Issue Spotter Exam Assignment 2 Answer Key Plus

Winn Sales 15 May 2016 Peerceptiv Practice Issue Spotter Exam Assignment 2 Answer Key Plus Scoring Guidelines Farmer Sadie Smith normally planted 200 acres of soybeans every May and harvested them every September. In recent years, she has been

392 views • 3 slides
Practice to Pass- Compulsory Direct Questions Answer ALL questions 1. State three (3) elements of

Practice to Pass- Compulsory Direct Questions Answer ALL questions 1. State three (3) elements of

Practice to Pass- Compulsory Direct Questions Answer ALL questions 1. State three (3) elements of the external business environment and describe its impact on an organization of your choice briefly. ( 10 marks) 2. Describe the concept of motivation

148 views • 3 slides
Lesson 10 - I can multiply 3 digits by 1 digit - reasoning and problem solving Starter- recap

Lesson 10 - I can multiply 3 digits by 1 digit - reasoning and problem solving Starter- recap

Lesson 10 - I can multiply 3 digits by 1 digit - reasoning and problem solving Starter- recap 657 X 3 = 6 5 7 x 3 Starter- answers 657 X 3 = 1971 6 5 7 x 3 1 9 7 1 1 1 2 P roblem Solving: Which calculation has an answer

507 views • 11 slides
Best Practice for Transformative Mitigation Projects Webinar 20 November 3:00 - 4:30 EST 2019

Best Practice for Transformative Mitigation Projects Webinar 20 November 3:00 - 4:30 EST 2019

Best Practice for Transformative Mitigation Projects Webinar 20 November 3:00 - 4:30 EST 2019 CDBG-DR Problem Solving Clinic 1 2019 CDBG-DR Problem Solving Clinic 1 Presenters HUD Jen Carpenter, Assistant Director of Policy, HUD DRSI

1.21k views • 47 slides
Solving Systems Solving Systems by Graphing by Solving Systems by Substitution Graphing

Solving Systems Solving Systems by Graphing by Solving Systems by Substitution Graphing

Slide 1 / 176 Slide 2 / 176 Algebra I System of Linear Equations 2015-11-02 www.njctl.org Slide 3 / 176 Slide 4 / 176 Table of Contents Click on the topic to go to that section Solving Systems Solving Systems by Graphing by Solving

596 views • 30 slides
Tutorial on Proof Systems Connected to SAT Solving Sam Buss Univ. of California, San Diego

Tutorial on Proof Systems Connected to SAT Solving Sam Buss Univ. of California, San Diego

Tutorial on Proof Systems Connected to SAT Solving Sam Buss Univ. of California, San Diego Theory and Practice of SAT Solving Dagstuhl, Germany April 21, 2015 Sam Buss Tutorial on Proof Systems Connected to SAT Solving Satisfiability (SAT);

561 views • 29 slides
Problem-Solving with Only 28% of employers classify college graduates Think-Alouds problem

Problem-Solving with Only 28% of employers classify college graduates Think-Alouds problem

12/5/14 Analysis of the situation Problem-solving is viewed as necessary for success in STEM fields, with the American Chemical Society (ACS) going so far as to refer to problem-solving as the ultimate goal. Problem-Solving with

316 views • 4 slides
The SARA Model A best practice problem-solving method Key Learning Objectives 2 PSOs will

The SARA Model A best practice problem-solving method Key Learning Objectives 2 PSOs will

The SARA Model A best practice problem-solving method Key Learning Objectives 2 PSOs will understand their PSOs will have an roles and responsibilities understanding of the SARA when it comes to using the model SARA database SARA/

632 views • 28 slides
2018 Calhoun Community College Mathematics Tournament CIPHERING PRACTICE Question 1 Write the

2018 Calhoun Community College Mathematics Tournament CIPHERING PRACTICE Question 1 Write the

2018 Calhoun Community College Mathematics Tournament CIPHERING PRACTICE Question 1 Write the name of the Greek letter shown here on the The Significant Figure. Answer to PRACTICE Question 1 LAMBDA PRACTICE Question 2 Buddy the elf

617 views • 25 slides
2017 Calhoun Community College Mathematics Tournament CIPHERING PRACTICE Question 1 Write the

2017 Calhoun Community College Mathematics Tournament CIPHERING PRACTICE Question 1 Write the

2017 Calhoun Community College Mathematics Tournament CIPHERING PRACTICE Question 1 Write the name of the Greek letter emblazoned on the chest of The Significant Figure here: Answer to PRACTICE Question 1 SIGMA PRACTICE Question 2

770 views • 25 slides
Solving Triangles and the Law of Cosines In this section we work out the law of cosines from our

Solving Triangles and the Law of Cosines In this section we work out the law of cosines from our

Solving Triangles and the Law of Cosines In this section we work out the law of cosines from our earlier identities and then practice applying this new identity. c 2 = a 2 + b 2 2 ab cos C. (1) Elementary Functions Draw the triangle ABC

87 views • 6 slides
V OCABULARY : Solving of problems involving quadratic equations Problems involving quadratic

V OCABULARY : Solving of problems involving quadratic equations Problems involving quadratic

D AY 157 Q UADRATIC APPLICATION PRACTICE I NTRODUCTION Quadratic equations are one of the most common polynomials that we come across in day to day life. In this lessons, we are going to see how these equations are used in problem solving. V

228 views • 11 slides
Quiz I Give the SVD-based algorithm for solving least squares, and I justify the algorithm by that

Quiz I Give the SVD-based algorithm for solving least squares, and I justify the algorithm by that

Quiz I Give the SVD-based algorithm for solving least squares, and I justify the algorithm by that showing it outputs the correct answer. I Under what circumstances would this algorithm be preferred over the QR-based algorithm? The Eigenvector

905 views • 18 slides

More recommend