From Logic to Functional Logic Programs

Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable functions into predicates in order to stay in the logic programming...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 22; no. 4; pp. 538 - 554
Main Author: HANUS, MICHAEL
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.07.2022
Subjects:
Functional programming
Language
Languages
Logic programming
Logic programs
Mathematical functions
Original Article
Syntax
Transformations (mathematics)
narrowing strategies
functional logic programming
transformation
resolution
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable functions into predicates in order to stay in the logic programming framework. Since amalgamated functional logic languages offer flexible as well as efficient evaluation strategies, we propose an opposite approach in this paper. By mapping logic programs into functional logic programs with a transformation based on inferring functional dependencies, we develop a fully automatic transformation which keeps the flexibility of logic programming but can improve computations by reducing infinite search spaces to finite ones.
AbstractList Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable functions into predicates in order to stay in the logic programming framework. Since amalgamated functional logic languages offer flexible as well as efficient evaluation strategies, we propose an opposite approach in this paper. By mapping logic programs into functional logic programs with a transformation based on inferring functional dependencies, we develop a fully automatic transformation which keeps the flexibility of logic programming but can improve computations by reducing infinite search spaces to finite ones.
Author HANUS, MICHAEL
Author_xml – sequence: 1
  givenname: MICHAEL
  orcidid: 0000-0002-4953-8202
  surname: HANUS
  fullname: HANUS, MICHAEL
  email: mh@informatik.uni-kiel.de
  organization: Institut für Informatik, CAU Kiel, Kiel, Germany (e-mail: mh@informatik.uni-kiel.de)
BookMark eNp1UM9LwzAUDjLBbfoHeCt48FTNS9o0PcpwUygoqOeQpK-lY21m0h78721dwYN4eo_vFx_fiiw61yEh10DvgEJ2_wZJBlTIhDFKKcjsjCxHKI05lbD4-SGe-AuyCmE_SgRnyZLcbr1ro8LVjY16F22HzvaN6_Rhxl69q71uwyU5r_Qh4NV81-Rj-_i-eYqLl93z5qGILQfWx2gN5LLiaAynAEYn3PKykkIjlXZi05IJtBNjpbAsM1ihlDI1meAW-ZrcnHKP3n0OGHq1d4Mf-wTFMgq5oHnORhWcVNa7EDxW6uibVvsvBVRNe6g_e4wePnt0a3xT1vgb_b_rG4wpYoo
Cites_doi 10.1145/347476.347484
10.1145/321850.321859
10.1145/262009.262011
10.1145/1599410.1599420
10.1017/S1471068416000168
10.1007/978-3-642-22531-4_1
10.1007/BFb0027000
10.1007/3-540-48685-2_19
10.1007/BFb0013825
10.1016/S0743-1066(96)00068-4
10.1016/S0743-1066(98)10029-8
10.1017/CBO9781139172752
10.1007/978-3-030-98869-2_2
10.1007/978-1-4471-3560-9_18
10.1007/978-3-642-37651-1_6
10.1016/j.entcs.2008.06.037
10.1007/3-540-54444-5_84
10.1145/158511.158618
10.1007/10720084_12
10.1007/3-540-45619-8_18
10.1145/1721654.1721675
10.7551/mitpress/7160.001.0001
10.1017/S1471068411000457
10.1007/978-3-642-83189-8
10.1016/0743-1066(86)90016-6
10.1007/978-3-540-89982-2_59
10.1007/978-1-4471-3215-8_17
10.1016/0743-1066(89)90033-2
10.1007/3-540-57186-8_79
10.1007/11737414_11
10.1145/75277.75283
ContentType Journal Article
Copyright The Author(s), 2022. Published by Cambridge University Press
The Author(s), 2022. Published by Cambridge University Press. This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at: https://uk.sagepub.com/en-gb/eur/reusing-open-access-and-sage-choice-content
Copyright_xml – notice: The Author(s), 2022. Published by Cambridge University Press
– notice: The Author(s), 2022. Published by Cambridge University Press. This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the associated terms available at: https://uk.sagepub.com/en-gb/eur/reusing-open-access-and-sage-choice-content
DBID IKXGN
AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068422000187
DatabaseName Cambridge University Press Wholly Gold Open Access Journals
CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database (ProQuest)
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Proquest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Computer Science Database
Database_xml – sequence: 1
  dbid: IKXGN
  name: Cambridge University Press Wholly Gold Open Access Journals
  url: http://journals.cambridge.org/action/login
  sourceTypes: Publisher
