The Branching-Time Transformation Technique for Chain Datalog Programs

The branching-time transformation technique has proven to be an efficient approach for implementing functional programming languages. In this paper we demonstrate that such a technique can also be defined for logic programming languages. More specifically, we first introduce Branching Datalog, a lan...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of intelligent information systems Ročník 17; číslo 1; s. 71 - 94
Hlavní autoři: Rondogiannis, Panos, Gergatsoulis, Manolis
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.11.2001
Témata:
ISSN:0925-9902, 1573-7675
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract The branching-time transformation technique has proven to be an efficient approach for implementing functional programming languages. In this paper we demonstrate that such a technique can also be defined for logic programming languages. More specifically, we first introduce Branching Datalog, a language that can be considered as the basis for branching-temporal deductive databases. We then present a transformation algorithm from Chain Datalog programs to the class of unary Branching Datalog programs with at most one IDB atom in the body of each clause. In this way, we obtain a novel implementation approach for Chain Datalog, shedding at the same time new light on the power of branching-time logic programming. [PUBLICATION ABSTRACT]
AbstractList The branching-time transformation technique has proven to be an efficient approach for implementing functional programming languages. In this paper we demonstrate that such a technique can also be defined for logic programming languages. More specifically, we first introduce Branching Datalog, a language that can be considered as the basis for branching-temporal deductive databases. We then present a transformation algorithm from Chain Datalog programs to the class of unary Branching Datalog programs with at most one IDB atom in the body of each clause. In this way, we obtain a novel implementation approach for Chain Datalog, shedding at the same time new light on the power of branching-time logic programming. [PUBLICATION ABSTRACT]
Author Gergatsoulis, Manolis
Rondogiannis, Panos
Author_xml – sequence: 1
  givenname: Panos
  surname: Rondogiannis
  fullname: Rondogiannis, Panos
– sequence: 2
  givenname: Manolis
  surname: Gergatsoulis
  fullname: Gergatsoulis, Manolis
BookMark eNp1kDFPwzAQhS1UJNrCzBqxh57t2InZSmkBqRIMYbYc125cNXax04F_T6AsIDGd7vS-u3dvgkY-eIPQNYZbDITO5ncYMGFAKgDB8RkaY1bSvOQlG6ExCMJyIYBcoElKOxg0FYcxWtWtye6j8rp1fpvXrjNZPbTJhtip3gWf1Ua33r0fTTbMskWrnM8eVK_2YZu9xrCNqkuX6NyqfTJXP3WK3lbLevGUr18enxfzda4J531eaFVUGCjnrKENpZZAWdgShALegDIWLOViw_Cm0GVjK10AcA0bIrDgpqJ0im5Oew8xDI5SL3fhGP1wUhIAXGFBy0HETiIdQ0rRWKld__1LH5XbSwzyKzE5l78SG7jZH-4QXafix7_EJ_EAbMI
CitedBy_id crossref_primary_10_1016_j_tcs_2005_05_014
Cites_doi 10.1007/3-540-62064-8_36
10.1145/73007.73018
10.1007/3-540-58402-1_24
10.1017/S0956796897002633
10.1142/S0129054199000253
10.1145/960114.29659
10.1145/235809.235814
10.1111/j.1467-8640.1996.tb00261.x
10.1016/S0096-0551(98)00009-5
10.1007/BFb0014004
10.1145/28659.28682
10.1017/S0956796899003445
10.1145/308386.308469
10.1016/0743-1066(91)90038-Q
10.1145/153724.153752
10.1016/0743-1066(94)00027-4
10.1007/3-540-52592-0_71
10.1007/978-3-642-83189-8
10.1007/BF01762108
10.1016/0743-1066(94)00030-A
ContentType Journal Article
Copyright Copyright Kluwer Academic Publishers Nov 2001
Copyright_xml – notice: Copyright Kluwer Academic Publishers Nov 2001
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
8AL
8FD
8FE
8FG
8FK
8FL
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L7M
L~C
L~D
M0C
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
Q9U
DOI 10.1023/A:1012502800961
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI-INFORM Complete
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
AUTh Library subscriptions: ProQuest Central
Business Premium Collection
Technology collection
ProQuest One Community College
ProQuest Central
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
ProQuest advanced technologies & aerospace journals
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic
ProQuest One Academic Middle East (New)
ProQuest One Business (UW System Shared)
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
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
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Business Premium Collection (Alumni)
DatabaseTitleList ABI/INFORM Global (Corporate)
Database_xml – sequence: 1
  dbid: BENPR
  name: AUTh Library subscriptions: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1573-7675
