? Stephan Schulz schulz@eprover.org Driving the State of the Art - - PowerPoint PPT Presentation

stephan schulz schulz eprover org driving the state of
SMART_READER_LITE
LIVE PREVIEW

? Stephan Schulz schulz@eprover.org Driving the State of the Art - - PowerPoint PPT Presentation

We know (nearly) nothing! But can we learn? ? Stephan Schulz schulz@eprover.org Driving the State of the Art Calculus Implementation Search Control 2 Driving the State of the Art How to do What inference system to use? inferences e ffi


slide-1
SLIDE 1

?

We know (nearly) nothing!

But can we learn? Stephan Schulz

schulz@eprover.org

slide-2
SLIDE 2

Driving the State of the Art

Implementation Calculus Search Control

2

slide-3
SLIDE 3

Driving the State of the Art

Implementation Calculus Search Control Where to search for proofs? What inference system to use? How to do inferences efficiently?

2

slide-4
SLIDE 4

Evolution of Calculus

2000 4000 6000 8000 10000 50 100 150 200 250 300 "E 0.2 FOF/Calc" E 0.2 FOF

3

slide-5
SLIDE 5

Evolution of Implementation

2000 4000 6000 8000 10000 50 100 150 200 250 300 "E 0.2 FOF" E 0.2 FOF Fast

4

slide-6
SLIDE 6

Evolution of Implementation

2000 4000 6000 8000 10000 50 100 150 200 250 300 E 1.8 Best E 1.8 Slow

4

slide-7
SLIDE 7

Evolution of Search Control/Clause Selection

2000 4000 6000 8000 10000 50 100 150 200 250 300 E 0.2 Goals E 0.2 Larry E 0.2 FOF E 0.2 SC

5

slide-8
SLIDE 8

Evolution of Search Control/Literal Selection

2000 4000 6000 8000 10000 50 100 150 200 250 300 E 0.2 SmallestNegLit E 0.2 MaxLComplexAvoidPosPred E 0.2 FOF

6

slide-9
SLIDE 9

Compare and Contrast

2000 4000 6000 8000 10000 50 100 150 200 250 300 "E 0.2 FOF/Calc" E 0.2 FOF 2000 4000 6000 8000 10000 50 100 150 200 250 300 "E 0.2 FOF" E 0.2 FOF Fast 2000 4000 6000 8000 10000 50 100 150 200 250 300 E 0.2 Goals E 0.2 Larry E 0.2 FOF E 0.2 SC 2000 4000 6000 8000 10000 50 100 150 200 250 300 E 0.2 SmallestNegLit E 0.2 MaxLComplexAvoidPosPred E 0.2 FOF 7

slide-10
SLIDE 10

Improving heuristics has been the main source

  • f progress in proof search!

8

slide-11
SLIDE 11

. . . and our heuristics still suck!

500 1000 1500 problems 0.0 0.2 0.4 0.6 0.8 1.0 ratio Evolved 10SC11/FIFO SC11 FIFO

9

slide-12
SLIDE 12

Humans are Inadequate!

◮ We are not good at keeping large amounts of data in our head ◮ We are not good at analysing large amounts of data without help ◮ We are not good visualising complex relationships

Compare “The Magical Number Seven, Plus or Minus Two”

10

slide-13
SLIDE 13

Player of Games

◮ Chess

◮ State: Different pieces on an 8x8 board ◮ Choice point: Which piece moves where

◮ (Opening)

◮ Success: Capture of the king

11

slide-14
SLIDE 14

Player of Games

◮ Chess

◮ State: Different pieces on an 8x8 board ◮ Choice point: Which piece moves where

◮ (Opening)

◮ Success: Capture of the king

◮ Go

◮ State: Configuration of stones on a 19x19 board ◮ Choice point: Where to place the next stone ◮ Success: Control of larger area of the board

11

slide-15
SLIDE 15

Player of Games

◮ Chess

◮ State: Different pieces on an 8x8 board ◮ Choice point: Which piece moves where

◮ (Opening)

◮ Success: Capture of the king

◮ Go

◮ State: Configuration of stones on a 19x19 board ◮ Choice point: Where to place the next stone ◮ Success: Control of larger area of the board

◮ Saturating theorem proving

◮ State: Set of clauses ◮ Choice point: Which clause to process next?

◮ Pick term ordering, literal selection strategy