– sequence: 2
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1475-3081
EndPage 554
ExternalDocumentID 10_1017_S1471068422000187
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAEED
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABMYL
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABZCX
ACBMC
ACCHT
ACGFS
ACIMK
ACNCT
ACQFJ
ACREK
ACUIJ
ACUYZ
ACWGA
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADGEJ
ADKIL
ADOCW
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFKSM
AFLOS
AFLVW
AFUTZ
AGABE
AGBYD
AGJUD
AGOOT
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IKXGN
IOEEP
IPYYG
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WXY
WYP
ZYDXJ
AAYXX
ABGDZ
ABVKB
ABVZP
ABXHF
ACAJB
ACDLN
AFFHD
AFZFC
AKMAY
CITATION
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
PUEGO
Q9U
ID FETCH-LOGICAL-c312t-ecb198f3ebb3011ba43c3df86ae08cecb15d26ec1ba4c86c27befe8885b763ce3
IEDL.DBID IKXGN
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000820500200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Sat Sep 06 22:12:21 EDT 2025
Sat Nov 29 04:58:37 EST 2025
Wed Mar 13 05:58:50 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords narrowing strategies
functional logic programming
transformation
resolution
Language English
License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c312t-ecb198f3ebb3011ba43c3df86ae08cecb15d26ec1ba4c86c27befe8885b763ce3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-4953-8202
OpenAccessLink https://www.cambridge.org/core/product/identifier/S1471068422000187/type/journal_article
PQID 2701960992
PQPubID 43613
PageCount 17
ParticipantIDs proquest_journals_2701960992
crossref_primary_10_1017_S1471068422000187
cambridge_journals_10_1017_S1471068422000187
PublicationCentury 2000
PublicationDate 2022-07-01
PublicationDateYYYYMMDD 2022-07-01
PublicationDate_xml – month: 07
  year: 2022
  text: 2022-07-01
  day: 01
PublicationDecade 2020
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2022
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References 2008
1986
2017; 2
1996; 1
2012; 1
2000; 4
1997; 3
2010; 4
1995; 3
1989
1999
1974; 4
S1471068422000187_ref17
S1471068422000187_ref19
S1471068422000187_ref35
S1471068422000187_ref13
S1471068422000187_ref14
S1471068422000187_ref36
S1471068422000187_ref15
S1471068422000187_ref37
S1471068422000187_ref16
S1471068422000187_ref31
S1471068422000187_ref10
S1471068422000187_ref32
S1471068422000187_ref11
Peyton Jones (S1471068422000187_ref33) 2003
S1471068422000187_ref12
S1471068422000187_ref34
S1471068422000187_ref30
(S1471068422000187_ref39) 2003; 55
Hanus (S1471068422000187_ref18) 1995; 3
S1471068422000187_ref28
S1471068422000187_ref29
S1471068422000187_ref24
S1471068422000187_ref25
S1471068422000187_ref26
S1471068422000187_ref27
S1471068422000187_ref8
S1471068422000187_ref20
S1471068422000187_ref42
S1471068422000187_ref43
S1471068422000187_ref9
S1471068422000187_ref21
S1471068422000187_ref6
S1471068422000187_ref22
S1471068422000187_ref23
S1471068422000187_ref7
S1471068422000187_ref40
S1471068422000187_ref41
S1471068422000187_ref1
S1471068422000187_ref4
S1471068422000187_ref5
S1471068422000187_ref2
Sterling (S1471068422000187_ref38) 1994
S1471068422000187_ref3
References_xml – start-page: 135
  year: 1989
  end-page: 162
  article-title: Compiling control
  publication-title: Journal of Logic Programming 6
– volume: 3
  start-page: 161
  year: 1995
  end-page: 199
  article-title: Analysis of residuating logic programs
  publication-title: Journal of Logic Programming 24
– volume: 1
  start-page: 219
  year: 2012
  end-page: 252
  article-title: An overview of Ciao and its design philosophy
  publication-title: Theory and Practice of Logic Programming 12
– volume: 4
  start-page: 776
  year: 2000
  end-page: 822
  article-title: A needed narrowing strategy
  publication-title: Journal of the ACM 47
– volume: 1
  start-page: 17
  year: 1996
  end-page: 64
  article-title: The execution algorithm of Mercury, an efficient purely declarative logic programming language
  publication-title: Journal of Logic Programming 29
– volume: 3
  start-page: 240
  year: 1997
  end-page: 263
  article-title: How to declare an imperative
  publication-title: ACM Computing Surveys 29
– volume: 2
  start-page: 121
  year: 2017
  end-page: 147
  article-title: Default rules for Curry
  publication-title: Theory and Practice of Logic Programming 17
– volume: 4
  start-page: 74
  year: 2010
  end-page: 85
  article-title: Functional logic programming
  publication-title: Communications of the ACM 53
