Ontology type: schema:Chapter Open Access: True
1996
AUTHORSMaría García de la Banda , Manuel Hermenegildo , Kim Marriott
ABSTRACTThe notion of independence has been used in conventional logic programming as the basis for several optimizations, including program parallelization, intelligent backtracking, and goal reordering. In this paper we extend this notion to logic programming languages with dynamic scheduling. This type of scheduling, in which some calls are dynamically “delayed” until their arguments are sufficiently instantiated, is provided in most practical implementations because it offers advantages for both programming power and declarativeness. We focus on the notion of independence required for ensuring correctness and efficiency of parallelization within the independent and-parallel model. We also provide sufficient conditions for independence which can be evaluated “a-priori” (i.e., at run-time), as is needed in many practical applications. More... »
PAGES47-61
Algebraic and Logic Programming
ISBN
978-3-540-61735-8
978-3-540-70672-4
http://scigraph.springernature.com/pub.10.1007/3-540-61735-3_3
DOIhttp://dx.doi.org/10.1007/3-540-61735-3_3
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1000660206
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Information and Computing Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Computation Theory and Mathematics",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0803",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Computer Software",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Monash University, 3168, Clayton, VIC, Australia",
"id": "http://www.grid.ac/institutes/grid.1002.3",
"name": [
"Monash University, 3168, Clayton, VIC, Australia"
],
"type": "Organization"
},
"familyName": "de la Banda",
"givenName": "Mar\u00eda Garc\u00eda",
"id": "sg:person.016350443307.93",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016350443307.93"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Universidad Polit\u00e9cnica de Madrid, 28660, Boadilla del Monte, Spain",
"id": "http://www.grid.ac/institutes/grid.5690.a",
"name": [
"Universidad Polit\u00e9cnica de Madrid, 28660, Boadilla del Monte, Spain"
],
"type": "Organization"
},
"familyName": "Hermenegildo",
"givenName": "Manuel",
"id": "sg:person.016231041373.11",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016231041373.11"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Monash University, 3168, Clayton, VIC, Australia",
"id": "http://www.grid.ac/institutes/grid.1002.3",
"name": [
"Monash University, 3168, Clayton, VIC, Australia"
],
"type": "Organization"
},
"familyName": "Marriott",
"givenName": "Kim",
"id": "sg:person.014375607254.44",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014375607254.44"
],
"type": "Person"
}
],
"datePublished": "1996",
"datePublishedReg": "1996-01-01",
"description": "The notion of independence has been used in conventional logic programming as the basis for several optimizations, including program parallelization, intelligent backtracking, and goal reordering. In this paper we extend this notion to logic programming languages with dynamic scheduling. This type of scheduling, in which some calls are dynamically \u201cdelayed\u201d until their arguments are sufficiently instantiated, is provided in most practical implementations because it offers advantages for both programming power and declarativeness. We focus on the notion of independence required for ensuring correctness and efficiency of parallelization within the independent and-parallel model. We also provide sufficient conditions for independence which can be evaluated \u201ca-priori\u201d (i.e., at run-time), as is needed in many practical applications.",
"editor": [
{
"familyName": "Hanus",
"givenName": "Michael",
"type": "Person"
},
{
"familyName": "Rodr\u00edguez-Artalejo",
"givenName": "Mario",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/3-540-61735-3_3",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-540-61735-8",
"978-3-540-70672-4"
],
"name": "Algebraic and Logic Programming",
"type": "Book"
},
"keywords": [
"logic programming language",
"conventional logic programming",
"efficiency of parallelization",
"type of scheduling",
"program parallelization",
"intelligent backtracking",
"programming language",
"logic programming",
"logic language",
"dynamic scheduling",
"most practical implementations",
"parallel model",
"notion of independence",
"parallelization",
"programming power",
"scheduling",
"practical implementation",
"language",
"declarativeness",
"backtracking",
"practical applications",
"correctness",
"programming",
"implementation",
"optimization",
"notion",
"applications",
"advantages",
"goal",
"calls",
"efficiency",
"model",
"independence",
"power",
"sufficient conditions",
"basis",
"types",
"argument",
"conditions",
"paper"
],
"name": "Independence in dynamically scheduled logic languages",
"pagination": "47-61",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1000660206"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/3-540-61735-3_3"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/3-540-61735-3_3",
"https://app.dimensions.ai/details/publication/pub.1000660206"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:47",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_320.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/3-540-61735-3_3"
}
]
Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-61735-3_3'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-61735-3_3'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-61735-3_3'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-61735-3_3'
This table displays all metadata directly associated to this object as RDF triples.
126 TRIPLES
23 PREDICATES
67 URIs
59 LITERALS
7 BLANK NODES
Subject | Predicate | Object | |
---|---|---|---|
1 | sg:pub.10.1007/3-540-61735-3_3 | schema:about | anzsrc-for:08 |
2 | ″ | ″ | anzsrc-for:0802 |
3 | ″ | ″ | anzsrc-for:0803 |
4 | ″ | schema:author | N74082dc0d7f24b1b99d37b2255f5ce3c |
5 | ″ | schema:datePublished | 1996 |
6 | ″ | schema:datePublishedReg | 1996-01-01 |
7 | ″ | schema:description | The notion of independence has been used in conventional logic programming as the basis for several optimizations, including program parallelization, intelligent backtracking, and goal reordering. In this paper we extend this notion to logic programming languages with dynamic scheduling. This type of scheduling, in which some calls are dynamically “delayed” until their arguments are sufficiently instantiated, is provided in most practical implementations because it offers advantages for both programming power and declarativeness. We focus on the notion of independence required for ensuring correctness and efficiency of parallelization within the independent and-parallel model. We also provide sufficient conditions for independence which can be evaluated “a-priori” (i.e., at run-time), as is needed in many practical applications. |
8 | ″ | schema:editor | N640f7eddc38545a9afd7f32e09062bef |
9 | ″ | schema:genre | chapter |
10 | ″ | schema:inLanguage | en |
11 | ″ | schema:isAccessibleForFree | true |
12 | ″ | schema:isPartOf | Nc2cd98460906429c8b647673bc579073 |
13 | ″ | schema:keywords | advantages |
14 | ″ | ″ | applications |
15 | ″ | ″ | argument |
16 | ″ | ″ | backtracking |
17 | ″ | ″ | basis |
18 | ″ | ″ | calls |
19 | ″ | ″ | conditions |
20 | ″ | ″ | conventional logic programming |
21 | ″ | ″ | correctness |
22 | ″ | ″ | declarativeness |
23 | ″ | ″ | dynamic scheduling |
24 | ″ | ″ | efficiency |
25 | ″ | ″ | efficiency of parallelization |
26 | ″ | ″ | goal |
27 | ″ | ″ | implementation |
28 | ″ | ″ | independence |
29 | ″ | ″ | intelligent backtracking |
30 | ″ | ″ | language |
31 | ″ | ″ | logic language |
32 | ″ | ″ | logic programming |
33 | ″ | ″ | logic programming language |
34 | ″ | ″ | model |
35 | ″ | ″ | most practical implementations |
36 | ″ | ″ | notion |
37 | ″ | ″ | notion of independence |
38 | ″ | ″ | optimization |
39 | ″ | ″ | paper |
40 | ″ | ″ | parallel model |
41 | ″ | ″ | parallelization |
42 | ″ | ″ | power |
43 | ″ | ″ | practical applications |
44 | ″ | ″ | practical implementation |
45 | ″ | ″ | program parallelization |
46 | ″ | ″ | programming |
47 | ″ | ″ | programming language |
48 | ″ | ″ | programming power |
49 | ″ | ″ | scheduling |
50 | ″ | ″ | sufficient conditions |
51 | ″ | ″ | type of scheduling |
52 | ″ | ″ | types |
53 | ″ | schema:name | Independence in dynamically scheduled logic languages |
54 | ″ | schema:pagination | 47-61 |
55 | ″ | schema:productId | N5cf7d5df34bc4b4b8f5a8b0c57ee6224 |
56 | ″ | ″ | Nc94ef48581d144a1a3aeee44d191b95c |
57 | ″ | schema:publisher | Nacffa25eabcc4b199b2d93af43c74f34 |
58 | ″ | schema:sameAs | https://app.dimensions.ai/details/publication/pub.1000660206 |
59 | ″ | ″ | https://doi.org/10.1007/3-540-61735-3_3 |
60 | ″ | schema:sdDatePublished | 2022-05-10T10:47 |
61 | ″ | schema:sdLicense | https://scigraph.springernature.com/explorer/license/ |
62 | ″ | schema:sdPublisher | N36460435442e47daa46b6660dd9029e7 |
63 | ″ | schema:url | https://doi.org/10.1007/3-540-61735-3_3 |
64 | ″ | sgo:license | sg:explorer/license/ |
65 | ″ | sgo:sdDataset | chapters |
66 | ″ | rdf:type | schema:Chapter |
67 | N36460435442e47daa46b6660dd9029e7 | schema:name | Springer Nature - SN SciGraph project |
68 | ″ | rdf:type | schema:Organization |
69 | N418b36fa1d0545fc977d5f81c3a32a58 | rdf:first | sg:person.014375607254.44 |
70 | ″ | rdf:rest | rdf:nil |
71 | N4407a2cdf92f464faf0bd5e5fe3fd3fb | schema:familyName | Rodríguez-Artalejo |
72 | ″ | schema:givenName | Mario |
73 | ″ | rdf:type | schema:Person |
74 | N5cf7d5df34bc4b4b8f5a8b0c57ee6224 | schema:name | doi |
75 | ″ | schema:value | 10.1007/3-540-61735-3_3 |
76 | ″ | rdf:type | schema:PropertyValue |
77 | N640f7eddc38545a9afd7f32e09062bef | rdf:first | N7495033edba94e609190ac11e20e9353 |
78 | ″ | rdf:rest | N998ce0471166453286b149404704a352 |
79 | N74082dc0d7f24b1b99d37b2255f5ce3c | rdf:first | sg:person.016350443307.93 |
80 | ″ | rdf:rest | Nae2cf6f70c4345708d6b7886ff343cf7 |
81 | N7495033edba94e609190ac11e20e9353 | schema:familyName | Hanus |
82 | ″ | schema:givenName | Michael |
83 | ″ | rdf:type | schema:Person |
84 | N998ce0471166453286b149404704a352 | rdf:first | N4407a2cdf92f464faf0bd5e5fe3fd3fb |
85 | ″ | rdf:rest | rdf:nil |
86 | Nacffa25eabcc4b199b2d93af43c74f34 | schema:name | Springer Nature |
87 | ″ | rdf:type | schema:Organisation |
88 | Nae2cf6f70c4345708d6b7886ff343cf7 | rdf:first | sg:person.016231041373.11 |
89 | ″ | rdf:rest | N418b36fa1d0545fc977d5f81c3a32a58 |
90 | Nc2cd98460906429c8b647673bc579073 | schema:isbn | 978-3-540-61735-8 |
91 | ″ | ″ | 978-3-540-70672-4 |
92 | ″ | schema:name | Algebraic and Logic Programming |
93 | ″ | rdf:type | schema:Book |
94 | Nc94ef48581d144a1a3aeee44d191b95c | schema:name | dimensions_id |
95 | ″ | schema:value | pub.1000660206 |
96 | ″ | rdf:type | schema:PropertyValue |
97 | anzsrc-for:08 | schema:inDefinedTermSet | anzsrc-for: |
98 | ″ | schema:name | Information and Computing Sciences |
99 | ″ | rdf:type | schema:DefinedTerm |
100 | anzsrc-for:0802 | schema:inDefinedTermSet | anzsrc-for: |
101 | ″ | schema:name | Computation Theory and Mathematics |
102 | ″ | rdf:type | schema:DefinedTerm |
103 | anzsrc-for:0803 | schema:inDefinedTermSet | anzsrc-for: |
104 | ″ | schema:name | Computer Software |
105 | ″ | rdf:type | schema:DefinedTerm |
106 | sg:person.014375607254.44 | schema:affiliation | grid-institutes:grid.1002.3 |
107 | ″ | schema:familyName | Marriott |
108 | ″ | schema:givenName | Kim |
109 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014375607254.44 |
110 | ″ | rdf:type | schema:Person |
111 | sg:person.016231041373.11 | schema:affiliation | grid-institutes:grid.5690.a |
112 | ″ | schema:familyName | Hermenegildo |
113 | ″ | schema:givenName | Manuel |
114 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016231041373.11 |
115 | ″ | rdf:type | schema:Person |
116 | sg:person.016350443307.93 | schema:affiliation | grid-institutes:grid.1002.3 |
117 | ″ | schema:familyName | de la Banda |
118 | ″ | schema:givenName | María García |
119 | ″ | schema:sameAs | https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016350443307.93 |
120 | ″ | rdf:type | schema:Person |
121 | grid-institutes:grid.1002.3 | schema:alternateName | Monash University, 3168, Clayton, VIC, Australia |
122 | ″ | schema:name | Monash University, 3168, Clayton, VIC, Australia |
123 | ″ | rdf:type | schema:Organization |
124 | grid-institutes:grid.5690.a | schema:alternateName | Universidad Politécnica de Madrid, 28660, Boadilla del Monte, Spain |
125 | ″ | schema:name | Universidad Politécnica de Madrid, 28660, Boadilla del Monte, Spain |
126 | ″ | rdf:type | schema:Organization |