Calculemus RISC THEOREMA Calculemus at RISC: The THEOREMA Project Bruno Buchberger OVR (“Old Visiting Researcher”) Talk at the Calculemus Midterm Review.

Slides:



Advertisements
Similar presentations
MoWGLI - Mathematics in the Semantic Web An Approach to Machine-Understandable Representation of the Information in Digital Documents Bernd Wegner Technical.
Advertisements

Algebraic Biology 2008 Opening Remarks by Bruno Buchberger, RISC, July 31, 2008.
GRE Mathematics Subject Test Workshop MSRI-UP 2013.
Linking HOL Light to Mathematica using OpenMath Supervised by:Dr. Sofiène Tahar Department of Electrical and Computer Engineering Presented by:Ons Seddiki.
IT-Park Timisoara Main Goal: IT developement Partners: Academic, Governamental History: Institutul e-Austria Current situation and achievements Concepts.
Panel: Mathematics in CS Iowa Undergraduate Computer Science Consortium October 2005.
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Copyright: Bruno Buchberger 2008 Thinking, Speaking, Writing Basic Working Techniques for Students of Mathematics and Computer Science Bruno Buchberger.
1 ETR 520 Introduction to Educational Research Dr. M C. Smith.
Copyright B. Buchberger White-Box / Black-Box Principle etc. Symposium Mathematics and New Technologies: What to Learn, How to Teach? Invited Talk.
About the Course Lecture 0: Sep 2 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
Copyright: Bruno Buchberger “Reading” Working with the Literature Bruno Buchberger Part of the Block Course „Working Techniques“ in the Frame of.
Copyright © 2006 The McGraw-Hill Companies, Inc. Programming Languages 2nd edition Tucker and Noonan Chapter 18 Program Correctness To treat programming.
Copyright Bruno Buchberger “Writing” and “Speaking” Written and Oral Presentations Writing Papers and Giving Talks Part of the Block Course „Working.
CS 330 Programming Languages 09 / 16 / 2008 Instructor: Michael Eckmann.
Copyright Bruno Buchberger Teaching Without Teachers? Bruno Buchberger Research Institute for Symbolic Computation University of Linz, Austria Talk at.
1 Calculemus Autumn School Approaches On Integration 10/28/02 Sabina Petride.
Chapter 3: “Writing” Written Presentations, Writing Papers Copyright Bruno Buchberger 2004 No parts of this file may be copied or stored without written.
Oct 30, 2001 Richard Fateman1 Do Math Making Computers Do Math Prof. Richard Fateman Fall, 2001 University of California, Berkeley.
Overview of the MS Program Jan Prins. The Computer Science MS Objective – prepare students for advanced technical careers in computing or a related field.
Data Structures and Programming.  John Edgar2.
Computer Science Education in Japan Bush, M. E. (2004). Computer science education in Japan. CACM, 47(8),
© 2004 Goodrich, Tamassia CS2210 Data Structures and Algorithms Lecture 1: Course Overview Instructor: Olga Veksler.
CONTI’2008, 5-6 June 2008, TIMISOARA 1 Towards a digital content management system Gheorghe Sebestyen-Pal, Tünde Bálint, Bogdan Moscaliuc, Agnes Sebestyen-Pal.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
About the Course Lecture 0: Sep 10 AB C. Plan  Course Information and Arrangement  Course Requirement  Topics and objectives of this course.
revised CmpE 583 Fall 2006Discussion: OWL- 1 CmpE 583- Web Semantics: Theory and Practice DISCUSSION: OWL Atilla ELÇİ Computer Engineering.
Using Mathematica for modeling, simulation and property checking of hardware systems Ghiath AL SAMMANE VDS group : Verification & Modeling of Digital systems.
The Integration and Effectiveness of Information and Communication Technologies in Canadian Postsecondary Education Dr. Carl Cuneo, Director, EvNet, Network.
Modes of Integration: 1) Enhancing with projects and assignments within a science course 2) Adding online support for math topics 3) Adding a credit of.
Chapter 2 – Software Processes Lecture 1 1Chapter 2 Software Processes.
Chapter 1: “Reading” Working with the Literature Copyright Bruno Buchberger 2004 No parts of this file may be copied or stored without written permission.
WXGE 6103 Digital Image Processing Semester 2, Session 2013/2014.
Sampletalk Technology Presentation Andrew Gleibman
Overview of Formal Methods. Topics Introduction and terminology FM and Software Engineering Applications of FM Propositional and Predicate Logic Program.
RISC Software GmbH Usage Scenarios for a Community Cloud in Education and Research Paul Heinzlreiter, Wolfgang Hennerbichler, Michael Krieger.
Introduction to Science Informatics Lecture 1. What Is Science? a dependence on external verification; an expectation of reproducible results; a focus.
Formal Verification Lecture 9. Formal Verification Formal verification relies on Descriptions of the properties or requirements Descriptions of systems.
Edinburgh and Calculemus Simon Colton Universities of Edinburgh and York.
Math 267 Mathematical Models in Economics Prof. Steven Tschantz Spring 2003.
Course Overview Stephen M. Thebaut, Ph.D. University of Florida Software Engineering Foundations.
CS-2851 Dr. Mark L. Hornick 1 CS-2852 Data Structures Dr. Mark L. Hornick Office: L341 Phone: web: people.msoe.edu/hornick/
The development of common partnership and interuniversitary scientific research according to the principle of sustainable development TRAINING COURSE Romania,
Course presentation: FLA Fuzzy Logic and Applications 4 CTI, 2 nd semester Doru Todinca in Courses presentation.
CPSC 322, Lecture 19Slide 1 (finish Planning) Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt – 5.2) Oct,
Towards Natural Style for Resolution Proofs in Theorema Diana Dubu West University of Timişoara eAustria Research Institute Supervisor Prof. Dr. Tudor.
Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub- Model Gábor Kusper Eszterházy Károly.
Automatic Generation of First Order Theorems Simon Colton Universities of Edinburgh and York Funded by EPSRC grant GR/M98012 and the Calculemus Network.
Formal Verification. Background Information Formal verification methods based on theorem proving techniques and model­checking –To prove the absence of.
Calculation Invention and Deduction Dr. Simon Colton Imperial College London (Formerly at Edinburgh) YVR in Karlsruhe & Saarbrucken.
IS 2620: Developing Secure Systems Formal Verification/Methods Lecture 9 March 15, 2012.
ERASMUS February 2014, Brno Prepared by: Mgr. Hana Kuzdasová.
Module 3: Problem Solving: Look for a pattern Guess and check.
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
“Reading” Working with the Literature
Sub-fields of computer science. Sub-fields of computer science.
COSC 5V90 Functional Programming and Interactive Theorem Proving
MATH/COMP 340: Numerical Analysis I
Overview Where / what is IST Austria? PhD program Internships
COMP 283 Discrete Structures
Bruno Buchberger Kyoto University, October 2004
Discrete Mathematics and Its Applications
IS 2935: Developing Secure Systems
Revised National 5 Course Assessment Hospitality: Practical Cookery
Gábor Kusper  Research Institute for Symbolic Computation (RISC-Linz)
Mathematics Quiz Next Class.
Integrating Mathematical Thinking into the Curriculum: Examples
Discrete Mathematics and Its Applications
Representations & Reasoning Systems (RRS) (2.2)
Rich Model Toolkit – An Infrastructure for Reliable Computer Systems
Presentation transcript:

