Theoretical foundations of the organization of branches and repetitions in programs in the logic programming language Prolog

Introduction. The organization of branches and repetitions in the context of logical programming is considered by an example of the Prolog language. The fundamental feature of the program in a logical programming language is the fact that a computer must solve a problem by reasoning like a human. Su...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Advanced engineering research (Rostov-na-Donu, Russia) Ročník 21; číslo 2; s. 200 - 206
Hlavný autor: Zdor, D. V.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Don State Technical University 01.09.2021
Predmet:
branching
logical programming
recursion termination condition
recursive rule
repetition of predicates
ISSN:2687-1653, 2687-1653
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Introduction. The organization of branches and repetitions in the context of logical programming is considered by an example of the Prolog language. The fundamental feature of the program in a logical programming language is the fact that a computer must solve a problem by reasoning like a human. Such a program contains a description of objects and relations between them in the language of mathematical logic. At the same time, the software implementation of branching and repetition remains a challenge in the absence of special operators for the indicated constructions in the logical language. The objectives of the study are to identify the most effective ways to solve problems using branching and repetition by means of the logic programming language Prolog, as well as to demonstrate the results obtained by examples of computational problems.  Materials and Methods. An analysis of the literature on the subject of the study was carried out. Methods of generalization and systematization of knowledge, of the program testing, and analysis of the program execution were used.  Results. Constructions of branching and repetition organization in a Prolog program are proposed. To organize repetitions, various options for completing a recursive cycle when solving problems are given.  Discussion and Conclusions. The methods of organizing branches and repetitions in the logic programming language Prolog are considered. All these methods are illustrated by examples of solving computational problems. The results obtained can be used in the further development of the recursive predicates in logical programming languages, as well as in the educational process when studying logical programming in the Prolog language. The examples of programs given in the paper provide using them as a technological basis for programming branches and repetitions in the logic programming language Prolog.
AbstractList Introduction. The organization of branches and repetitions in the context of logical programming is considered by an example of the Prolog language. The fundamental feature of the program in a logical programming language is the fact that a computer must solve a problem by reasoning like a human. Such a program contains a description of objects and relations between them in the language of mathematical logic. At the same time, the software implementation of branching and repetition remains a challenge in the absence of special operators for the indicated constructions in the logical language. The objectives of the study are to identify the most effective ways to solve problems using branching and repetition by means of the logic programming language Prolog, as well as to demonstrate the results obtained by examples of computational problems.  Materials and Methods. An analysis of the literature on the subject of the study was carried out. Methods of generalization and systematization of knowledge, of the program testing, and analysis of the program execution were used.  Results. Constructions of branching and repetition organization in a Prolog program are proposed. To organize repetitions, various options for completing a recursive cycle when solving problems are given.  Discussion and Conclusions. The methods of organizing branches and repetitions in the logic programming language Prolog are considered. All these methods are illustrated by examples of solving computational problems. The results obtained can be used in the further development of the recursive predicates in logical programming languages, as well as in the educational process when studying logical programming in the Prolog language. The examples of programs given in the paper provide using them as a technological basis for programming branches and repetitions in the logic programming language Prolog.
Author Zdor, D. V.
Author_xml – sequence: 1
  givenname: D. V.
  orcidid: 0000-0003-1131-6708
  surname: Zdor
  fullname: Zdor, D. V.
  organization: Primorskaya State Academy of Agriculture
BookMark eNpNUctKAzEUDVLBWvsPWbgdzeQ5BTdSfBQKuqjrcCeP6ZRpUjLtQvHjzbRahBtyck7ugXvuNRqFGBxCtyW5o2zG1T2VlSpKKVhBCS2LoTIi-cgLND6ro3_4Ck37fkMIoUpJytgYfa_WLia3bw102MdDsLBvY-hx9Hi_djimBkL7dSQHrk4QzNr1GILFye1y5-l_G_AuxSbB9oiH3i42rfljt21ocAehOUDj8HuKWb1Blx663k1_7wn6eH5azV-L5dvLYv64LAzlQuaBOBV15StaCuptZQQQXvNSCTWr8xs48YoICxWVTlFLiXCMEyKNs9QwYBO0OPnaCBu9S-0W0qeO0OojkWfUkHIEndNEMc6YsF6WhruqmoH0ntW-rpydMSDZ6-HkZVLs--T82a8k-rgYPcSth7j1sBg9VEZZJZL9AD0rhVQ
Cites_doi 10.1145/504083.504085
10.1109/MDT.2004.1277900
10.1017/S1471068411000391
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.23947/2687-1653-2021-21-2-200-206
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2687-1653
EndPage 206
ExternalDocumentID oai_doaj_org_article_0734335df61c4e889a6ff3bfb8ed93a0
10_23947_2687_1653_2021_21_2_200_206
GroupedDBID AAFWJ
AAYXX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c2456-20425b8f82152fd8c5a04b417579bfd8a40f705da826e72d205e34006ced2c3a3
IEDL.DBID DOA
ISSN 2687-1653
IngestDate Fri Oct 03 12:35:53 EDT 2025
Sat Nov 29 05:14:19 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License https://www.vestnik-donstu.ru/jour/about/editorialPolicies#openAccessPolicy
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2456-20425b8f82152fd8c5a04b417579bfd8a40f705da826e72d205e34006ced2c3a3
ORCID 0000-0003-1131-6708
OpenAccessLink https://doaj.org/article/0734335df61c4e889a6ff3bfb8ed93a0
PageCount 7
ParticipantIDs doaj_primary_oai_doaj_org_article_0734335df61c4e889a6ff3bfb8ed93a0
crossref_primary_10_23947_2687_1653_2021_21_2_200_206
PublicationCentury 2000
PublicationDate 2021-09-01
PublicationDateYYYYMMDD 2021-09-01
PublicationDate_xml – month: 09
  year: 2021
  text: 2021-09-01
  day: 01
