Results 1 
4 of
4
Linguistic Tools and Deductive Technique of the System for Automated Deduction
"... This paper is devoted to a brief description of some peculiarities and of the first software implementation of the System for Automated Deduction, SAD. Architecture of SAD corresponds well to a modern vision of the Evidence Algorithm that was conceived by V. Glushkov as a programme for constructi ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper is devoted to a brief description of some peculiarities and of the first software implementation of the System for Automated Deduction, SAD. Architecture of SAD corresponds well to a modern vision of the Evidence Algorithm that was conceived by V. Glushkov as a programme for constructing open systems for automated theoremproving that are intended for computeraided "doing" mathematics: i.e. for extracting and accumulating mathematical computer knowledge and for using it in a regular and efficient manner to prove a given statement that is always considered as a part of a selfcontained mathematical text. In addition, the main principles of SAD reflect the current understanding of the problem of manassisted processing of mathematical computer knowledge.
Evidential Paradigm and Intelligent Mathematical Text Processing
"... Abstract: This paper presents the evidential paradigm of computersupported 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 automat ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract: This paper presents the evidential paradigm of computersupported 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 selfcontained mathematical texts and can be used for inference search in firstorder sequentbased logic as well. For humanlike 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 nontrivial mathematical text. 1
System of Automated Deduction (SAD): Linguistic and Deductive Peculiarities
 INTELLIGENT INFORMATION SYSTEMS XI
"... In this paper a state of the art of a system of automated deduction called SAD is described. An architecture of SAD corresponds well to a modern vision of the Evidence Algorithm programme, initiated by Academician V.Glushkov. The system ..."
Abstract
 Add to MetaCart
In this paper a state of the art of a system of automated deduction called SAD is described. An architecture of SAD corresponds well to a modern vision of the Evidence Algorithm programme, initiated by Academician V.Glushkov. The system
GoalDriven Inference Search In Classical Propositional Logic
"... Two goaldriven strategies for inference search in propositional logic are presented in the form of special sequent calculi. Some results on their soundness and completeness are given, and comparison of these calculi is made. It is shown that no one of them is preferable to another in the sense ..."
Abstract
 Add to MetaCart
Two goaldriven strategies for inference search in propositional logic are presented in the form of special sequent calculi. Some results on their soundness and completeness are given, and comparison of these calculi is made. It is shown that no one of them is preferable to another in the sense of constructing minimal inferences.