checkable proofs for first order theorem proving
play

Checkable Proofs for First-Order Theorem Proving Giles Reger 1 , - PowerPoint PPT Presentation

Feb 12, 2023 •262 likes •567 views

Checkable Proofs for First-Order Theorem Proving Giles Reger 1 , Martin Suda 2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria ARCADE 2017 Gothenburg, August 6, 2017 1/8 Why do we want proofs? (explain

  1. Checkable Proofs for First-Order Theorem Proving Giles Reger 1 , Martin Suda 2 1 School of Computer Science, University of Manchester, UK 2 TU Wien, Vienna, Austria ARCADE 2017 – Gothenburg, August 6, 2017 1/8

  2. Why do we want proofs? (explain the result to humans) 1/8

  3. Why do we want proofs? (explain the result to humans) certify correctness increase confidence in the result debugging of the prover itself 1/8

  4. Why do we want proofs? (explain the result to humans) certify correctness increase confidence in the result debugging of the prover itself primary output to be further processed visualisation, interpolation, . . . combination of systems 1/8

  5. Why do we want proofs? (explain the result to humans) certify correctness increase confidence in the result debugging of the prover itself primary output to be further processed visualisation, interpolation, . . . combination of systems hammers = interactive theorem prover tactics employing an ATP 1/8

  6. Why do we want proofs? (explain the result to humans) certify correctness increase confidence in the result debugging of the prover itself primary output to be further processed visualisation, interpolation, . . . combination of systems hammers = interactive theorem prover tactics employing an ATP Automatically checkable / with formal semantics 1/8

  7. Current situation in the ATP world Thousands of Solutions from Theorem Provers TPTP syntax and fixed conventions 2/8

  8. Current situation in the ATP world Thousands of Solutions from Theorem Provers TPTP syntax and fixed conventions lack of formal semantics precludes reliable proof-checking 2/8

  9. Current situation in the ATP world Thousands of Solutions from Theorem Provers TPTP syntax and fixed conventions lack of formal semantics precludes reliable proof-checking proof reconstruction in hammers may fail for various reasons 2/8

  10. Current situation in the ATP world Thousands of Solutions from Theorem Provers TPTP syntax and fixed conventions lack of formal semantics precludes reliable proof-checking proof reconstruction in hammers may fail for various reasons Independent reproving of logical entailments is still very useful 2/8

  11. An ideal proof format 3/8

  12. An ideal proof format General accommodates all known techniques: superposition, InstGen, . . . 3/8

  13. An ideal proof format General accommodates all known techniques: superposition, InstGen, . . . Ideally “open-ended” = extendable 3/8

  14. An ideal proof format General accommodates all known techniques: superposition, InstGen, . . . Ideally “open-ended” = extendable Not just entailments preprocessing and “unsound” steps: Skolemization, naming, symmetry breaking, . . . 3/8

  15. An ideal proof format General accommodates all known techniques: superposition, InstGen, . . . Ideally “open-ended” = extendable Not just entailments preprocessing and “unsound” steps: Skolemization, naming, symmetry breaking, . . . Efficiency of checking ideally low order poly-time 3/8

  16. An ideal proof format General accommodates all known techniques: superposition, InstGen, . . . Ideally “open-ended” = extendable Not just entailments preprocessing and “unsound” steps: Skolemization, naming, symmetry breaking, . . . Efficiency of checking ideally low order poly-time Easy implementation and low runtime overhead 3/8

  17. An ideal proof format General accommodates all known techniques: superposition, InstGen, . . . Ideally “open-ended” = extendable Not just entailments preprocessing and “unsound” steps: Skolemization, naming, symmetry breaking, . . . Efficiency of checking ideally low order poly-time Easy implementation and low runtime overhead General adoption accepted by the community, supported by major tools 3/8

  18. Other communities: previous and related work 4/8

  19. Other communities: previous and related work DRAT propositional SAT surprisingly general / beyond entailment small set of rules / efficient checking 4/8

  20. Other communities: previous and related work DRAT propositional SAT surprisingly general / beyond entailment small set of rules / efficient checking CeTA termination community translation to higher-order formalism (Isabelle/HOL) extendable (IsaFoR library) efficient checking (via code generation support) 4/8

  21. Other communities: previous and related work DRAT propositional SAT surprisingly general / beyond entailment small set of rules / efficient checking CeTA termination community translation to higher-order formalism (Isabelle/HOL) extendable (IsaFoR library) efficient checking (via code generation support) Dedukti “A universal proof checker” target logic: λ Π -calculus modulo proof checker, translator already used to encode superposition and resolution 4/8

  22. What is happening at the SMT side? 5/8

  23. What is happening at the SMT side? LFSC [Stump et al.] LF ≈ λ Π -calculus SC = Side Conditions (small custom programming language) used by CVC4 5/8

  24. What is happening at the SMT side? LFSC [Stump et al.] LF ≈ λ Π -calculus SC = Side Conditions (small custom programming language) used by CVC4 A Flexible Proof Format for SMT [Besson et al. 11] syntax by the SMT-LIB 2.0 veriT framework for formula processing [CADE17] 5/8

  25. What is happening at the SMT side? LFSC [Stump et al.] LF ≈ λ Π -calculus SC = Side Conditions (small custom programming language) used by CVC4 A Flexible Proof Format for SMT [Besson et al. 11] syntax by the SMT-LIB 2.0 veriT framework for formula processing [CADE17] Proofs and refutations, and Z3 [de Moura & Bjørner 08] reports on memory overhead / performance slowdown proof reconstruction is challenging [Böhme 09] 5/8

  26. Is it a technical problem? Why don’t we have the nice proofs yet? [BMF15]: 1 low priority of the proof output effort amongst other development tasks, 2 differences of opinion on what features should be included in the standard, 3 and the overhead connected with switching from the currently adopted approach to a different one. 6/8

  27. Wrapping up Two kinds of obstacles: technical societal Which obstacle is bigger? 7/8

  28. Wrapping up Two kinds of obstacles: technical societal Which obstacle is bigger? Competitions help! — Common knowledge Could they help more? Should competitions require checkable proofs? Can ARCADE help? We need a community-led approach, you are the community. 7/8

  29. Soliciting expert opinion Q1 What are the main hurdles preventing us from having Checkable Proofs for First-Order Theorem Proving ? Q2 What should be the next steps to see this challenge realized in the near future? Q3 Is more research on the theoretical side needed, or are we simply struggling because too many people would need to agree on too many details and commit to the subsequently? 8/8

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

Projects. Probabilistically Checkable Proofs... Probabilistically Checkable Proofs Whats a

Projects. Probabilistically Checkable Proofs... Probabilistically Checkable Proofs Whats a

Projects. Probabilistically Checkable Proofs... Probabilistically Checkable Proofs Whats a proof? Statement: A formula is satisfiable. Proof: assignment, a . Property: 5 minute presentations. Can check proof in polynomial time. A real

401 views • 3 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
Instantiation-Based Automated Theorem Proving for First-Order Logic Konstantin Korovin The

Instantiation-Based Automated Theorem Proving for First-Order Logic Konstantin Korovin The

Instantiation-Based Automated Theorem Proving for First-Order Logic Konstantin Korovin The University of Manchester UK korovin@cs.man.ac.uk Theorem proving for first-order logic Theorem proving: Show that a given first-order formula is a

2.35k views • 193 slides
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
Locally Checkable Proofs Mika G o os & Jukka Suomela Helsinki Institute for Information

Locally Checkable Proofs Mika G o os & Jukka Suomela Helsinki Institute for Information

Locally Checkable Proofs Mika G o os & Jukka Suomela Helsinki Institute for Information Technology HIIT G o os, Suomela (HIIT) Locally Checkable Proofs 7th June 2011 1 / 15 Basic Question 1 What global information can we infer

727 views • 39 slides
First-Order Theorem Proving and Vampire Laura Kov acs (Chalmers University of Technology)

First-Order Theorem Proving and Vampire Laura Kov acs (Chalmers University of Technology)

First-Order Theorem Proving and Vampire Laura Kov acs (Chalmers University of Technology) Andrei Voronkov (The University of Manchester) Outline Introduction First-Order Logic and TPTP Inference Systems Saturation Algorithms Redundancy

1.98k views • 186 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
Implementation of Lambda-Free Higher-Order Superposition Petar Vukmirovi Automatic theorem

Implementation of Lambda-Free Higher-Order Superposition Petar Vukmirovi Automatic theorem

Implementation of Lambda-Free Higher-Order Superposition Petar Vukmirovi Automatic theorem proving state of the art FOL HOL 2 Automatic theorem proving challenge HOL High-performance higher-order theorem prover that extends

910 views • 47 slides
Comparing Unification Algorithms in First-Order Theorem Proving Krytof Hoder, Andrei Voronkov

Comparing Unification Algorithms in First-Order Theorem Proving Krytof Hoder, Andrei Voronkov

Comparing Unification Algorithms in First-Order Theorem Proving Krytof Hoder, Andrei Voronkov University of Manchester Saturation-based Theorem Provers Try to find a contradiction by generating new clauses according to a set of rules A

208 views • 18 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
Automated Theorem Proving in First-Order and Higher-Order Logic Christoph Benzm uller

Automated Theorem Proving in First-Order and Higher-Order Logic Christoph Benzm uller

Automated Theorem Proving in First-Order and Higher-Order Logic Christoph Benzm uller Department of Computer Science, Saarland University Lecture Course Saarbr ucken, Germany Lecture Course c Benzm uller 2004 Module

294 views • 8 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
Interactive and Automatic Theorem Proving in the First Order Theory of Combinators Ana Bove 1 ,

Interactive and Automatic Theorem Proving in the First Order Theory of Combinators Ana Bove 1 ,

Introduction Agda as LF for FOL FOTC Mirror ABP FOTC vs DTP Interactive and Automatic Theorem Proving in the First Order Theory of Combinators Ana Bove 1 , Peter Dybjer 1 , Andrs Sicard-Ramrez 2 1 Chalmers tekniska hgskola, Gteborg,

574 views • 36 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
Large Scale Deep Learning for Theorem Proving in HOList: First Results and Future Directions

Large Scale Deep Learning for Theorem Proving in HOList: First Results and Future Directions

Large Scale Deep Learning for Theorem Proving in HOList: First Results and Future Directions Sarah Loos HOList An Environment for Machine Learning of Higher-Order Theorem Proving HOList provides a simple API for ML researchers and theorem

307 views • 28 slides
APPG Energy Studies Briefing Neil Kenward 9 June 2020 The UK has made good progress to date,

APPG Energy Studies Briefing Neil Kenward 9 June 2020 The UK has made good progress to date,

Ofgems role in decarbonisation APPG Energy Studies Briefing Neil Kenward 9 June 2020 The UK has made good progress to date, especially in decarbonising power. Net zero represents a step change in ambition and challenge The UK has reduced

476 views • 8 slides
Generalization of Cycle-Covering Heuristics Clemens B uchner Department of Mathematics and

Generalization of Cycle-Covering Heuristics Clemens B uchner Department of Mathematics and

Generalization of Cycle-Covering Heuristics Masters Thesis Presentation Generalization of Cycle-Covering Heuristics Clemens B uchner Department of Mathematics and Computer Science University of Basel May 14, 2020 Generalization of

877 views • 54 slides
Parsing OSM XML iD OSMCha To-Fix Frontend Developer kepta kushan2020 Breaking down iD

Parsing OSM XML iD OSMCha To-Fix Frontend Developer kepta kushan2020 Breaking down iD

Parsing OSM XML iD OSMCha To-Fix Frontend Developer kepta kushan2020 Breaking down iD Breaking down iD 15% Rendering Painting 21% Javascript 64% HTML A sample of what iD is doing behind the scenes Breaking down JS 13% Draw Vector

426 views • 27 slides
CS533 One or more systems, real or hypothetical Modeling and Performance You want to

CS533 One or more systems, real or hypothetical Modeling and Performance You want to

Overview CS533 One or more systems, real or hypothetical Modeling and Performance You want to evaluate their performance Evaluation of Network and What technique do you choose? Computer Systems Analytic Modeling?

79 views • 6 slides
A Self-Verifying Theorem Prover Jared Davis (advertisement by J Strother Moore)

A Self-Verifying Theorem Prover Jared Davis (advertisement by J Strother Moore)

A Self-Verifying Theorem Prover Jared Davis (advertisement by J Strother Moore) Department of Computer Sciences University of Texas at Austin September 18, 2009 1 Theorem Prover ? Yes Proof Checker Yes No 2 Rules of

693 views • 40 slides
Delegation with (nearly) optimal time/space overhead Justin Holmgren Ron Rothblum MIT MIT

Delegation with (nearly) optimal time/space overhead Justin Holmgren Ron Rothblum MIT MIT

Delegation with (nearly) optimal time/space overhead Justin Holmgren Ron Rothblum MIT MIT Verifiable Computation Verifiable Computation Verifiable Computation M(x)=? M(x) = y Verifiable Computation M(x)=? , challenge , proof

1.73k views • 119 slides
Foundational Proof Certificates Making proof universal and permanent Dale Miller INRIA-Saclay

Foundational Proof Certificates Making proof universal and permanent Dale Miller INRIA-Saclay

Foundational Proof Certificates Making proof universal and permanent Dale Miller INRIA-Saclay & LIX, Ecole Polytechnique 23 September 2013 Can we standardize, communicate, and trust formal proofs? Joint work with Zakaria Chihani and

864 views • 37 slides
Practical Proof Systems for SAT and QBF Marijn J.H. Heule Dagstuhl Seminar on SAT and

Practical Proof Systems for SAT and QBF Marijn J.H. Heule Dagstuhl Seminar on SAT and

Practical Proof Systems for SAT and QBF Marijn J.H. Heule Dagstuhl Seminar on SAT and Interactions September 20, 2016 1/47 Introduction to SAT and QBF Proof Checking Clausal Proof Systems for SAT and QBF Abstract Proof System for SAT

924 views • 67 slides

More recommend