EndPage 94
ExternalDocumentID 352547631
10_1023_A_1012502800961
Genre Feature
GroupedDBID -Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
2.D
203
28-
29K
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
7WY
8FE
8FG
8FL
8FW
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYXX
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFSG
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSTC
ACZOJ
ADHHG
ADHIR
ADHKG
ADKFA
ADKNI
ADKPE
ADMLS
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFFHD
AFGCZ
AFHIU
AFKRA
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
AZQEC
B-.
BA0
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
CITATION
COF
CS3
CSCUP
D-I
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EDO
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ7
GQ8
GROUPED_ABI_INFORM_RESEARCH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
KOW
LAK
LLZTM
M0C
M4Y
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9O
PF0
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PT4
PT5
Q2X
QOK
QOS
R4E
R89
R9I
RHV
RNI
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
ZMTXR
~EX
3V.
7SC
7XB
8AL
8FD
8FK
AESKC
JQ2
L.-
L7M
L~C
L~D
M0N
PKEHL
PQEST
PQUKI
Q9U
ID FETCH-LOGICAL-c266t-4ca48103665b3b33f2074f709a06b0aef0f369d51d4c7bf8c4006c0d29196e833
IEDL.DBID BENPR
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000171927500004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-9902
IngestDate Tue Nov 04 17:01:21 EST 2025
Sat Nov 29 07:49:14 EST 2025
Tue Nov 18 21:33:58 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://www.springernature.com/gp/researchers/text-and-data-mining
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c266t-4ca48103665b3b33f2074f709a06b0aef0f369d51d4c7bf8c4006c0d29196e833
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 200181937
PQPubID 30807
PageCount 24
ParticipantIDs proquest_journals_200181937
crossref_citationtrail_10_1023_A_1012502800961
crossref_primary_10_1023_A_1012502800961
PublicationCentury 2000
PublicationDate 2001-11-00
PublicationDateYYYYMMDD 2001-11-01
PublicationDate_xml – month: 11
  year: 2001
  text: 2001-11-00
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Journal of intelligent information systems
PublicationYear 2001
Publisher Springer Nature B.V
Publisher_xml – name: Springer Nature B.V
References C. Beeri (381665_CR6) 1991; 10
P. Rondogiannis (381665_CR23) 1998; 24
J.D. Ullman (381665_CR30) 1988; 3
P. Rondogiannis (381665_CR25) 1999; 9
G. Dong (381665_CR8) 1995; 23
D. Saccà (381665_CR26) 1988; 4
381665_CR11
M.A. Orgun (381665_CR20) 1996; 12
A. Faustini (381665_CR10) 1987; 22
381665_CR12
381665_CR13
J.W. Lloyd (381665_CR17) 1987
381665_CR31
381665_CR18
381665_CR15
J. Chomicki (381665_CR7) 1995; 25
381665_CR16
J.D. Ullman (381665_CR29) 1989
P. Rondogiannis (381665_CR24) 1997; 7
W. Du (381665_CR9) 1990; 20
381665_CR1
381665_CR2
381665_CR3
A. Yaghi (381665_CR32) 1984
381665_CR5
381665_CR21
381665_CR22
S. Sippu (381665_CR27) 1996; 43
S. Greco (381665_CR14) 1999; 10
F. Afrati (381665_CR4) 1993; 40
M.A. Orgun (381665_CR19) 1991
381665_CR28
References_xml – volume: 4
  start-page: 187
  issue: 4
  year: 1988
  ident: 381665_CR26
  publication-title: Theoretical Computer Science
– ident: 381665_CR2
  doi: 10.1007/3-540-62064-8_36
– ident: 381665_CR1
  doi: 10.1145/73007.73018
– volume-title: Intensional Logic Programming
  year: 1991
  ident: 381665_CR19
– ident: 381665_CR12
  doi: 10.1007/3-540-58402-1_24
– ident: 381665_CR18
– ident: 381665_CR16
– volume: 7
  start-page: 73
  issue: 1
  year: 1997
  ident: 381665_CR24
  publication-title: Journal of Functional Programming
  doi: 10.1017/S0956796897002633
– volume: 10
  start-page: 349
  issue: 3
  year: 1999
  ident: 381665_CR14
  publication-title: International Journal on Foundations of Computer Science
  doi: 10.1142/S0129054199000253