Calculemus RISC THEOREMA Calculemus at RISC: The THEOREMA Project Bruno Buchberger OVR (“Old Visiting Researcher”) Talk at the Calculemus Midterm Review Saarland University and DFKI, Saarbruecken, Germany March 30, 2003

Calculemus RISC THEOREMA Copyright Bruno Buchberger 2003 Copyright Note: This file may be copied and stored under the following conditions: –The file must be kept unchanged and must include the copyright note. –A message is sent to –If you use material from this talk, please, cite the talk appropriately.

Calculemus RISC THEOREMA RISC: Research Institute for Symbolic Computation Johannes Kepler University Linz, Austria Founded in 1987 by B. Buchberger THEOREMA: A project at RISC on formal mathematics (computer-supported proving, solving, computing) Project leader: B. Buchberger

Calculemus RISC THEOREMA The Goal of RISC: research education application in symbolic computation. The YVR program is integrated into RISC education.

Calculemus RISC THEOREMA Education at RISC: permanently ~ 25 international PhD students emphasis on basic research educate also in research management (e.g. J of SC, e.g. int’l conferences) educate also in application management (e.g. Softwarepark Hagenberg, a RISC spin-off,  possibilities for internship  RISC graduates now founded SWpark in Romania!)

Calculemus RISC THEOREMA THEOREMA Group: Senior researchers: B. Buchberger, T. Jebelean, W. Windsteiger Postdocs: Temur Kutsia, Koji Nakagawa, Mircea Marin, Judit Robu PhD students: Florina Piroi, Markus Rosenkranz, Adrian Craciun, Laura Kovacs, Nikolaj Popov, Gabor Kusper Socrates students: Cornel Izbasa, Diana Dubu, Sorin Cira, Camelia Kocsis

Calculemus RISC THEOREMA THEOREMA involvements in EU-Programs: Calculemus TMR OpenMath Thematic Net MKM (Mathematical Knowledge Management) Thematic Net Socrates

Calculemus RISC THEOREMA THEOREMA tasks within Calculemus: Task leader for Task 2.2: Enhance Computer Algebra Systems by Reasoning Power Task leader in Task 3.1: Case Studies in Writing Mathematical Publications Participation in Task 1.2: Definition of Mathematical Services Participation in Task 3.3: Application to Undergraduate Exams