◮ Success: Derivation of the empty clause

U

(unprocessed clauses) Gene- rate Simpli- fiable? Cheap Simplify Simplify

g P

(processed clauses) g=☐ ?

11

slide-16
SLIDE 16

Player of Games

◮ Chess

◮ State: Different pieces on an 8x8 board ◮ Choice point: Which piece moves where

◮ (Opening)

◮ Success: Capture of the king

◮ Go

◮ State: Configuration of stones on a 19x19 board ◮ Choice point: Where to place the next stone ◮ Success: Control of larger area of the board

◮ Saturating theorem proving

◮ State: Set of clauses ◮ Choice point: Which clause to process next?

◮ Pick term ordering, literal selection strategy

◮ Success: Derivation of the empty clause

U

(unprocessed clauses) Gene- rate Simpli- fiable? Cheap Simplify Simplify

g P

(processed clauses) g=☐ ?

11

slide-17
SLIDE 17

Player of Games

◮ Chess

◮ State: Different pieces on an 8x8 board ◮ Choice point: Which piece moves where

◮ (Opening)

◮ Success: Capture of the king

◮ Go

◮ State: Configuration of stones on a 19x19 board ◮ Choice point: Where to place the next stone ◮ Success: Control of larger area of the board

◮ Saturating theorem proving

◮ State: Set of clauses ◮ Choice point: Which clause to process next?

◮ Pick term ordering, literal selection strategy

◮ Success: Derivation of the empty clause

U

(unprocessed clauses) Gene- rate Simpli- fiable? Cheap Simplify Simplify

g P

(processed clauses) g=☐ ?

11

slide-18
SLIDE 18

Player of Games

◮ Chess

◮ State: Different pieces on an 8x8 board ◮ Choice point: Which piece moves where

◮ (Opening)

◮ Success: Capture of the king

◮ Go

◮ State: Configuration of stones on a 19x19 board ◮ Choice point: Where to place the next stone ◮ Success: Control of larger area of the board

◮ Saturating theorem proving

◮ State: Set of clauses ◮ Choice point: Which clause to process next?

◮ Pick term ordering, literal selection strategy

◮ Success: Derivation of the empty clause

U

(unprocessed clauses) Gene- rate Simpli- fiable? Cheap Simplify Simplify

g P

(processed clauses) g=☐ ?

11

slide-19
SLIDE 19

Player of Games

◮ Chess

◮ State: Different pieces on an 8x8 board ◮ Choice point: Which piece moves where

◮ (Opening)

◮ Success: Capture of the king

◮ Go

◮ State: Configuration of stones on a 19x19 board ◮ Choice point: Where to place the next stone ◮ Success: Control of larger area of the board

◮ Saturating theorem proving

◮ State: Set of clauses ◮ Choice point: Which clause to process next?

◮ Pick term ordering, literal selection strategy

◮ Success: Derivation of the empty clause

U

(unprocessed clauses) Gene- rate Simpli- fiable? Cheap Simplify Simplify

g P

(processed clauses) g=☐ ?

11

slide-20
SLIDE 20

Player of Games

◮ Chess

◮ State: Different pieces on an 8x8 board ◮ Choice point: Which piece moves where

◮ (Opening)

◮ Success: Capture of the king

◮ Go

◮ State: Configuration of stones on a 19x19 board ◮ Choice point: Where to place the next stone ◮ Success: Control of larger area of the board

◮ Saturating theorem proving

◮ State: Set of clauses ◮ Choice point: Which clause to process next?

◮ Pick term ordering, literal selection strategy

◮ Success: Derivation of the empty clause

?

11

slide-21
SLIDE 21

Grand Challenge

Integrate Machine Learning and Symbolic Reasoning

12

slide-22
SLIDE 22

Discussion

◮ Should we target domain-specific or more general search control

knowledge?

◮ Deep learning or hand-selected features - which is better for learning

search control knowledge?

◮ What is a better source for learning: Meta-information

(success/failure, time to success, . . . ), full proofs, or even full search protocols?

13

slide-23
SLIDE 23

Discussion

◮ Should we target domain-specific or more general search control

knowledge?

◮ Deep learning or hand-selected features - which is better for learning

search control knowledge?

◮ What is a better source for learning: Meta-information

(success/failure, time to success, . . . ), full proofs, or even full search protocols?

Discuss away!

13