This paper presents the evidential paradigm of computer-supported mathematical assistance in “doing” mathematics and in reasoning activity. At present, the evidential paradigm is implemented in the form of System for Automated Deduction (SAD). The system is based on the methods of automated theorem proving and is intended for intelligent mathematical text processing. It proves mathematical theorems, verifies validity of self-contained mathematical texts and can be used for inference search in first-order sequent-based logic as well. For human-like representation of mathematical knowledge, SAD exploits an original formal language close to natural languages of scientific publications. Since the problem of automated text verification is of great importance for industrial applications (checking specifications, proving safety properties of network protocols, etc), the paper illustrates some principles and peculiarities of the evidential paradigm by means of exemplifying the verification of a part of a non-trivial mathematical text.
[1]
Alexander V. Lyaletski,et al.
Evidence Algorithm and Sequent Logical Inference Search
,
1999,
LPAR.
[2]
Alexander V. Lyaletski.
Computer-Oriented Calculi of Sequent Trees
,
2004
.
[3]
Ronald L. Graham,et al.
Rudiments of Ramsey theory
,
1981
.
[4]
V. M. Glushkov,et al.
Some problems in the theories of automata and artificial intelligence
,
1970
.
[5]
Michael Kohlhase,et al.
Symbolic computation and automated reasoning
,
2001
.
[6]
Alexander V. Lyaletski,et al.
On the EA-style integrated processing of self-contained mathematical texts
,
2001
.
[7]
Alexander V. Lyaletski,et al.
Evidential Paradigm: The Logical Aspect
,
2003
.
[8]
Daniel Brand,et al.
Proving Theorems with the Modification Method
,
1975,
SIAM J. Comput..