PublicationDecade 2020
PublicationTitle Advanced engineering research (Rostov-na-Donu, Russia)
PublicationYear 2021
Publisher Don State Technical University
Publisher_xml – name: Don State Technical University
References ref13
ref12
ref14
ref11
ref10
ref0
ref2
ref1
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref1
– ident: ref4
– ident: ref2
– ident: ref3
– ident: ref5
– ident: ref6
– ident: ref7
– ident: ref13
  doi: 10.1145/504083.504085
– ident: ref0
  doi: 10.1109/MDT.2004.1277900
– ident: ref9
– ident: ref8
– ident: ref11
  doi: 10.1017/S1471068411000391
– ident: ref10
– ident: ref12
– ident: ref14
SSID ssj0002776233
Score 2.1549973
Snippet Introduction. The organization of branches and repetitions in the context of logical programming is considered by an example of the Prolog language. The...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 200
SubjectTerms branching
logical programming
recursion termination condition
recursive rule
repetition of predicates
Title Theoretical foundations of the organization of branches and repetitions in programs in the logic programming language Prolog
URI https://doaj.org/article/0734335df61c4e889a6ff3bfb8ed93a0
Volume 21
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: Directory of Open Access Journals
  customDbUrl:
  eissn: 2687-1653
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002776233
  issn: 2687-1653
  databaseCode: DOA
  dateStart: 20060101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA4iInoQn_gmh72WbZtH06OK4kGWPayyt5InrmBXWteTP96ZdFfryYuQQBtI037MJDPN5BtCBkJFlnWV-HgkJ-N5oo3UCVLLKJ9nTkWe7qeHYjRS02k57qX6wpiwjh64A24IIsgZEy7IzHKvVKllCMwEo7wrmY7eOlg9PWfqJW6ngZIztkkGMda55MUwl6BOmRQMBCPPEiwoIlDlrzWpR90f15i7XbKzNA7pVfdSe2StWeyT7R5l4AH5nPycPKThOydSS-eBgi1H572zldhmMHHGs2-prh1t_JvvyIlaOqvpMjYrXmPfOA2uWl9hOLr6m0nHDU6Sh-Tx7nZyc58sMygkFjc04dtAJY0KCrPXBqes0Ck3HEyGojRwr3kailQ4DU6GL3KXp8Iz0Gppvcst0-yIrNfz2h8TGoTLeJAW7C3Ns9SqYHGhE4XNS2MydULECsPqrSPKqMDBiNhXiH2F2FeIfYUF819ClSfkGgH_7oN017EB8KqWQlD9JQSn__GQM7IVJSMGkJ2T9fdm4S_Ihv14n7XNZZSvL5sB0m0
linkProvider Directory of Open Access Journals
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=Theoretical+foundations+of+the+organization+of+branches+and+repetitions+in+programs+in+the+logic+programming+language+Prolog&rft.jtitle=Advanced+engineering+research+%28Rostov-na-Donu%2C+Russia%29&rft.au=D.+V.+Zdor&rft.date=2021-09-01&rft.pub=Don+State+Technical+University&rft.eissn=2687-1653&rft.volume=21&rft.issue=2&rft.spage=200&rft.epage=206&rft_id=info:doi/10.23947%2F2687-1653-2021-21-2-200-206&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_0734335df61c4e889a6ff3bfb8ed93a0
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2687-1653&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2687-1653&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2687-1653&client=summon