1999
AUTHORSBart Demoen , Maria García de la Banda , Warwick Harvey , Kim Marriott , Peter Stuckey
ABSTRACTExperience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides a well-defined solver interface, mutable global variables for implementing a constraint store, and dynamic scheduling for combining, extending and writing new constraint solvers. Equally importantly, HAL supports semi-optional type, mode and determinism declarations. These allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code. More... »
PAGES174-188
Principles and Practice of Constraint Programming – CP’99
ISBN
978-3-540-66626-4
978-3-540-48085-3
http://scigraph.springernature.com/pub.10.1007/978-3-540-48085-3_13
DOIhttp://dx.doi.org/10.1007/978-3-540-48085-3_13
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1018859956
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": "Dept. of Computer Science, K.U.Leuven, Belgium",
"id": "http://www.grid.ac/institutes/grid.5596.f",
"name": [
"Dept. of Computer Science, K.U.Leuven, Belgium"
],
"type": "Organization"
},
"familyName": "Demoen",
"givenName": "Bart",
"id": "sg:person.016365417761.57",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016365417761.57"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "School of Computer Science & Software Engineering, Monash University, Australia",
"id": "http://www.grid.ac/institutes/grid.1002.3",
"name": [
"School of Computer Science & Software Engineering, Monash University, Australia"
],
"type": "Organization"
},
"familyName": "de la Banda",
"givenName": "Maria Garc\u00eda",
"id": "sg:person.016350443307.93",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016350443307.93"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "School of Computer Science & Software Engineering, Monash University, Australia",
"id": "http://www.grid.ac/institutes/grid.1002.3",
"name": [
"School of Computer Science & Software Engineering, Monash University, Australia"
],
"type": "Organization"
},
"familyName": "Harvey",
"givenName": "Warwick",
"id": "sg:person.016110070307.54",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016110070307.54"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "School of Computer Science & Software Engineering, Monash University, Australia",
"id": "http://www.grid.ac/institutes/grid.1002.3",
"name": [
"School of Computer Science & Software Engineering, Monash University, 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"
},
{
"affiliation": {
"alternateName": "Dept. of Computer Science & Software Engineering, University of Melbourne, Australia",
"id": "http://www.grid.ac/institutes/grid.1008.9",
"name": [
"Dept. of Computer Science & Software Engineering, University of Melbourne, Australia"
],
"type": "Organization"
},
"familyName": "Stuckey",
"givenName": "Peter",
"id": "sg:person.012243374043.93",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012243374043.93"
],
"type": "Person"
}
],
"datePublished": "1999",
"datePublishedReg": "1999-01-01",
"description": "Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides a well-defined solver interface, mutable global variables for implementing a constraint store, and dynamic scheduling for combining, extending and writing new constraint solvers. Equally importantly, HAL supports semi-optional type, mode and determinism declarations. These allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code.",
"editor": [
{
"familyName": "Jaffar",
"givenName": "Joxan",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-540-48085-3_13",
"inLanguage": "en",
"isAccessibleForFree": true,
"isPartOf": {
"isbn": [
"978-3-540-66626-4",
"978-3-540-48085-3"
],
"name": "Principles and Practice of Constraint Programming \u2013 CP\u201999",
"type": "Book"
},
"keywords": [
"constraint solver",
"efficient run-time code",
"constraint logic programming language",
"new constraint logic programming language",
"run-time code",
"logic programming language",
"new constraint solver",
"determinism declarations",
"real-life problems",
"different constraint solvers",
"constraint store",
"solver interface",
"constraint programming",
"constraint specification",
"programming language",
"dynamic scheduling",
"error checking",
"efficient solution",
"global variables",
"solver",
"checking",
"scheduling",
"programming",
"specification",
"language",
"code",
"experimentation",
"interface",
"stores",
"overloading",
"solution",
"overview",
"generation",
"process",
"experience",
"means",
"HAL",
"types",
"Declaration",
"mode",
"variables",
"problem"
],
"name": "An Overview of HAL",
"pagination": "174-188",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1018859956"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-540-48085-3_13"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-540-48085-3_13",
"https://app.dimensions.ai/details/publication/pub.1018859956"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-20T07:42",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_148.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-540-48085-3_13"
}
]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/978-3-540-48085-3_13'
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/978-3-540-48085-3_13'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-48085-3_13'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-48085-3_13'
This table displays all metadata directly associated to this object as RDF triples.
140 TRIPLES
23 PREDICATES
69 URIs
61 LITERALS
7 BLANK NODES