Abstract: For artificial intelligence and robotics, the most urgent task is to develop a programming language, programs in which would have a fast execution speed. The report presents a methodology for developing such programs using the theory of semantic programming. This methodology is based on the p-complete logical programming language L developed by us. In which all programs have polynomial computational complexity. For these purposes, the following are used: a polynomial analogue of Gandy's fixed point theorem (PAG-theorem), p-iteration terms, conditional terms, and GNF-systems .

Cite: Goncharov S.S. , Nechesov A.V.
Logic programming language Delta in AI and Robotics.
Current State and Development Perspectives of Digital Technologies and Artificial Intelligence 27-28 Oct 2022