Analysis of the methods for competing recursion in recursive riles in the logic programming language Prolog

One of the developing trends in programming is the logic programming associated with the implementation of tools for creating artificial intelligence. One of such programming languages is the nonprocedural declarative logic programming language Prolog. This article is dedicated to the use of recursi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Программные системы и вычислительные методы číslo 4; s. 68 - 76
Hlavní autori: Zdor, Dmitrii Valer'evich, Gornostaeva, Tat'yana Nikolaevna
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: 01.04.2021
ISSN:2454-0714, 2454-0714
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract One of the developing trends in programming is the logic programming associated with the implementation of tools for creating artificial intelligence. One of such programming languages is the nonprocedural declarative logic programming language Prolog. This article is dedicated to the use of recursive rules in Prolog software. The goal of this work lies in analysis of the methods for completing recursive calls in recursive rules, as well as in explication of the use of such methods on the examples of programs with recursion. The author explores the specialized literature on the topic, generalized and systematizes the data, as well as tested the programs and the progress of their implementation. Recursive rule in the Prolog software sets an infinite cycle of repetition of predicates. For completing the recursive cycle, it is necessary to set a condition within the program that would end the cycle. The article examines the variants of organizing recursions with the completion of infinite cycle. The examples used in the article allows using them as the basis for programming in language Prolog for solving similar tasks. The acquired results are valuable for further development of the use of recursive predicates in logic programming languages.
AbstractList One of the developing trends in programming is the logic programming associated with the implementation of tools for creating artificial intelligence. One of such programming languages is the nonprocedural declarative logic programming language Prolog. This article is dedicated to the use of recursive rules in Prolog software. The goal of this work lies in analysis of the methods for completing recursive calls in recursive rules, as well as in explication of the use of such methods on the examples of programs with recursion. The author explores the specialized literature on the topic, generalized and systematizes the data, as well as tested the programs and the progress of their implementation. Recursive rule in the Prolog software sets an infinite cycle of repetition of predicates. For completing the recursive cycle, it is necessary to set a condition within the program that would end the cycle. The article examines the variants of organizing recursions with the completion of infinite cycle. The examples used in the article allows using them as the basis for programming in language Prolog for solving similar tasks. The acquired results are valuable for further development of the use of recursive predicates in logic programming languages.
Author Gornostaeva, Tat'yana Nikolaevna
Zdor, Dmitrii Valer'evich
Author_xml – sequence: 1
  givenname: Dmitrii Valer'evich
  surname: Zdor
  fullname: Zdor, Dmitrii Valer'evich
– sequence: 2
  givenname: Tat'yana Nikolaevna
  surname: Gornostaeva
  fullname: Gornostaeva, Tat'yana Nikolaevna
BookMark eNpNkMtuwyAQRVGVSk3T_ELFD9gdAzZmGUV9RIrULrJHGLCDakMESaX8fUNf6mpm7tGdxblFMx-8Rei-gpKTunkgrGYF8IqVBEhVspLWtKVXaP4HZv_2G7RMyXXAGK85NGKO3ldejefkEg49Pu4tnuxxH0zCfYhYh-lgj84POFp9iskFj53_PT4sjm60KUe5OYbBaXyIYYhqmnJrVH44qcHitxgu9A5d92pMdvkzF2j39LhbvxTb1-fNerUttKhpoWstTEMqQQz0fdtRUE2nCFhNG9WCEK01hlJOOgEd1_yCDRXAbKeMBsXoAjXfb3UMKUXby0N0k4pnWYHM0mT2IbMPmaVJJr-k0U__3mPZ
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.7256/2454-0714.2021.4.35383
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
EISSN 2454-0714
EndPage 76
ExternalDocumentID 10_7256_2454_0714_2021_4_35383
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
M~E
ID FETCH-LOGICAL-c953-c5c9d62192d0ff8b30a6ba20ec36a80998edd3372b90b7c70a6d3904ebadc0a43
ISSN 2454-0714
IngestDate Sat Nov 29 02:28:08 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Issue 4
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c953-c5c9d62192d0ff8b30a6ba20ec36a80998edd3372b90b7c70a6d3904ebadc0a43
OpenAccessLink http://nbpublish.com/library_get_pdf.php?id=35383
PageCount 9
ParticipantIDs crossref_primary_10_7256_2454_0714_2021_4_35383
PublicationCentury 2000
PublicationDate 2021-4-00
PublicationDateYYYYMMDD 2021-04-01
PublicationDate_xml – month: 04
  year: 2021
  text: 2021-4-00