Calculemus RISC THEOREMA THEOREMA cooperation with other groups: U of Karlsruhe 2.2 U of Bialystok 3.1 U of Edinburgh 2.2 U of Genova 2.2 U of Saarbrücken 3.1 U of Bialystok: 3.1

Calculemus RISC THEOREMA Task 2.2: Enhance Computer Algebra Systems by Reasoning Power Participants: THEOREMA, U of Karlsruhe, U of Edinburgh, (U of Genova) Current computer algebra systems: solving and computing Future math systems: proving, solving, and computing THEOREMA was chosen as a prototype for this task (the entire functionality of Mathematica is preserved and powerful proving functionality is added) External links to other proving systems are possible

Calculemus RISC THEOREMA Task 3.1: Case Studies in Writing Mathematical Publications Participants: THEOREMA, U of Bialystok, U of Saarbrücken U of Bialystok: MIZAR library is currently the most extensive verified math knowledge base (J of Formalized Mathematics) Within THEOREMA: Lecture notes on predicate logic as a working language Lecture notes on algorithmic methods in math All publications on THEOREMA were written within THEOREMA U of Saarbrücken: OmDoc language for describing semantics and structure of mathematical documents on the web

Calculemus RISC THEOREMA Participation in Task 1.2: Definition of Mathematical Services RISC Contribution: MathBroker architecture for interchange of mathematical content over the web (Olga Caprotti and Wolfgang Schreiner)

Calculemus RISC THEOREMA Participation in Task 3.3: Application to Undergraduate Exams RISC Contribution: Using Theorema in math courses at the U of Linz

Calculemus RISC THEOREMA The Ultimate Scientific Goal of Calculemus (and THEOREMA): Automate the management of mathematical knowledge (not only methods!): invention verification re-use (over the web) Why? Efficiency (of spending funds) ! Calculemus  Math / CS  Applications Europe is leading !

Calculemus RISC THEOREMA THEOREMA Training within Calculemus: YVR Program: In: Adrian Craciun: 17 mo Out: Markus Rosenkranz: 1 mo (to U of Nijmegen) In (starting April 2003): Laura Kovacs: 16 mo Camelia Kocsis: 16 mo

Calculemus RISC THEOREMA THEOREMA Training within Calculemus: Remote Mizar course for THEOREMA young researchers Tutorial on THEOREMA at Calculemus Workshop in Pisa THEOREMA training for high school teachers and math students Train Socrates students in the THEOREMA group

Calculemus RISC THEOREMA YVR Adrian Craciun Visiting from U of Timisoara (Romania) Sep 2001 – June 2003 PhD topic: Theory Exploration and Algorithm Synthesis within Theorema Work at RISC: with B. Buchberger: induction provers, case study merge sort, conjecture generator with W. Windsteiger: implementation techniques in Mathematica with T. Kutsia: simplification techniques using sequence variables

Calculemus RISC THEOREMA YVR Markus Rosenkranz Visiting U of Nijmegen (Prof. Barendregt) April 2002 PhD topic: Non-commutative Gröbner bases for boundary value problems (differential equations) Work at U of N: with H. Barendregt: formalizing differential operators in Coq with F. Wiedijk: comparison of 15 theorem proving systems

Calculemus RISC THEOREMA YVR Laura Kovacs Visiting from U of Timisoara, Romania (Prof. S. Maruster) June 2003 – June 2004 PhD topic: Algorithm Verification in Theorema Work at U of N.: with B. Buchberger: formal proving with T. Jebelean: inductive assertion method with W. Windsteiger: implementation techniques in Mathematica

Calculemus RISC THEOREMA Remote MIZAR course for THEOREMA young researchers: Course was given by A. Trybulec Feb – May 2002 Exercises and discussion over the web Participants: THEOREMA postdocs and PhD students.

Calculemus RISC THEOREMA Socrates students in THEOREMA: Cornel Izbasa (U of Timisoara, Romania): Oct March 2002, work with W. Windsteiger on the kernel of the Theorema system Diana Dubu (U of Timisoara, Romania): Oct 2001 – March 2002, work with T. Jebelean on predicate proving in natural style Sorin Cira (U of Timisoara, Romania): Oct June 2003, work with B. Buchberger on developing a mathematical knowledge base for Hilbert spaces theory Camelia Kocsis (U Cluj-Napoca, Romania): Feb June 2003, work with B. Buchberger on retrieval of logical formulae from a mathematical knowledge base

Calculemus RISC THEOREMA Practical problems with YVR program: Conditions for candidates are too restrictive age limits (example: Judit Robu) countries (examples: K. Nakagawa - Japan, T. Kutsia - Georgia) too long stay in Austria (example Florina Piroi) Rates come many months too late we cannot hire people taking a financial risk