inductive theorem proving
play

Inductive Theorem Proving Automated Reasoning Petros Papapanagiotou - PowerPoint PPT Presentation

Dec 06, 2023 •39 likes •379 views

Introduction Inductive Proofs Automation Conclusion Inductive Theorem Proving Automated Reasoning Petros Papapanagiotou P.Papapanagiotou@sms.ed.ac.uk 11 October 2012 Petros Papapanagiotou Inductive Theorem Proving Introduction Inductive

  1. Introduction Inductive Proofs Automation Conclusion Inductive Theorem Proving Automated Reasoning Petros Papapanagiotou P.Papapanagiotou@sms.ed.ac.uk 11 October 2012 Petros Papapanagiotou Inductive Theorem Proving

  2. Introduction Inductive Proofs Automation Conclusion General Induction Theorem Proving Proof Assistants: Formalise theories and prove properties. Ensure soundness and correctness . Interactive vs. Automated Decision procedures, model elimination, rewriting, counterexamples,... eg. Interactive: Isabelle, Coq, HOL Light, HOL4, ... Automated: ACL2, IsaPlanner, SAT solvers, ... Petros Papapanagiotou Inductive Theorem Proving

  3. Introduction Inductive Proofs Automation Conclusion General Induction Induction Inductive datatypes are everywhere! Mathematics (eg. arithmetic) Hardware & software models ... Petros Papapanagiotou Inductive Theorem Proving

  4. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Natural Numbers Definition (Natural Numbers) 0, Suc n Petros Papapanagiotou Inductive Theorem Proving

  5. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Natural Numbers Definition (Natural Numbers) 0, Suc n Example Suc 0 = 1 Suc ( Suc 0 ) = 2 Suc ( Suc ( Suc 0 ) = 3 Petros Papapanagiotou Inductive Theorem Proving

  6. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Natural Numbers Definition (Natural Numbers) 0, Suc n Example Suc 0 = 1 Suc ( Suc 0 ) = 2 Suc ( Suc ( Suc 0 ) = 3 Induction principle P ( 0 ) ∀ n . P ( n ) ⇒ P ( Suc n ) ∀ n . P ( n ) Petros Papapanagiotou Inductive Theorem Proving

  7. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Lists Definition (Lists) [ ] , h # t Petros Papapanagiotou Inductive Theorem Proving

  8. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Lists Definition (Lists) [ ] , h # t Example 1 # [ ] = [ 1 ] 1 # ( 2 # [ ]) = [ 1 , 2 ] 1 # ( 2 # ( 3 # [ ])) = [ 1 , 2 , 3 ] Petros Papapanagiotou Inductive Theorem Proving

  9. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Lists Definition (Lists) [ ] , h # t Example 1 # [ ] = [ 1 ] 1 # ( 2 # [ ]) = [ 1 , 2 ] 1 # ( 2 # ( 3 # [ ])) = [ 1 , 2 , 3 ] Induction principle P ([ ]) ∀ h . ∀ l . P ( l ) ⇒ P ( h # l ) ∀ l . P ( l ) Petros Papapanagiotou Inductive Theorem Proving

  10. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Binary Partition Trees Definition (Partition) Empty , Filled , Branch partition 1 partition 2 Petros Papapanagiotou Inductive Theorem Proving

  11. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Binary Partition Trees Definition (Partition) Empty , Filled , Branch partition 1 partition 2 Example Branch Empty ( Branch Filled Filled ) Petros Papapanagiotou Inductive Theorem Proving

  12. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Induction Binary Partition Trees Definition (Partition) Empty , Filled , Branch partition 1 partition 2 Example Branch Empty ( Branch Filled Filled ) Induction principle ( partition.induct ) P ( Empty ) P ( Filled ) ∀ p 1 p 2 . P ( p 1 ) ∧ P ( p 2 ) ⇒ P ( Branch p 1 p 2 ) ∀ partition . P ( partition ) Petros Papapanagiotou Inductive Theorem Proving

  13. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Generally Symbolic evaluation (rewriting). Axioms - definitions Rewrite rules Fertilization (use induction hypothesis). Petros Papapanagiotou Inductive Theorem Proving

  14. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Simple Example: List Append Definition (List Append @ ) ∀ l . [ ] @ l = l 1 ∀ h . ∀ t . ∀ l . ( h # t ) @ l = h # ( t @ l ) 2 Example ( [ 1 ; 2 ] @ [ 3 ] = [ 1 ; 2 ; 3 ] ) ( 1 # ( 2 # [ ])) @ ( 3 # [ ])) = 1 # (( 2 # [ ]) @ ( 3 # [ ])) = 1 # ( 2 # ([ ] @ ( 3 # [ ]))) = 1 # ( 2 # ( 3 # [ ])) Petros Papapanagiotou Inductive Theorem Proving

  15. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Simple Example: List Append Definition (List Append @ ) ∀ l . [ ] @ l = l 1 ∀ h . ∀ t . ∀ l . ( h # t ) @ l = h # ( t @ l ) 2 Theorem (Associativity of Append) ∀ k . ∀ l . ∀ m . k @ ( l @ m ) = ( k @ l ) @ m Base Case. ⊢ [ ] @ ( l @ m ) = ([ ] @ l ) @ m 1 ⇒ l @ m = ([ ] @ l ) @ m ⇐ 1 ⇒ l @ m = l @ m ⇐ refl ⇐ ⇒ true Petros Papapanagiotou Inductive Theorem Proving

  16. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Simple Example: List Append Definition (List Append @ ) ∀ l . [ ] @ l = l 1 ∀ h . ∀ t . ∀ l . ( h # t ) @ l = h # ( t @ l ) 2 Step Case. k @ ( l @ m ) = ( k @ l ) @ m ⊢ ( h # k ) @ ( l @ m ) = (( h # k ) @ l ) @ m 2 ⇐ ⇒ h # ( k @ ( l @ m )) = ( h # ( k @ l )) @ m 2 ⇒ h # ( k @ ( l @ m )) = h # (( k @ l ) @ m ) ⇐ repl ⇒ h = h ∧ k @ ( l @ m ) = ( k @ l ) @ m ⇐ IH ⇐ ⇒ h = h refl ⇐ ⇒ true Petros Papapanagiotou Inductive Theorem Proving

  17. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Simple Example 2: Idempotence of Union Definition (Partition Union @@ ) Empty @@ q = q 3 Filled @@ q = Filled 4 p @@ Empty = p 5 p @@ Filled = Filled 6 ( Branch l 1 r 1 ) @@ ( Branch l 2 r 2 ) = 7 Branch ( l 1 @@ l 2 ) ( r 1 @@ r 2 ) Petros Papapanagiotou Inductive Theorem Proving

  18. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Simple Example 2: Idempotence of Union Definition (Partition Union @@ ) Empty @@ q = q 3 Filled @@ q = Filled 4 p @@ Empty = p 5 p @@ Filled = Filled 6 ( Branch l 1 r 1 ) @@ ( Branch l 2 r 2 ) = 7 Branch ( l 1 @@ l 2 ) ( r 1 @@ r 2 ) Theorem (Idempotence of union) ∀ p . p @@ p = p Petros Papapanagiotou Inductive Theorem Proving

  19. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Simple Example 2: Idempotence of Union Definition (Partition Union @@ ) Empty @@ q = q 3 Filled @@ q = Filled 4 ( Branch l 1 r 1 ) @@ ( Branch l 2 r 2 ) = 7 Branch ( l 1 @@ l 2 ) ( r 1 @@ r 2 ) Base Case 1. ⊢ Empty @@ Empty = Empty 3 ⇐ ⇒ Empty = Empty refl ⇐ ⇒ true Petros Papapanagiotou Inductive Theorem Proving

  20. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Simple Example 2: Idempotence of Union Definition (Partition Union @@ ) Empty @@ q = q 3 Filled @@ q = Filled 4 ( Branch l 1 r 1 ) @@ ( Branch l 2 r 2 ) = 7 Branch ( l 1 @@ l 2 ) ( r 1 @@ r 2 ) Base Case 2. ⊢ Filled @@ Filled = Filled 4 ⇒ Filled = Filled ⇐ refl ⇐ ⇒ true Petros Papapanagiotou Inductive Theorem Proving

  21. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Simple Example 2: Idempotence of union Definition (Partition Union @@ ) Empty @@ q = q 3 Filled @@ q = Filled 4 ( Branch l 1 r 1 ) @@ ( Branch l 2 r 2 ) = 7 Branch ( l 1 @@ l 2 ) ( r 1 @@ r 2 ) Step Case. p 1 @@ p 1 = p 1 p 2 @@ p 2 = p 2 ∧ ⊢ ( Branch p 1 p 2 ) @@ ( Branch p 1 p 2 ) = Branch p 1 p 2 7 ⇐ ⇒ Branch ( p 1 @@ p 1 ) ( p 2 @@ p 2 ) = Branch p 1 p 2 IH ⇒ Branch p 1 p 2 = Branch p 1 p 2 ⇐ refl ⇐ ⇒ true Petros Papapanagiotou Inductive Theorem Proving

  22. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Automation Is rewriting and fertilization enough? No! Because: Incompleteness (G¨ odel) Undecidability of Halting Problem (Turing) Failure of Cut Elimination (Kreisel) Cut Rule A , Γ ⊢ ∆ Γ ⊢ A Γ ⊢ ∆ Petros Papapanagiotou Inductive Theorem Proving

  23. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Blocking Example Definition (List Reverse rev ) rev [ ] = [ ] 8 ∀ h . ∀ t . rev ( h # t ) = rev t @ ( h # [ ]) 9 Theorem (Reverse of reverse) ∀ l . rev ( rev l ) = l Base Case. ⊢ rev ( rev [ ]) = [ ] 8 ⇐ ⇒ rev [ ] = [ ] 8 ⇒ [ ] = [ ] ⇐ refl ⇐ ⇒ true Petros Papapanagiotou Inductive Theorem Proving

  24. Introduction Inductive Proofs Automation Conclusion Numbers Lists Trees On paper Issues Demo Inductive Proofs Blocking Example Definition (List Reverse rev ) rev [ ] = [ ] 8 ∀ h . ∀ t . rev ( h # t ) = rev t @ ( h # [ ]) 9 Theorem (Reverse of reverse) ∀ l . rev ( rev l ) = l Step Case. rev ( rev l ) = l ⊢ rev ( rev ( h # l )) = h # l 9 ⇒ rev ( rev l @( h # [ ])) = h # l ⇐ Now what?? Petros Papapanagiotou Inductive Theorem Proving

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

On Theorem Proving for Program Checking Historical perspective and recent developments Maria

On Theorem Proving for Program Checking Historical perspective and recent developments Maria

Outline Introduction Where is theorem proving in program checking Inside theorem proving Big and little engines together: a new theorem proving style Decision procedures with speculative inferences Current and future challenges On Theorem

944 views • 69 slides
Visual theorem proving with the Incredible Proof Machine The idea Theorem Proving without

Visual theorem proving with the Incredible Proof Machine The idea Theorem Proving without

Interactive Theorem Proving, Nancy August 22, 2016 Joachim Breitner Karlsruhe Institute of Technology University of Pennsylvania, Philadelphia Visual theorem proving with the Incredible Proof Machine The idea Theorem Proving without Syntax

579 views • 43 slides
Matrix-based Inductive Theorem Proving Christoph Kreitz Department of Computer Science, Cornell

Matrix-based Inductive Theorem Proving Christoph Kreitz Department of Computer Science, Cornell

Matrix-based Inductive Theorem Proving Christoph Kreitz Department of Computer Science, Cornell University, Ithaca, NY 14853 Brigitte Pientka Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213 Automated Induction

191 views • 16 slides
Automated Theorem Proving 1/4: Introduction and Propositional Theorem Proving A.L. Lamprecht

Automated Theorem Proving 1/4: Introduction and Propositional Theorem Proving A.L. Lamprecht

Automated Theorem Proving 1/4: Introduction and Propositional Theorem Proving A.L. Lamprecht Course Program Semantics and Verfication 2020, Utrecht University September 21, 2020 Lecture Notes Automated Reasoning by Gerard A.W. Vreeswijk.

609 views • 40 slides
Automated Theorem Proving 2/4: First-Order Theorem Proving A.L. Lamprecht Course Program

Automated Theorem Proving 2/4: First-Order Theorem Proving A.L. Lamprecht Course Program

Automated Theorem Proving 2/4: First-Order Theorem Proving A.L. Lamprecht Course Program Semantics and Verfication 2020, Utrecht University September 23, 2020 Lecture Notes Automated Reasoning by Gerard A.W. Vreeswijk. Available for

1.03k views • 54 slides
Theorem-Proving Environments Nathan Ng CSC2547: Learning to Search Theorem Proving What is a

Theorem-Proving Environments Nathan Ng CSC2547: Learning to Search Theorem Proving What is a

Theorem-Proving Environments Nathan Ng CSC2547: Learning to Search Theorem Proving What is a theorem? Statement proven based on basis of previously established statements Premise: If I attend UofT, I am a student Premise: I attend

375 views • 25 slides
Artificial Intelligence in Theorem Proving Cezary Kaliszyk VTSA Overview Last Lecture theorem

Artificial Intelligence in Theorem Proving Cezary Kaliszyk VTSA Overview Last Lecture theorem

Artificial Intelligence in Theorem Proving Cezary Kaliszyk VTSA Overview Last Lecture theorem proving problems premise selection deep learning for theorem proving state estimation Today automated reasoning learning in classical ATPs

1.18k views • 97 slides
Health Warning Principles, Techniques, Applications Theorem Proving is addictive Gerwin Klein

Health Warning Principles, Techniques, Applications Theorem Proving is addictive Gerwin Klein

W HAT YOU WILL LEARN how to use a theorem prover background, how it works how to prove and specify NICTA Advanced Course Slide 1 Slide 3 Theorem Proving Health Warning Principles, Techniques, Applications Theorem Proving is

262 views • 9 slides
Artificial Intelligence in Theorem Proving Cezary Kaliszyk VTSA 2019 Computer Theorem Proving

Artificial Intelligence in Theorem Proving Cezary Kaliszyk VTSA 2019 Computer Theorem Proving

Artificial Intelligence in Theorem Proving Cezary Kaliszyk VTSA 2019 Computer Theorem Proving Computer used to automate reasoning in a logic Traditionally part of artificial intelligence (not machine learning) Field of research since the

1.25k views • 101 slides
Formal Verification Methods 4: Theorem Proving John Harrison Intel Corporation Need for

Formal Verification Methods 4: Theorem Proving John Harrison Intel Corporation Need for

Formal Verification Methods 4: Theorem Proving Formal Verification Methods 4: Theorem Proving John Harrison Intel Corporation Need for general theorem proving Set theory vs. higher-order logic Herbrand-based approaches

475 views • 18 slides
How (Not) to Prove Theorems About Algorithms (or; fun with inductive types! ) Jack Crawford

How (Not) to Prove Theorems About Algorithms (or; fun with inductive types! ) Jack Crawford

Introduction Case Study: Gaussian Elimination How (Not) to Prove Theorems About Algorithms (or; fun with inductive types! ) Jack Crawford MATH3349: Special Topics in Mathematics Automated and Interactive Theorem Proving November 16, 2018 Jack

649 views • 45 slides
Learning theorem proving through self-play Stanisaw Purga Overview AlphaZero Proving

Learning theorem proving through self-play Stanisaw Purga Overview AlphaZero Proving

Learning theorem proving through self-play Stanisaw Purga Overview AlphaZero Proving game adjusting MCTS for proving game some results 2019-10 1 Neural black box game state S move policy expected outcome R n v

455 views • 45 slides
Saturation-based Theorem Proving and ML Course Machine Learning and Reasoning 2020 MLR 2020 1 1

Saturation-based Theorem Proving and ML Course Machine Learning and Reasoning 2020 MLR 2020 1 1

First-order Logic and Theorem Proving Saturation-based Proving Further Tuning and the Role of Strategies Summary Saturation-based Theorem Proving and ML Course Machine Learning and Reasoning 2020 MLR 2020 1 1 Czech Technical Univeristy in

913 views • 64 slides
Mechanical Theorem Proving in Tarskis Geometry. Julien Narboux under the supervision of Hugo

Mechanical Theorem Proving in Tarskis Geometry. Julien Narboux under the supervision of Hugo

Mechanical Theorem Proving in Tarskis Geometry. Julien Narboux under the supervision of Hugo Herbelin LIX, INRIA Futurs, Ecole Polytechnique 31/08/2006, Pontevedra, Spain Outline 1 Interactive proof / Automated theorem proving 2

1.1k views • 73 slides
Proving In fi nite Satis fi ability Peter Baumgartner Joshua Bax Goal Theorem Proving in

Proving In fi nite Satis fi ability Peter Baumgartner Joshua Bax Goal Theorem Proving in

Proving In fi nite Satis fi ability Peter Baumgartner Joshua Bax Goal Theorem Proving in Hierarchic Combinations of Speci fi cations Dis Background theory linear integer arithmetic Data structures ? Conjecture list axioms/arrays

443 views • 15 slides
Theorem Proving and the Real Numbers Applications and Challenges Lawrence C Paulson 1.

Theorem Proving and the Real Numbers Applications and Challenges Lawrence C Paulson 1.

Theorem Proving and the Real Numbers Applications and Challenges Lawrence C Paulson 1. Interactive Theorem Proving A partial, biased history A UTOMATH L. S. van Benthem Jutting, Checking Landaus Grundlagen in the A UTOMATH

920 views • 37 slides
Buffons needle probability of rational product Cantor sets Izabella Laba The Abel

Buffons needle probability of rational product Cantor sets Izabella Laba The Abel

Buffons needle probability of rational product Cantor sets Izabella Laba The Abel Symposium, Oslo, August 2012 Izabella Laba Buffons needle probability of rational product Cantor sets The Favard length problem Let E =

954 views • 82 slides
Finding Shortest Paths Shortest Path Problem Shortest Path Problem We are given a graph G = ( V ,

Finding Shortest Paths Shortest Path Problem Shortest Path Problem We are given a graph G = ( V ,

Finding Shortest Paths Shortest Path Problem Shortest Path Problem We are given a graph G = ( V , E ) and an edge weight function : E R . Length of a Path The length or weight ( P ) of a path P = { v 1 , v 2 , . . . , v l } with at

495 views • 20 slides
Cloth Simulation CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2018 Cloth

Cloth Simulation CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2018 Cloth

Cloth Simulation CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Winter 2018 Cloth Simulation Cloth simulation has been an important topic in computer animation since the early 1980s It has been extensively researched,

599 views • 45 slides
Counteracting Adversarial Attacks in Autonomous Driving Qi Sun 1 , Arjun Ashok Rao 1 , Xufeng Yao

Counteracting Adversarial Attacks in Autonomous Driving Qi Sun 1 , Arjun Ashok Rao 1 , Xufeng Yao

Counteracting Adversarial Attacks in Autonomous Driving Qi Sun 1 , Arjun Ashok Rao 1 , Xufeng Yao 1 , Bei Yu 1 , Shiyan Hu 2 1 The Chinese University of Hong Kong 2 University of Southampton 1 / 21 Vision-Based Object Detection Classification

640 views • 29 slides
Software Requirements Engineering Material for Software Engineering for Outsourced &

Software Requirements Engineering Material for Software Engineering for Outsourced &

Software Requirements Engineering Material for Software Engineering for Outsourced & Offshore Development Bertrand Meyer Bernd Schoeller Chair of Software Engineering, ETH Zurich Fall 2005 Softw are Engineering Statements about

1.17k views • 100 slides
Trigger Strategies for Long-Lived Particles LHC Searches for LL BSM Particles: Theory Meets

Trigger Strategies for Long-Lived Particles LHC Searches for LL BSM Particles: Theory Meets

Trigger Strategies for Long-Lived Particles LHC Searches for LL BSM Particles: Theory Meets Experiment UMass - 12-14 Nov 2015 Andrea Coccaro University of Geneva Andrea Coccaro 1 14 November, 2015 - Trigger Strategies for LLP Introduction

739 views • 28 slides
Fast Simulation of the Trigger System of the ATLAS Detector at LHC B. Epp, V.M. Ghete, D. Kuhn,

Fast Simulation of the Trigger System of the ATLAS Detector at LHC B. Epp, V.M. Ghete, D. Kuhn,

26. - 27 Sept. 2004 Weyer, Obersterreich Fast Simulation of the Trigger System of the ATLAS Detector at LHC B. Epp, V.M. Ghete, D. Kuhn, Y.J. Zhang Institute for Experimental Physics, University of Innsbruck, Austria 2004 2004

283 views • 12 slides
Higgs couplings in CMS in Run-2 Stephane Cooperstein (Princeton) on behalf of the CMS

Higgs couplings in CMS in Run-2 Stephane Cooperstein (Princeton) on behalf of the CMS

Higgs couplings in CMS in Run-2 Stephane Cooperstein (Princeton) on behalf of the CMS Collaboration 54th Rencontres de Moriond Electroweak unification and unified theories La Thuile, Italy, 16-23 March 2019 17/03/2019 S. Cooperstein

676 views • 43 slides

More recommend