– volume: 22
  start-page: 86
  issue: 7
  year: 1987
  ident: 381665_CR10
  publication-title: SIGPLAN Notices
  doi: 10.1145/960114.29659
– volume: 43
  start-page: 1046
  issue: 6
  year: 1996
  ident: 381665_CR27
  publication-title: Journal of the ACM
  doi: 10.1145/235809.235814
– ident: 381665_CR28
– volume: 12
  start-page: 259
  issue: 2
  year: 1996
  ident: 381665_CR20
  publication-title: Computational Intelligence
  doi: 10.1111/j.1467-8640.1996.tb00261.x
– volume: 24
  start-page: 155
  issue: 3
  year: 1998
  ident: 381665_CR23
  publication-title: Computer Languages
  doi: 10.1016/S0096-0551(98)00009-5
– ident: 381665_CR21
  doi: 10.1007/BFb0014004
– volume-title: Principles of Database and Knowledge-Base Systems, Vols. I & II
  year: 1989
  ident: 381665_CR29
– volume-title: The Intensional Implementation Technique for Functional Languages
  year: 1984
  ident: 381665_CR32
– ident: 381665_CR3
  doi: 10.1145/28659.28682
– volume: 9
  start-page: 527
  issue: 5
  year: 1999
  ident: 381665_CR25
  publication-title: Journal of Functional Programming
  doi: 10.1017/S0956796899003445
– ident: 381665_CR15
  doi: 10.1145/308386.308469
– ident: 381665_CR31
– ident: 381665_CR13
– volume: 10
  start-page: 255
  issue: 1-4
  year: 1991
  ident: 381665_CR6
  publication-title: The Journal of Logic Programming
  doi: 10.1016/0743-1066(91)90038-Q
– volume: 40
  start-page: 891
  issue: 3
  year: 1993
  ident: 381665_CR4
  publication-title: Journal of the ACM
  doi: 10.1145/153724.153752
– volume: 23
  start-page: 203
  issue: 3
  year: 1995
  ident: 381665_CR8
  publication-title: The Journal of Logic Programming
  doi: 10.1016/0743-1066(94)00027-4
– ident: 381665_CR11
– ident: 381665_CR22
  doi: 10.1007/3-540-52592-0_71
– volume-title: Foundations of Logic Programming
  year: 1987
  ident: 381665_CR17
  doi: 10.1007/978-3-642-83189-8
– ident: 381665_CR5
– volume: 20
  start-page: 1097
  issue: 11
  year: 1990
  ident: 381665_CR9
  publication-title: Software-Practice and Experience
– volume: 3
  start-page: 5
  year: 1988
  ident: 381665_CR30
  publication-title: Algorithmica
  doi: 10.1007/BF01762108
– volume: 25
  start-page: 1
  issue: 1
  year: 1995
  ident: 381665_CR7
  publication-title: The Journal of Logic Programming
  doi: 10.1016/0743-1066(94)00030-A