– start-page: 47
  year: 1999
  end-page: 87
  article-title: An approach to declarative programming based on a rewriting logic
  publication-title: Journal of Logic Programming 40
– start-page: 259
  year: 1986
  end-page: 276
  article-title: A technique for doing lazy evaluation in logic
  publication-title: Journal of Logic Programming 3
– volume: 4
  start-page: 622
  year: 1974
  end-page: 642
  article-title: Automated theorem-proving for theories with simplifiers, commutativity, and associativity
  publication-title: Journal of the ACM 21
– start-page: 111
  year: 2008
  end-page: 124
  article-title: Declaring numbers
  publication-title: Electronic Notes in Theoretical Computer Science 216
– ident: S1471068422000187_ref4
  doi: 10.1145/347476.347484
– ident: S1471068422000187_ref36
  doi: 10.1145/321850.321859
– ident: S1471068422000187_ref11
– ident: S1471068422000187_ref34
– ident: S1471068422000187_ref40
– ident: S1471068422000187_ref41
  doi: 10.1145/262009.262011
– ident: S1471068422000187_ref21
– ident: S1471068422000187_ref6
  doi: 10.1145/1599410.1599420
– ident: S1471068422000187_ref8
  doi: 10.1017/S1471068416000168
– ident: S1471068422000187_ref13
  doi: 10.1007/978-3-642-22531-4_1
– ident: S1471068422000187_ref3
  doi: 10.1007/BFb0027000
– ident: S1471068422000187_ref29
  doi: 10.1007/3-540-48685-2_19
– ident: S1471068422000187_ref2
  doi: 10.1007/BFb0013825
– ident: S1471068422000187_ref37
  doi: 10.1016/S0743-1066(96)00068-4
– ident: S1471068422000187_ref17
  doi: 10.1016/S0743-1066(98)10029-8
– ident: S1471068422000187_ref23
– ident: S1471068422000187_ref9
  doi: 10.1017/CBO9781139172752
– ident: S1471068422000187_ref19
– ident: S1471068422000187_ref10
  doi: 10.1007/978-3-030-98869-2_2
– volume: 55
  volume-title: Cambridge Tracts in Theoretical Computer Science
  year: 2003
  ident: S1471068422000187_ref39
– ident: S1471068422000187_ref25
  doi: 10.1007/978-1-4471-3560-9_18
– ident: S1471068422000187_ref20
  doi: 10.1007/978-3-642-37651-1_6
– ident: S1471068422000187_ref12
  doi: 10.1016/j.entcs.2008.06.037
– ident: S1471068422000187_ref30
  doi: 10.1007/3-540-54444-5_84
– ident: S1471068422000187_ref26
  doi: 10.1145/158511.158618
– volume: 3
  start-page: 161
  year: 1995
  ident: S1471068422000187_ref18
  article-title: Analysis of residuating logic programs
  publication-title: Journal of Logic Programming 24
– ident: S1471068422000187_ref5
  doi: 10.1007/10720084_12
– ident: S1471068422000187_ref15
  doi: 10.1007/3-540-45619-8_18
– ident: S1471068422000187_ref7
  doi: 10.1145/1721654.1721675
– ident: S1471068422000187_ref43
– ident: S1471068422000187_ref1
  doi: 10.7551/mitpress/7160.001.0001
– volume-title: Haskell 98 Language and Libraries—The Revised Report
  year: 2003
  ident: S1471068422000187_ref33
– ident: S1471068422000187_ref22
  doi: 10.1017/S1471068411000457
– ident: S1471068422000187_ref27
  doi: 10.1007/978-3-642-83189-8
– ident: S1471068422000187_ref24
– ident: S1471068422000187_ref31
  doi: 10.1016/0743-1066(86)90016-6
– ident: S1471068422000187_ref35
  doi: 10.1007/978-3-540-89982-2_59
– ident: S1471068422000187_ref32
  doi: 10.1007/978-1-4471-3215-8_17
– ident: S1471068422000187_ref14
  doi: 10.1016/0743-1066(89)90033-2
– ident: S1471068422000187_ref28
  doi: 10.1007/3-540-57186-8_79
– ident: S1471068422000187_ref16
  doi: 10.1007/11737414_11
– volume-title: The Art of Prolog
  year: 1994
  ident: S1471068422000187_ref38
– ident: S1471068422000187_ref42
  doi: 10.1145/75277.75283