PublicationDecade 2020
PublicationTitle Программные системы и вычислительные методы
PublicationYear 2021
References ref8
ref7
ref9
ref4
ref3
ref6
ref5
ref10
ref2
ref1
References_xml – ident: ref1
– ident: ref4
– ident: ref2
– ident: ref3
– ident: ref5
– ident: ref6
– ident: ref7
– ident: ref9
– ident: ref8
– ident: ref10
SSID ssib044757069
Score 1.7535937
Snippet One of the developing trends in programming is the logic programming associated with the implementation of tools for creating artificial intelligence. One of...
SourceID crossref
SourceType Index Database
StartPage 68
Title Analysis of the methods for competing recursion in recursive riles in the logic programming language Prolog
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2454-0714
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044757069
  issn: 2454-0714
  databaseCode: M~E
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtR3LbtswTGi7HXYZNmzD1j2gw3IKnDqWbEnHpUm3y4odgqE3w5ZlwGhrF04WdJd9-yjKcrUiGNbDLoxMmbQThiJFkCIhH21oqaoFA8-NpxEHGxKVhVSRYdYdEWVdJxU2mxDn5_LiQn07ONz6WpjdlWhbeXurbv6rqAEHwralsw8Q98gUEDAGoQMEsQP8J8GHx4xYr9L1iMZjFzCBHGucp72Ns2-GRMfhYmemPSwSG5_7iMuiz-C6tlQ-umnrC2A29Gwny3iizibLuc2dgPFihZAFGAdPA7jE2QWO0ylezPFC-jHAxE17MkswdTe5j8QzASj-pIbxIsCEnNz9-19jfL80IHPfh7tbx3h75cIdy-tm2zfN9HuBlZUC3A09Bto_d33bgRduduiprwswfOJn0Ragh5fdFeBdC3MffUnmQdIOLtIJTzkWgTl7ugfXhEETNBKuj9DgbrjuN_cNmQBP1NbqeE4z--wZnzGwT-zOdPt0hXsWfcyzhB2e5ZRbPrnlk1s-Oc-RzyF5lIhUWXP29dfKr8L2BEgRYy_I8fGutN6yOtn_SoFXF7hn62fk6bCvop-cPjwnB6Z9QS69LtCupvCPpoMuUNAFOuoCHXWBNi0ddYGiLliUpURdoIEuUK8L1OnCS7I-W61Pv0RDd5FIq5RFOtWqysBeJ1Vc17JkcZGVRRIbzbJCwkIlTVUxJpJSxaXQAqYrpmJuyqLSccHZK3LUdq15TaiELQmrjTRKplxnmVJlFqtMw95DK8b1G3Lif5z8xp0hk_9dMscPpnhLntz9Pd-Ro23_w7wnj_Vu22z6Dyjg3xUSny8
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Analysis+of+the+methods+for+competing+recursion+in+recursive+riles+in+the+logic+programming+language+Prolog&rft.jtitle=%D0%9F%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%BD%D1%8B%D0%B5+%D1%81%D0%B8%D1%81%D1%82%D0%B5%D0%BC%D1%8B+%D0%B8+%D0%B2%D1%8B%D1%87%D0%B8%D1%81%D0%BB%D0%B8%D1%82%D0%B5%D0%BB%D1%8C%D0%BD%D1%8B%D0%B5+%D0%BC%D0%B5%D1%82%D0%BE%D0%B4%D1%8B&rft.au=Zdor%2C+Dmitrii+Valer%27evich&rft.au=Gornostaeva%2C+Tat%27yana+Nikolaevna&rft.date=2021-04-01&rft.issn=2454-0714&rft.eissn=2454-0714&rft.issue=4&rft.spage=68&rft.epage=76&rft_id=info:doi/10.7256%2F2454-0714.2021.4.35383&rft.externalDBID=n%2Fa&rft.externalDocID=10_7256_2454_0714_2021_4_35383
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2454-0714&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2454-0714&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2454-0714&client=summon