SSID ssj0009860
Score 1.5743474
Snippet The branching-time transformation technique has proven to be an efficient approach for implementing functional programming languages. In this paper we...
SourceID proquest
crossref
SourceType Aggregation Database
Enrichment Source
Index Database
StartPage 71
SubjectTerms Algorithms
Informatics
Logic programming
Optimization techniques
Programming languages
Queries
Semantics
Studies
Temporal logic
Title The Branching-Time Transformation Technique for Chain Datalog Programs
URI https://www.proquest.com/docview/200181937
Volume 17
WOSCitedRecordID wos000171927500004&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: ABI-INFORM Complete
  customDbUrl:
  eissn: 1573-7675
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009860
  issn: 0925-9902
  databaseCode: 7WY
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 1573-7675
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009860
  issn: 0925-9902
  databaseCode: M0C
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: AUTh Library subscriptions: ProQuest Central
  customDbUrl:
  eissn: 1573-7675
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009860
  issn: 0925-9902
  databaseCode: BENPR
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1573-7675
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009860
  issn: 0925-9902
  databaseCode: K7-
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest advanced technologies & aerospace journals
  customDbUrl:
  eissn: 1573-7675
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009860
  issn: 0925-9902
  databaseCode: P5Z
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-7675
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009860
  issn: 0925-9902
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NT8IwFG8UPHgRPyOipAcPXqplXdftZAAhJiohBiN6WdaujSRmIKB_v6-jQzHRi5cm-8yyvq--vvf7IXSqAi15kkYkiBJYoDCekoSnhoiEJlRoJUyYNwrfil4vHA6jvqvNmbmyysIm5oY6HSubI7-wtT_gvZi4nLwRSxplN1cdg8Y6KlugMhDzcqvT699_oe6GeZswjTxOwOx6P7B9wLnbnUXLerLqllatcu5qupV_fuQ22nIxJm4uhGIHrelsF1UK_gbs1HkPdUFGcMsya9g0FLHdIHjwLZAdZ3hQQLxiOIfbL8kow1eLjA_uL0q7ZvvoodsZtK-J41UgCtzxnPgWybwBrivgkknGjAdxhBE0SmggaaINNSyIUt5IfSWkCRXoeaBo6kWgrjpk7ACVsnGmDxG2AYD0fG04BFZcSgiCTRrC62VD-Z7mVXRe_NZYOdBxy33xGueb3x6Lm_HKPFTR2fKByQJv4_dba8UkxE7xZvFyBo7-vFpDm3kxWd5UeIxK8-m7PkEb6mM-mk3raF08PtWdMMHRjSAw3tE2jH3-_AkCf9Fs
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5EBb34Fmt97EHBy-p2k83jIKKtRbGWHip4i9nNLhYkrW1V_FH-R2fzUCvozYPXJBtIZvab2Xl9AHvK01LESUi9MMYDiiMSGovEUD9mMfO18k2QNQq3_HY7uL0NO1PwVvbC2LLKEhMzoE76ysbIj2ztD1ovxz8ZPFJLGmWTqyWDRq4VV_r1BU9so-PLBop3n_Pmebd-QQtSAarQFo2pa8d41xC3PSEd6TiGoxE1Pgtj5kkWa8OM44WJqCWu8qUJFCq5p1jCQ9RVHdj4JyL-jIvnLrutrln9c8ZvkDUls5ALiiDPv00SQlfC5jEtx8qkEZy0AZlhay7-s1-yBAuFB01Oc5VfhimdrsBiyU5BCrBahSbuAHJmeUNskI3aXhfS_eKm91PSLQfYErxG6vdxLyWNPJ5FOnnh2mgNbv7ka9ZhOu2negOIdW8kd7UR6DYKKdHFN0mAr5c15XItKnBYijFSxUh1y-zxEGWpfe5Ep9GE3Ctw8LFgkE8T-fnRain0qICVUfQh8c1f7-7C3EX3uhW1LttXVZjPyuay9sktmB4Pn_Q2zKrncW803MkUmMDdX6vHO2UNJxI
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5KFfFifaLWxx4UvKymm2weB5FqLRZL6aFC8RKzm10sSKptVfxp_jtn86hW0JsHr0k2kOy338zOzswHcCBdJXgUB9QNItyg2DymEY819SIrsjwlPe2nhcJtr9Px-_2gW4L3ohbGpFUWnJgSdTyUJkZ-YnJ_0HrZ3onOsyK6jebZ4xM1AlLmoLVQ08gQcq3eXnH3Nj5tNXCqDxlrXvYurmguMEAl2qUJdUxL7xpyuMuFLWxbMzSo2rOCyHKFFSltadsNYl6LHekJ7UsEvCutmAWIW-WbWCiy_5znuL7JJuvy289-v35aoGwFjFMkfPatqxC6FeZM0-itzBrEWXuQGrlm5R__nmVYyj1rUs-WwgqUVLIKlUK1guQktgZNXBnk3OiJmOAbNTUwpPfFfR8mpFc0tiV4jVzcR4OENLI4F-lmCW3jdbj5k6_ZgHIyTNQmEOP2COYozdGd5EKg669jH18vatJhim_BcTGlocxbrRvFj4cwPfJndlgPZzCwBUfTAY9Zl5GfH60WAAhzuhmH09nf_vXuPiwgKsJ2q3NdhcU0my6tqtyB8mT0rHZhXr5MBuPRXoplAnd_jY4POWkwIg
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=The+Branching-Time+Transformation+Technique+for+Chain+Datalog+Programs&rft.jtitle=Journal+of+intelligent+information+systems&rft.au=Rondogiannis%2C+Panos&rft.au=Gergatsoulis%2C+Manolis&rft.date=2001-11-01&rft.pub=Springer+Nature+B.V&rft.issn=0925-9902&rft.eissn=1573-7675&rft.volume=17&rft.issue=1&rft.spage=71&rft_id=info:doi/10.1023%2FA%3A1012502800961&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=352547631
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-9902&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-9902&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-9902&client=summon