SSID ssj0016324
Score 2.3101797
Snippet Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Index Database
Publisher
StartPage 538
SubjectTerms Functional programming
Language
Languages
Logic programming
Logic programs
Mathematical functions
Original Article
Syntax
Transformations (mathematics)
SummonAdditionalLinks – databaseName: Computer Science Database (ProQuest)
  dbid: K7-
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60evBifWK1Sg6CIC52H9lNTyJiEJTSg0pvYXezAQ82tYn-fjPJpqUIvXidCUsY5rE7880MwKWwxjCjKEkFTYnQWUaMGA5IZqnTkhul65FC7y9qNIomk-HYJ9wKD6tsfWLtqNPcYo78luHccFndZ9jd7Ivg1iisrvoVGpuwRRmjqOfPiiyqCDiKvO4uUojuiURb1cSR0UhEGsNeFYqIuuVshdUYteqi67gTd__7x3uw62-cwX2jIvuw4aYH0G23OQTeuA_hKp7nnwHuXrZBmQdxFfCaPKGnjRskV3EEb_Hj68MT8WsUiOWUlcRZQ4dRxp0xaM1GC255mkVSu0FkkRumTDqLHBtJy5RxmatexqGpnI91_Bg603zqTiAIubSaptQxZgVXAx3KCJ8gToS8ouoe3CyEmHhjKJIGSKaSPzLvwXUr52TWDNdY93G_FfPy6KWMT9ezz2CHYeNCDbTtQ6ecf7tz2LY_5Ucxv6jV5hduJsXs
  priority: 102
  providerName: ProQuest
Title From Logic to Functional Logic Programs
URI https://www.cambridge.org/core/product/identifier/S1471068422000187/type/journal_article
https://www.proquest.com/docview/2701960992
Volume 22
WOSCitedRecordID wos000820500200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241209
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NS8MwFH_MzYMX5ydO5-hBEMTSJmmb7KiyqkxK8YvipTRpCju4ja7695v0YzoFwYOXHl5KSt4r7yV5v_d7ACeO4BxziszUQanpJFlmcmdom5lAMvEIp0lJKfR8R4OARdEwbEHU1MJoWOWS46DM5Jf90eYV_ak1SSsMjcytB6T8qq3TSLraBDFq6UtLqzZBXCt-DTpqB4NxGzq34-g6WGYYNE15WXlENfKHOU3GU9NJf5_5K-_Cavxadd9lTPK7_7eaLdis96nGRSXZhpac7kC36QFh1C5hF079fPZq6I7Nwihmhq_CZHW7WMvCCv-12IMnf_R4dWPWzRdMofRVmFJwNGQZkZxrH8AThwiSZsxLpM2EHnVT7EmhRwTzBKZcZlKdp12uXJaQZB_a09lUHoDhEk8kKEUSY-EQaieux_TBRTouUdKkB-dLJcX1ihdxBT-j8Q_N9OCssUA8ryg5fnu539joc2qsOeg9tTfGh3_79BFsYF3-UMJ1-9Au8jd5DOvivZgs8gF0LkdBeD-of7UBrI2pqZ6h-_IB4lHgCw
linkProvider Cambridge University Press
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qFfRifWK1ag6KIAab3c2jBxFRQ0tr6aFK8RKzmw14sKlNVPxT_kZ38mgpQm89eJ0Jy5J57ezOfANwwgTnhNuGHjAj0JkfhjpnjboeCkP6FuW2n0IKPXXsbtcZDBq9EvwUvTBYVln4xNRRB5HAO_JLgrjhljrPkOvRu45To_B1tRihkalFW35_qZQtvmrdKfmeEuLe92-bej5VQBfUIIkuBVeJdkgl56jc3GdU0CB0LF_WHYFcMyCWFMgRjiWIzWUoVaJocmWLQlK17hIsM6aSJWU_PfN58mqB0OdpN5ON1UQOK15REaIaiUgj2BtjYAXfFMthNibOhoQ0zrmV__aHNmA9P1FrN5kJbEJJDregUkyr0HLntQ1n7jh603C2tNCSSHNVQM_uQXNaL6tUi3fgcSHb3YXyMBrKPdBMagnfCAxJiGDUrvum5WCKJZlJFdWvwsVEaF5u7LGXFcrZ3h8ZV-G8kKs3ysBD5n1cK8Q6XXoq0_357GNYbfYfOl6n1W0fwBrBJo20qLgG5WT8IQ9hRXwmr_H4KFVZDV4WrQG_HgknTw
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=From+Logic+to+Functional+Logic+Programs&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=HANUS%2C+MICHAEL&rft.date=2022-07-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=22&rft.issue=4&rft.spage=538&rft.epage=554&rft_id=info:doi/10.1017%2FS1471068422000187&rft.externalDocID=10_1017_S1471068422000187
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon