Automated theorem proving

Results: 768



#Item
1AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT  INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING  1. I NTRODUCTION

AHRENDT, BECKERT, HÄHNLE, MENZEL, REIF, SCHELLHORN, SCHMITT INTEGRATING AUTOMATED AND INTERACTIVE THEOREM PROVING 1. I NTRODUCTION

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2009-08-28 10:31:35
    2Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

    Automated Discovery of Inductive Theorems Keywords: theorem proving and knowledge acquisition Abstract Inductive mathematical theorems have, as a rule, historically been quite dif cult to prove – both for

    Add to Reading List

    Source URL: www.inf.ed.ac.uk

    - Date: 2007-06-28 01:04:40
      3Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

      Journal of Automated Reasoning manuscript No. (will be inserted by the editor) On Interpolation in Automated Theorem Proving Maria Paola Bonacina · Moa Johansson

      Add to Reading List

      Source URL: www.cse.chalmers.se

        4Microsoft Word - BlankPage

        Microsoft Word - BlankPage

        Add to Reading List

        Source URL: www.cs.miami.edu

        Language: English - Date: 2007-08-16 08:58:53
        5SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

        SAT-based Termination Analysis for Java Bytecode with AProVE? Carsten Fuhs LuFG Informatik 2, RWTH Aachen University, Germany

        Add to Reading List

        Source URL: www.dcs.bbk.ac.uk

        Language: English - Date: 2011-06-23 09:19:29
        6Tutorial on Specialisation of Logic Programs J.P. Gallagher Department of Computer Science University of Bristol University Walk Bristol BS8 1TR, U.K.

        Tutorial on Specialisation of Logic Programs J.P. Gallagher Department of Computer Science University of Bristol University Walk Bristol BS8 1TR, U.K.

        Add to Reading List

        Source URL: repository.readscheme.org

        Language: English - Date: 2010-10-22 08:05:29
        7Automatic Proof and Disproof in Isabelle/HOL Jasmin Christian Blanchette, Lukas Bulwahn, and Tobias Nipkow Fakult¨at f¨ur Informatik, Technische Universit¨at M¨unchen Abstract. Isabelle/HOL is a popular interactive t

        Automatic Proof and Disproof in Isabelle/HOL Jasmin Christian Blanchette, Lukas Bulwahn, and Tobias Nipkow Fakult¨at f¨ur Informatik, Technische Universit¨at M¨unchen Abstract. Isabelle/HOL is a popular interactive t

        Add to Reading List

        Source URL: people.mpi-inf.mpg.de

        Language: English - Date: 2015-05-21 06:02:19
        8Uniform interpolation and sequent calculi in modal logic Rosalie Iemhoff∗ March 28, 2015  Abstract

        Uniform interpolation and sequent calculi in modal logic Rosalie Iemhoff∗ March 28, 2015 Abstract

        Add to Reading List

        Source URL: www.phil.uu.nl

        Language: English - Date: 2015-04-01 07:45:41
        9179  Doc. Math. J. DMV Differen
e S
heme for the Vlasov-Manev System

        179 Doc. Math. J. DMV Differen e S heme for the Vlasov-Manev System

        Add to Reading List

        Source URL: www.math.uiuc.edu

        Language: English - Date: 2014-07-15 07:20:41