Polarized Rewriting and Tableaux in B Set Theory
|
|
|
- Tabitha Rodgers
- 5 years ago
- Views:
Transcription
1 Polarized Rewriting and Tableaux in B Set Theory SETS 2018 Olivier Hermant CRI, MINES ParisTech, PSL Research University June 5, 2018 O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
2 Introduction Assumes familiarity with FOL Tableaux method Extension with rewriting : Tableaux Modulo Theory Implementation and benchmark : Zenon Modulo and B Set theory Proposed extension : polarized rewriting Discussions O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
3 Tableaux Method F, F F F α F G α F, G (F G) α F, G (F G) α F, G F G β F G (F G) β F G F G β F G x F(x) δ F(c) x F(x) δ F(c) x F(x) γ F(t) x F(x) γ F(t) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
4 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
5 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) y A Y ( z z A z Y) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
6 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) y A Y ( z z A z Y) A A ( z z A z A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
7 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) y A Y ( z z A z Y) A A ( z z A z A) α ( z z A z A) A A, A A ( z z A z A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
8 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) y A Y ( z z A z Y) A A ( z z A z A) α ( z z A z A) A A, A A ( z z A z A) β A A z (z A z A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
9 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) β A A y A Y ( z z A z Y) A A ( z z A z A) α ( z z A z A) A A, A A ( z z A z A) z (z A z A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
10 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) β A A y A Y ( z z A z Y) A A ( z z A z A) α ( z z A z A) A A, A A ( z z A z A) z (z A z A) δ (c A c A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
11 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) β A A y A Y ( z z A z Y) A A ( z z A z A) α ( z z A z A) A A, A A ( z z A z A) z (z A z A) δ (c A c A) α c A, (c A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
12 Example : Inclusion we want to show A A, for a given set A axiomatization of inclusion is X Y X Y ( z z X z Y) we shall refute X Y X Y ( z z X z Y), (A A) the proof : X Y X Y ( z z X z Y), (A A) β A A y A Y ( z z A z Y) A A ( z z A z A) α ( z z A z A) A A, A A ( z z A z A) z (z A z A) δ (c A c A) α c A, (c A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
13 term rewrite rule : a a Deduction Modulo Theory Rewrite Rule A term (resp. proposition) rewrite rule is a pair of terms (resp. formulæ) l r, where F V(l) F V(r) and, in the propositiona case, l is atomic. Examples : proposition rewrite rule : a b x x a x b Conversion modulo a Rewrite System We consider the congruence generated by a set of proposition rewrite rules R and a set of term rewrite rules E (often implicit). Forward-only rewriting is denoted. Example : A A x x A x A O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
14 Tableaux Modulo Theory two flavors, essentially equivalent add a conversion rule : F (Conv), if F G G or integrate conversion inside each rule : H F, G α, if H F G O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
15 Example : Inclusion delete the axiom X Y (X Y z z X z Y) replace with the rewrite rule X Y z z X z Y we now refute only (A A) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
16 Example : Inclusion delete the axiom X Y (X Y z z X z Y) replace with the rewrite rule X Y z z X z Y we now refute only (A A) yields (A A) (Conv) ( z z A z A) α (c A c A) α (c A), c A O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
17 Expressing B Set Theory with Rewriting for power set and comprehension s P(t) x (x s x t) x {z P(z)} P(x) derived constructs with typing, too s set(α) P α (t) x : α (x α s x α t) O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
18 Zenon Zenon : classical first-order tableaux-based ATP Extended to ML polymorphism Extended to Deduction Modulo Theory Extended to linear arithmetic Reads TPTP input format Dedukti certificates work of P. Halmagrand, G. Bury O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
19 Zenon Zenon : classical first-order tableaux-based ATP Extended to ML polymorphism Extended to Deduction Modulo Theory Extended to linear arithmetic Reads TPTP input format Dedukti certificates work of P. Halmagrand, G. Bury We propose to extend it to Polarized Deduction Modulo Theory O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
20 Benchmarks A set of Proof Obligations Provided by Industrial Partners PO Provable : proved in Atelier B (automatically or interactively) Wide spectrum Mild difficulty, large files O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
21 Zenon results All Tools (98,9%) mp Zenon Zenon Zenon Zenon Zenon Types Arith Modulo Mod+Ari % 85% 2% 48% 57% 80% 95% Time (s) - 6,9 2,3 2,5 3,0 2,6 Unique Protocol Processor Intel Xeon E v2 Timeout 120 s Memory 1 GiB O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
22 Polarized Rewriting asymetry rewrite positive formulas a certain way rewrite negative formulas another way interchangeable : F G iff F + G let R+ and R be two sets of rewrite rules Polarized Rewriting F + G is there exists a positive (resp. negative) occurrence H in F, a substitution σ, and a rule l r R + (resp. R ), such that H = lσ and G is F where H has been replaced with rσ. O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
23 Tableaux Modulo Polarized Theory tableaux is one-sided, we need only positive rewriting add to first-order tableau, the conversion rule F +, if F + G G notice forward rewriting only O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
24 Example : Inclusion delete the axiom X Y (X Y z z X z Y) replace it with two rewrite rules X Y + ( z z X z Y), X Y (f(x, Y) X f(x, Y) Y) f is a fresh symbol (Skolem symbol) negative quantifiers can be Skolemized! impossible in Deduction Modulo Theory : unpolarized rewriting here positive rewriting applied in positive contexts, negative in negative contexts pre-apply δ and δ : Skolemize O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
25 Example : Inclusion delete the axiom X Y (X Y z z X z Y) replace it with two rewrite rules X Y + ( z z X z Y), X Y (f(x, Y) X f(x, Y) Y) f is a fresh symbol (Skolem symbol) negative quantifiers can be Skolemized! impossible in Deduction Modulo Theory : unpolarized rewriting here positive rewriting applied in positive contexts, negative in negative contexts pre-apply δ and δ : Skolemize the proof becomes (A A) (f(a, A) A f(a, A) A) α (f(a, A) A), f(a, A) A O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
26 Advantages Skolemization of the rules = a single Skolem symbol instead of a fresh one for each δ-rule, even if the formula is the same fixable with ɛ-hilbert operator? Skolemization at pre-processing, once and for all more axioms become rewrite rules Deduction Modulo Theory, sole shape x(p F) Polarization allows two more shapes x(p F) turned into P + F x(f P) turned into P F x(p F) subsumed O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
27 Issues Deciding rewriting in Deduction Modulo Theory : strongly needs non confusion if F G, then they have the same main connective needs confluence if F G, then there is H such that F H G allows to have a simpler additional tableaux rule F (Conv), if F G G termination of rewriting helps, too the more rules, the more potential troubles needs proper study (and definitions!) Completeness not implied by confluence and termination e.g. requires narrowing we do not care much, except for nice theoretical results performance is more important O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
28 Issues Deciding rewriting in Deduction Modulo Theory : strongly needs non confusion if F G, then they have the same main connective needs confluence if F G, then there is H such that F H G allows to have a simpler additional tableaux rule F (Conv), if F G G termination of rewriting helps, too the more rules, the more potential troubles needs proper study (and definitions!) Completeness not implied by confluence and termination e.g. requires narrowing we do not care much, except for nice theoretical results performance is more important O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
29 Conclusion implement and test theory can come later except soundness develop proper notions of confluence, cut elimination, models, etc. which Skolemization? O. Hermant (MINES ParisTech) Polarized Tableaux Modulo in B June 5, / 17
Dedukti: a Logical Framework based on the λπ-calculus Modulo Theory
Dedukti: a Logical Framework based on the λπ-calculus Modulo Theory Ali Assaf 1, Guillaume Burel 2, Raphaël Cauderlier 3, David Delahaye 4, Gilles Dowek 5, Catherine Dubois 2, Frédéric Gilbert 6, Pierre
The Typed λ Calculus and Type Inferencing in ML
Notes on Types S. Arun-Kumar Department of Computer Science and Engineering Indian Institute of Technology New Delhi, 110016 email: sak@cse.iitd.ernet.in April 14, 2002 2 Chapter 1 The Typed λ Calculus
Basic Foundations of Isabelle/HOL
Basic Foundations of Isabelle/HOL Peter Wullinger May 16th 2007 1 / 29 1 Introduction into Isabelle s HOL Why Type Theory Basic Type Syntax 2 More HOL Typed λ Calculus HOL Rules 3 Example proof 2 / 29
Toward explicit rewrite rules in the λπ-calculus modulo
Toward explicit rewrite rules in the λπ-calculus modulo Ronan Saillard (Olivier Hermant) Deducteam INRIA MINES ParisTech December 14th, 2013 1 / 29 Motivation Problem Checking, in a trustful way, that
Typed Lambda Calculus for Syntacticians
Department of Linguistics Ohio State University January 12, 2012 The Two Sides of Typed Lambda Calculus A typed lambda calculus (TLC) can be viewed in two complementary ways: model-theoretically, as a
3.4 Deduction and Evaluation: Tools Conditional-Equational Logic
3.4 Deduction and Evaluation: Tools 3.4.1 Conditional-Equational Logic The general definition of a formal specification from above was based on the existence of a precisely defined semantics for the syntax
A Logic of Proofs for Differential Dynamic Logic
1 A Logic of Proofs for Differential Dynamic Logic Toward Independently Checkable Proof Certificates for Differential Dynamic Logic Nathan Fulton Andrè Platzer Carnegie Mellon University CPP 16 February
DPLL(Γ+T): a new style of reasoning for program checking
DPLL(Γ+T ): a new style of reasoning for program checking Dipartimento di Informatica Università degli Studi di Verona Verona, Italy June, 2011 Motivation: reasoning for program checking Program checking
Typed Lambda Calculus
Department of Linguistics Ohio State University Sept. 8, 2016 The Two Sides of A typed lambda calculus (TLC) can be viewed in two complementary ways: model-theoretically, as a system of notation for functions
Lecture 17: Continuous Functions
Lecture 17: Continuous Functions 1 Continuous Functions Let (X, T X ) and (Y, T Y ) be topological spaces. Definition 1.1 (Continuous Function). A function f : X Y is said to be continuous if the inverse
Linear Clause Generation by Tableaux and DAGs
kovasznai 2007/8/10 11:27 page 109 #1 5/1 (2007), 109 118 tmcs@inf.unideb.hu http://tmcs.math.klte.hu Linear Clause Generation by Tableaux and DAGs Gergely Kovásznai Abstract. Clause generation is a preliminary
Improving Coq Propositional Reasoning Using a Lazy CNF Conversion
Using a Lazy CNF Conversion Stéphane Lescuyer Sylvain Conchon Université Paris-Sud / CNRS / INRIA Saclay Île-de-France FroCoS 09 Trento 18/09/2009 Outline 1 Motivation and background Verifying an SMT solver
Isabelle/HOL:Selected Features and Recent Improvements
/: Selected Features and Recent Improvements webertj@in.tum.de Security of Systems Group, Radboud University Nijmegen February 20, 2007 /:Selected Features and Recent Improvements 1 2 Logic User Interface
Standard Boolean Forms
Standard Boolean Forms In this section, we develop the idea of standard forms of Boolean expressions. In part, these forms are based on some standard Boolean simplification rules. Standard forms are either
Knowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
Introduction to the Lambda Calculus. Chris Lomont
Introduction to the Lambda Calculus Chris Lomont 2010 2011 2012 www.lomont.org Leibniz (1646-1716) Create a universal language in which all possible problems can be stated Find a decision method to solve
Solving Quantified Verification Conditions using Satisfiability Modulo Theories
Solving Quantified Verification Conditions using Satisfiability Modulo Theories Yeting Ge 1, Clark Barrett 1, and Cesare Tinelli 2 1 New York University, yeting barrett@cs.nyu.edu 2 The University of Iowa,
Instantiation Schemes for Nested Theories
0 Instantiation Schemes for Nested Theories MNACHO ECHENIM, Grenoble INP-Ensimag/Laboratory of Informatics of Grenoble NICOLAS PELTIER, CNRS/Laboratory of Informatics of Grenoble This paper investigates
Lost in translation. Leonardo de Moura Microsoft Research. how easy problems become hard due to bad encodings. Vampire Workshop 2015
Lost in translation how easy problems become hard due to bad encodings Vampire Workshop 2015 Leonardo de Moura Microsoft Research I wanted to give the following talk http://leanprover.github.io/ Automated
Module 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur
Module 6 Knowledge Representation and Logic (First Order Logic) 6.1 Instructional Objective Students should understand the advantages of first order logic as a knowledge representation language Students
Lecture 17 of 41. Clausal (Conjunctive Normal) Form and Resolution Techniques
Lecture 17 of 41 Clausal (Conjunctive Normal) Form and Resolution Techniques Wednesday, 29 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Chapter 9,
Integration of SMT Solvers with ITPs There and Back Again
Integration of SMT Solvers with ITPs There and Back Again Sascha Böhme and University of Sheffield 7 May 2010 1 2 Features: SMT-LIB vs. Yices Translation Techniques Caveats 3 4 Motivation Motivation System
An LCF-Style Interface between HOL and First-Order Logic
An LCF-Style Interface between HOL and First-Order Logic Joe Hurd Computer Laboratory University of Cambridge, joe.hurd@cl.cam.ac.uk 1 Introduction Performing interactive proof in the HOL theorem prover
Module 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur
Module 6 Knowledge Representation and Logic (First Order Logic) Lesson 15 Inference in FOL - I 6.2.8 Resolution We have introduced the inference rule Modus Ponens. Now we introduce another inference rule
KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems
KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems Nathan Fulton, Stefan Mitsch, Jan-David Quesel, Marcus Völp, André Platzer Presented at CADE-25 August 9, 2015 Milieu Safety-critical
Higher-Order Logic. Specification and Verification with Higher-Order Logic
Higher-Order Logic Specification and Verification with Higher-Order Logic Arnd Poetzsch-Heffter (Slides by Jens Brandt) Software Technology Group Fachbereich Informatik Technische Universität Kaiserslautern
Foundations of AI. 9. Predicate Logic. Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution
Foundations of AI 9. Predicate Logic Syntax and Semantics, Normal Forms, Herbrand Expansion, Resolution Wolfram Burgard, Andreas Karwath, Bernhard Nebel, and Martin Riedmiller 09/1 Contents Motivation
Revisiting Kalmar completeness metaproof
Revisiting Kalmar completeness metaproof Angélica Olvera Badillo 1 Universidad de las Américas, Sta. Catarina Mártir, Cholula, Puebla, 72820 México angelica.olverabo@udlap.mx Abstract In this paper, I
Decision Procedures for Recursive Data Structures with Integer Constraints
Decision Procedures for Recursive Data Structures with Ting Zhang, Henny B Sipma, Zohar Manna Stanford University tingz,sipma,zm@csstanfordedu STeP Group, June 29, 2004 IJCAR 2004 - p 1/31 Outline Outline
Chapter 3 Complexity of Classical Planning
Lecture slides for Automated Planning: Theory and Practice Chapter 3 Complexity of Classical Planning Dana S. Nau CMSC 722, AI Planning University of Maryland, Spring 2008 Licensed under the Creative Commons
Formal Predicate Calculus. Michael Meyling
Formal Predicate Calculus Michael Meyling May 24, 2013 2 The source for this document can be found here: http://www.qedeq.org/0_04_07/doc/math/qedeq_formal_logic_v1.xml Copyright by the authors. All rights
Overview. CS389L: Automated Logical Reasoning. Lecture 6: First Order Logic Syntax and Semantics. Constants in First-Order Logic.
Overview CS389L: Automated Logical Reasoning Lecture 6: First Order Logic Syntax and Semantics Işıl Dillig So far: Automated reasoning in propositional logic. Propositional logic is simple and easy to
Encoding TLA + set theory into many-sorted first-order logic
Encoding TLA + set theory into many-sorted first-order logic Stephan Merz and Hernán Vanzetto Inria, Villers-lès-Nancy, F-54600, France Université de Lorraine, LORIA, UMR 7503, Vandoeuvre-lès-Nancy, F-54506,
HOL DEFINING HIGHER ORDER LOGIC LAST TIME ON HOL CONTENT. Slide 3. Slide 1. Slide 4. Slide 2 WHAT IS HIGHER ORDER LOGIC? 2 LAST TIME ON HOL 1
LAST TIME ON HOL Proof rules for propositional and predicate logic Safe and unsafe rules NICTA Advanced Course Forward Proof Slide 1 Theorem Proving Principles, Techniques, Applications Slide 3 The Epsilon
arxiv:cs/ v1 [cs.db] 29 Nov 2002
![arxiv:cs/ v1 [cs.db] 29 Nov 2002](/thumbs/93/111598071.jpg "arxiv:cs/ v1 [cs.db] 29 Nov 2002")
Database Repairs and Analytic Tableaux Leopoldo Bertossi 1 and Camilla Schwind 2 arxiv:cs/0211042v1 [cs.db] 29 Nov 2002 1 Carleton University School of Computer Science Ottawa, Canada K1S 5B6 bertossi@scs.carleton.ca
Lecture 5 - Axiomatic semantics
Program Verification March 2014 Lecture 5 - Axiomatic semantics Lecturer: Noam Rinetzky Scribes by: Nir Hemed 1.1 Axiomatic semantics The development of the theory is contributed to Robert Floyd, C.A.R
Lecture 7: Counting classes
princeton university cos 522: computational complexity Lecture 7: Counting classes Lecturer: Sanjeev Arora Scribe:Manoj First we define a few interesting problems: Given a boolean function φ, #SAT is the
Numerical Computations and Formal Methods
Program verification Formal arithmetic Decision procedures Proval, Laboratoire de Recherche en Informatique INRIA Saclay IdF, Université Paris Sud, CNRS October 28, 2009 Program verification Formal arithmetic
Encryption as an Abstract Datatype:
June 2003 1/18 Outline Encryption as an Abstract Datatype: an extended abstract Dale Miller INRIA/Futurs/Saclay and École polytechnique 1. Security protocols specified using multisets rewriting. 2. Eigenvariables
Calculus of Inductive Constructions
Calculus of Inductive Constructions Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) Calculus of Inductive Constructions
Leonardo de Moura and Nikolaj Bjorner Microsoft Research
Leonardo de Moura and Nikolaj Bjorner Microsoft Research A Satisfiability Checker with built-in support for useful theories Z3 is a solver developed at Microsoft Research. Development/Research driven by
A computer implemented philosophy of mathematics
A computer implemented philosophy of mathematics M. Randall Holmes May 14, 2018 This paper presents a philosophical view of the basic foundations of mathematics, which is implemented in actual computer
LINEAR LOGIC AS A FRAMEWORK FOR SPECIFYING SEQUENT CALCULUS
LINEAR LOGIC AS A FRAMEWORK FOR SPECIFYING SEQUENT CALCULUS DALE MILLER AND ELAINE PIMENTEL Abstract In recent years, intuitionistic logic and type systems have been used in numerous computational systems
Lambda Logic. Michael Beeson. San José State University, San Jose, CA, USA. Abstract
Michael Beeson San José State University, San Jose, CA, USA Abstract Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions
Principles of AI Planning. Principles of AI Planning. 7.1 How to obtain a heuristic. 7.2 Relaxed planning tasks. 7.1 How to obtain a heuristic
Principles of AI Planning June 8th, 2010 7. Planning as search: relaxed planning tasks Principles of AI Planning 7. Planning as search: relaxed planning tasks Malte Helmert and Bernhard Nebel 7.1 How to
Quantifier-Free Equational Logic and Prime Implicate Generation
Quantifier-Free Equational Logic and Prime Implicate Generation Mnacho Echenim 1,2, Nicolas Peltier 1,4 and Sophie Tourret 1,3 1 Grenoble Informatics Laboratory 2 Grenoble INP - Ensimag 3 Université Grenoble
Formally Certified Satisfiability Solving
SAT/SMT Proof Checking Verifying SAT Solver Code Future Work Computer Science, The University of Iowa, USA April 23, 2012 Seoul National University SAT/SMT Proof Checking Verifying SAT Solver Code Future
Computation Club: Gödel s theorem
Computation Club: Gödel s theorem The big picture mathematicians do a lot of reasoning and write a lot of proofs formal systems try to capture the ideas of reasoning and proof in a purely mechanical set
Algebraic Processors
Algebraic Processors Algebraic Processors By Pouya Larjani, B.Sc. A Thesis Submitted to the School of Graduate Studies in partial fulfilment of the requirements for the degree of Master of Science Department
What if current foundations of mathematics are inconsistent? Vladimir Voevodsky September 25, 2010
What if current foundations of mathematics are inconsistent? Vladimir Voevodsky September 25, 2010 1 Goedel s second incompleteness theorem Theorem (Goedel) It is impossible to prove the consistency of
Evaluation Trees for Proposition Algebra
Evaluation Trees for Proposition Algebra Alban Ponse joined work with Jan A. Bergstra section Theory of Computer Science Informatics Institute, University of Amsterdam https://staff.fnwi.uva.nl/a.ponse/
Automatic Reasoning (Section 8.3)
Automatic Reasoning (Section 8.3) Automatic Reasoning Can reasoning be automated? Yes, for some logics, including first-order logic. We could try to automate natural deduction, but there are many proof
Refutation-Based Synthesis in SMT
Noname manuscript No. (will be inserted by the editor) Refutation-Based Synthesis in SMT Andrew Reynolds Viktor Kuncak Cesare Tinelli Clark Barrett Morgan Deters Received: date / Accepted: date Abstract
Knowledge Representation and Reasoning Logics for Artificial Intelligence
Knowledge Representation and Reasoning Logics for Artificial Intelligence Stuart C. Shapiro Department of Computer Science and Engineering and Center for Cognitive Science University at Buffalo, The State
Introduction to Parameterized Complexity
Introduction to Parameterized Complexity M. Pouly Department of Informatics University of Fribourg, Switzerland Internal Seminar June 2006 Outline Introduction & Motivation The Misery of Dr. O The Perspective
Problem Libraries for Non-Classical Logics
EPiC Series in Computer Science Volume 33, 2015, Pages 31 36 ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics Problem Libraries for Non-Classical Logics Jens Otten and Thomas Raths Institut
An Evolution of Mathematical Tools
An Evolution of Mathematical Tools From Conceptualization to Formalization Here's what we do when we build a formal model (or do a computation): 0. Identify a collection of objects/events in the real world.
Lambda Calculus and Type Inference
Lambda Calculus and Type Inference Björn Lisper Dept. of Computer Science and Engineering Mälardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/ blr/ August 17, 2007 Lambda Calculus and Type
Types Summer School Gothenburg Sweden August Dogma oftype Theory. Everything has a type
Types Summer School Gothenburg Sweden August 2005 Formalising Mathematics in Type Theory Herman Geuvers Radboud University Nijmegen, NL Dogma oftype Theory Everything has a type M:A Types are a bit like
From Types to Sets in Isabelle/HOL
From Types to Sets in Isabelle/HOL Extented Abstract Ondřej Kunčar 1 and Andrei Popescu 1,2 1 Fakultät für Informatik, Technische Universität München, Germany 2 Institute of Mathematics Simion Stoilow
Activity. CSCI 334: Principles of Programming Languages. Lecture 4: Fundamentals II. What is computable? What is computable?
Activity CSCI 334: Principles of Programming Languages Lecture 4: Fundamentals II Write a function firsts that, when given a list of cons cells, returns a list of the left element of each cons. ( (a. b)
Typed First-order Logic
22c181: Formal Methods in Software Engineering The University of Iowa Spring 2008 Typed First-order Logic Copyright 2007-8 Reiner Hähnle and Cesare Tinelli. Notes originally developed by Reiner Hähnle
in this web service Cambridge University Press
978-0-51-85748- - Switching and Finite Automata Theory, Third Edition Part 1 Preliminaries 978-0-51-85748- - Switching and Finite Automata Theory, Third Edition CHAPTER 1 Number systems and codes This
Logical Verification Course Notes. Femke van Raamsdonk Vrije Universiteit Amsterdam
Logical Verification Course Notes Femke van Raamsdonk femke@csvunl Vrije Universiteit Amsterdam autumn 2008 Contents 1 1st-order propositional logic 3 11 Formulas 3 12 Natural deduction for intuitionistic
THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.
THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of
Propositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
Towards a Logical Reconstruction of Relational Database Theory
Towards a Logical Reconstruction of Relational Database Theory On Conceptual Modelling, Lecture Notes in Computer Science. 1984 Raymond Reiter Summary by C. Rey November 27, 2008-1 / 63 Foreword DB: 2
Introduction to Axiomatic Semantics
Introduction to Axiomatic Semantics Meeting 10, CSCI 5535, Spring 2009 Announcements Homework 3 due tonight Homework 2 is graded 13 (mean), 14 (median), out of 21 total, but Graduate class: final project
Embedding logics in Dedukti
1 INRIA, 2 Ecole Polytechnique, 3 ENSIIE/Cedric Embedding logics in Dedukti Ali Assaf 12, Guillaume Burel 3 April 12, 2013 Ali Assaf, Guillaume Burel: Embedding logics in Dedukti, 1 Outline Introduction
MA513: Formal Languages and Automata Theory Topic: Context-free Grammars (CFG) Lecture Number 18 Date: September 12, 2011
MA53: Formal Languages and Automata Theory Topic: Context-free Grammars (CFG) Lecture Number 8 Date: September 2, 20 xercise: Define a context-free grammar that represents (a simplification of) expressions
COMP 4161 NICTA Advanced Course. Advanced Topics in Software Verification. Toby Murray, June Andronick, Gerwin Klein
COMP 4161 NICTA Advanced Course Advanced Topics in Software Verification Toby Murray, June Andronick, Gerwin Klein λ 1 Last time... λ calculus syntax free variables, substitution β reduction α and η conversion
Formally Optimal Boxing
Formally Optimal Boxing Fritz Henglein & Jesper Jørgensen DIKU, Department of Computer Science University of Copenhagen, Universitetsparken 1 DK-2100 Copenhagen Ø Denmark e-mail: henglein@diku.dk & knud@diku.dk
A Semantic Framework for Proof Evidence
A Semantic Framework for Proof Evidence Zakaria Chihani, Dale Miller, Fabien Renaud To cite this version: Zakaria Chihani, Dale Miller, Fabien Renaud. A Semantic Framework for Proof Evidence. Journal of
Automated Reasoning. Natural Deduction in First-Order Logic
Automated Reasoning Natural Deduction in First-Order Logic Jacques Fleuriot Automated Reasoning Lecture 4, page 1 Problem Consider the following problem: Every person has a heart. George Bush is a person.
Lecture 4: January 12, 2015
32002: AI (First Order Predicate Logic, Interpretation and Inferences) Spring 2015 Lecturer: K.R. Chowdhary Lecture 4: January 12, 2015 : Professor of CS (VF) Disclaimer: These notes have not been subjected
Programming Languages and Compilers (CS 421)
Programming Languages and Compilers (CS 421) Elsa L Gunter 2112 SC, UIUC http://courses.engr.illinois.edu/cs421 Based in part on slides by Mattox Beckman, as updated by Vikram Adve and Gul Agha 10/3/17
Computer-supported Modeling and Reasoning. First-Order Logic. 1 More on Isabelle. 1.1 Isabelle System Architecture
Dipl-Inf Achim D Brucker Dr Burkhart Wolff Computer-supported Modeling and easoning http://wwwinfsecethzch/ education/permanent/csmr/ (rev 16814) Submission date: First-Order Logic In this lecture you
CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter p. 1/27
CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer Science (Arkoudas and Musser) Chapter 2.1-2.7 p. 1/27 CSCI.6962/4962 Software Verification Fundamental Proof Methods in Computer
Hw 4 Due Feb 22. D(fg) x y z (
Hw 4 Due Feb 22 2.2 Exercise 7,8,10,12,15,18,28,35,36,46 2.3 Exercise 3,11,39,40,47(b) 2.4 Exercise 6,7 Use both the direct method and product rule to calculate where f(x, y, z) = 3x, g(x, y, z) = ( 1
PRocH: Proof Reconstruction for HOL Light
PRocH: Proof Reconstruction for HOL Light Cezary Kaliszyk and Josef Urban 1 University of Innsbruck, Austria 2 Radboud University Nijmegen Abstract. PRocH 3 is a proof reconstruction tool that imports
Blocked Clauses in First-Order Logic
EPiC Series in Computing Volume 46, 2017, Pages 31 48 LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning Blocked Clauses in First-Order Logic Benjamin
Encoding First Order Proofs in SMT
Encoding First Order Proofs in SMT Jeremy Bongio Cyrus Katrak Hai Lin Christopher Lynch Ralph Eric McGregor June 4, 2007 Abstract We present a method for encoding first order proofs in SMT. Our implementation,
Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005
Course notes for Data Compression - 2 Kolmogorov complexity Fall 2005 Peter Bro Miltersen September 29, 2005 Version 2.0 1 Kolmogorov Complexity In this section, we present the concept of Kolmogorov Complexity
2. Metric and Topological Spaces
2 Metric and Topological Spaces Topology begins where sets are implemented with some cohesive properties enabling one to define continuity Solomon Lefschetz In order to forge a language of continuity,
Solutions to Exercises
TDDC36 (LOGIC): EXAM Solutions to Exercises EXERCISE 1 1. Prove the following propositional formula: [ ( P Q) (P Q) R ] [ Q R ] (a) (2 points) using tableaux (b) (2 points) using Gentzen system (as provided
Logic and its Applications
Logic and its Applications Edmund Burke and Eric Foxley PRENTICE HALL London New York Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Contents Preface xiii Propositional logic 1 1.1 Informal introduction
Geometric Queries for Ray Tracing
CSCI 420 Computer Graphics Lecture 16 Geometric Queries for Ray Tracing Ray-Surface Intersection Barycentric Coordinates [Angel Ch. 11] Jernej Barbic University of Southern California 1 Ray-Surface Intersections
Proving Theorems with Athena
Proving Theorems with Athena David R. Musser Aytekin Vargun August 28, 2003, revised January 26, 2005 Contents 1 Introduction 1 2 Proofs about order relations 2 3 Proofs about natural numbers 7 3.1 Term
Unification in Maude. Steven Eker
Unification in Maude Steven Eker 1 Unification Unification is essentially solving equations in an abstract setting. Given a signature Σ, variables X and terms t 1, t 2 T (Σ) we want to find substitutions
Rewriting. Andreas Rümpel Faculty of Computer Science Technische Universität Dresden Dresden, Germany.
Rewriting Andreas Rümpel Faculty of Computer Science Technische Universität Dresden Dresden, Germany s9843882@inf.tu-dresden.de ABSTRACT This is an overview paper regarding the common technologies of rewriting.
Evolving model evolution
University of Iowa Iowa Research Online Theses and Dissertations Fall 2009 Evolving model evolution Alexander Fuchs University of Iowa Copyright 2009 Alexander Fuchs This dissertation is available at Iowa
Lecture Notes on Real-world SMT
15-414: Bug Catching: Automated Program Verification Lecture Notes on Real-world SMT Matt Fredrikson Ruben Martins Carnegie Mellon University Lecture 15 1 Introduction In the previous lecture we studied
The semantics of a programming language is concerned with the meaning of programs, that is, how programs behave when executed on computers.
Semantics The semantics of a programming language is concerned with the meaning of programs, that is, how programs behave when executed on computers. The semantics of a programming language assigns a precise
Towards certification of TLA + proof obligations with SMT solvers
Towards certification of TLA + proof obligations with SMT solvers Stephan Merz and Hernán Vanzetto INRIA Nancy Grand-Est & LORIA Nancy, France Abstract TLA + is a formal specification language that is
Inductive datatypes in HOL. lessons learned in Formal-Logic Engineering
Inductive datatypes in HOL lessons learned in Formal-Logic Engineering Stefan Berghofer and Markus Wenzel Institut für Informatik TU München = Isabelle λ β HOL α 1 Introduction Applications of inductive
Computational Linguistics: Syntax-Semantics Interface
Computational Linguistics: Syntax-Semantics Interface Raffaella Bernardi KRDB, Free University of Bozen-Bolzano P.zza Domenicani, Room: 2.28, e-mail: bernardi@inf.unibz.it Contents 1 Lambda terms and DCG...................................
Lee Pike. June 3, 2005
Proof NASA Langley Formal Methods Group lee.s.pike@nasa.gov June 3, 2005 Proof Proof Quantification Quantified formulas are declared by quantifying free variables in the formula. For example, lem1: LEMMA
Interaction Nets vs. the ρ-calculus: Introducing Bigraphical Nets
Interaction Nets vs. the ρ-calculus: Introducing Bigraphical Nets Maribel Fernández 1 Ian Mackie 1 François-Régis Sinot 2 1 DCS, King s College London 2 LIX, École Polytechnique Rho-Calculus Workshop,
Jaykov Foukzon. Israel Institute of Technology, Haifa, Israel.
Inconsistent countable set Jaykov Foukzon Israel Institute of Technology, Haifa, Israel jaykovfoukzon@list.ru Abstract In this article we derived an importent example of the inconsistent countable set.
A Rule-based Verification Strategy for Array Manipulating Programs
Fundamenta Informaticae Submitted (2015) 1 26 1 IOS Press A Rule-based Verification Strategy for Array Manipulating Programs Emanuele De Angelis University of Chieti-Pescara, Pescara, Italy, emanuele.deangelis@unich.it