Formal Methods for Knowledge Management in Science Theorema Group - - PowerPoint PPT Presentation

formal methods for knowledge management in science
SMART_READER_LITE
LIVE PREVIEW

Formal Methods for Knowledge Management in Science Theorema Group - - PowerPoint PPT Presentation

Formal Methods for Knowledge Management in Science Theorema Group RISC, Johannes Kepler University Linz, Austria Presented by Temur Kutsia The Theorema Project Initiated and led by Bruno Buchberger. Aim: extending current computer


slide-1
SLIDE 1

Formal Methods for Knowledge Management in Science

Theorema Group

RISC, Johannes Kepler University Linz, Austria

Presented by Temur Kutsia

slide-2
SLIDE 2

The Theorema Project

◮ Initiated and led by Bruno Buchberger. ◮ Aim: extending current computer algebra systems by facilities

for supporting mathematical proving, to create a mathematical assistant system.

slide-3
SLIDE 3

Outline

Mathematical Knowledge Management Reasoning and Exploration in Theorema Ideas

slide-4
SLIDE 4

Outline

Mathematical Knowledge Management Reasoning and Exploration in Theorema Ideas

slide-5
SLIDE 5

Mathematical Knowledge Management

Two parsings:

◮ Mathematical (Knowledge Management) ◮ (Mathematical Knowledge) Management

slide-6
SLIDE 6

Mathematical Knowledge Management

◮ Definitions, theorems, proofs, algorithms, conjectures,

problems, examples,...

◮ Vast knowledge is generated. ◮ “The total number of pages published in mathematics so far

makes up a stack of about 60 km height.” (M. Hazewinkel, 2003).

◮ Managing such knowledge is a very difficult task.

slide-7
SLIDE 7

Storing Mathematical Knowledge

◮ Mathematical knowledge repositories: digitized vs formalized. ◮ Examples of digitized: sciencedirect, ACM DL, SpringerLink,

arXiv, Safari Books Online, NIST Digital Library of Mathematical Functions, MathWorld, etc.

◮ Examples of formalized: the Mizar library, The Coq library,

TPTP, Wolfram functions, HELM, etc.

slide-8
SLIDE 8

Accessing Mathematical Knowledge

In digitized format:

◮ Searching (metadata, full text). ◮ Browsing.

Pretty restricted.

slide-9
SLIDE 9

Accessing Mathematical Knowledge

◮ Formalized approach requires more rigor. ◮ But it opens more possibilities to access the knowledge,

beyond just searching and browsing.

◮ One should be able to use e.g. a proposition in the query and

find out whether it follows from the knowledge base.

◮ Theorem proving.

◮ One should be able to find out what “interesting”

consequences can be drawn from the knowledge base.

◮ Theory exploration.

Formalized vs Digitized proving vs searching exploration vs browsing

slide-10
SLIDE 10

Access Options May Influence Storing

◮ In digital approach, store all knowledge.

◮ (It would be odd to keep only odd pages of a paper.)

◮ In formal approach, store only important/difficult data.

◮ (If the proof engine can prove a theorem from the knowledge

base in milliseconds, there might be no need to store this theorem.)

slide-11
SLIDE 11

Outline

Mathematical Knowledge Management Reasoning and Exploration in Theorema Ideas

slide-12
SLIDE 12

Reasoning and Exploration in Theorema

◮ Mathematical assistant system. ◮ Implemented in Mathematica. ◮ Integrates proving, solving, and computing. ◮ Flexible “external” syntax. ◮ Human-readable proof presentation.

slide-13
SLIDE 13

Reasoning and Exploration in Theorema

◮ Library of general and special reasoners. ◮ Special = fixed theory, e.g. RCF, set theory, ... ◮ Access to powerful computer algebra algorithms from the

Mathematica system.

◮ On the meta-level, allows programming of reasoning tactics. ◮ Aims at supporting theory exploration process.

slide-14
SLIDE 14

Reasoning and Exploration in Theorema

Theorema components for reasoning and exploration

slide-15
SLIDE 15

Exploration in Theorema

◮ Theory exploration involves inventing new notions,

propositions, algorithms, ...

◮ Theorema approach: Guide the inventing process by schemata. ◮ Schemas are stored in the schema library. ◮ Examples of schemas:

◮ alternating quantification (definition scheme), ◮ is-homomorphic (proposition scheme), ◮ divide-and-conquer (algorithm scheme), ◮ etc.

◮ Invention −

→ synthesis.

slide-16
SLIDE 16

Exploration in Theorema

◮ Synthesis by B. Buchberger’s “Lazy thinking” technique. ◮ “Lazy thinking” is a schema-based deductive synthesis

method.

◮ Powerful enough to synthesize a nontrivial algorithm:

Buchberger’s algorithm for computing Gr¨

  • bner Bases.
slide-17
SLIDE 17

Outline

Mathematical Knowledge Management Reasoning and Exploration in Theorema Ideas

slide-18
SLIDE 18

Ideas For Future Work

Formalized approach to MKM opens new perspectives.

◮ On the one hand, we plan to work on strengthening the

reasoning and exploration capabilities of Theorema with the aim to be used in mathematical knowledge management.

◮ On the other hand, we have a potential to do something

radically new for the organization of science, namely

◮ automation of quality control, ◮ archiving and retrieving of information in scientific publications, ◮ discovering “hidden” knowledge from the (formalized)

literature.

slide-19
SLIDE 19

More Information

For contact information, publications, software download, please visit the Theorema Web page: www.theorema.org