A. A. Larionov

  • Citations Per Year
Learn More
The paper deals with an expressive logic language LF and its calculus. Formulas of this language consist of some large-scale structural elements, such as type quantifiers. The language LF contains only two logic symbols—∀ and ∃, which form the set of logic connectives of the language. The logic calculus JF and complete strategy for automated proof search(More)
The language of positively constructed formulae and its calculus are described in this paper. The results of a software system development for automated theorem proving in the calculus are presented. The implementation of the algorithms is based on different techniques for improving system performance and reduction of the amount of used memory. A number of(More)
In this paper, we present the description of our extension to Model Driven Architecture (MDA) methodology using the logical programming paradigm and also a practical example of application of our extension to the development process. Then we consider an induction approach of ontology from the revision control system repository. This ontology can be used in(More)
The calculus of positively constructed formulas (PCF) is a first-order formalism that has many features useful for solving problems of dynamic systems control. This formalism is used as a basis for automatic theorem proving (ATP) systems. Many problems in the field of ATP can be formalized only with the use of equality predicate. Using this predicate will(More)
The calculus of positively constructed formulas (PCF) is a first-order formalism that has many features useful for solving problems of dynamic systems control. For investigation of this formalism, analysis of logical inference of formulas is used. The logical inference consist of many PCF. The analysis of big amount of formulas require special operations:(More)
  • 1