On Completion of Constraint Handling Rules View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

1998

AUTHORS

Slim Abdennadher , Thom Frühwirth

ABSTRACT

Constraint Handling Rules (CHR) is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers. An important property of any constraint solver is confluence: The result of a computation should be independent from the order in which constraints arrive and in which rules are applied. In previous work [1], a sufficient and necessary condition for the confluence of terminating CHR programs was given by adapting and extending results about conditional term rewriting systems. In this paper we investigate so-called completion methods that make a non-confluent CHR program confluent by adding new rules. As it turns out, completion can also exhibit inconsistency of a CHR program. Moreover, as shown in this paper, completion can be used to define new constraints in terms of already existing constraints and to derive constraint solvers for them. More... »

PAGES

25-39

Book

TITLE

Principles and Practice of Constraint Programming — CP98

ISBN

978-3-540-65224-3
978-3-540-49481-2

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-49481-2_4

DOI

http://dx.doi.org/10.1007/3-540-49481-2_4

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1053677545


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Computer Science Institute, University of Munich Oettingenstr, 67, 80538, M\u00fcnchen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.5252.0", 
          "name": [
            "Computer Science Institute, University of Munich Oettingenstr, 67, 80538, M\u00fcnchen, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Abdennadher", 
        "givenName": "Slim", 
        "id": "sg:person.010445445574.13", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010445445574.13"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Computer Science Institute, University of Munich Oettingenstr, 67, 80538, M\u00fcnchen, Germany", 
          "id": "http://www.grid.ac/institutes/grid.5252.0", 
          "name": [
            "Computer Science Institute, University of Munich Oettingenstr, 67, 80538, M\u00fcnchen, Germany"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Fr\u00fchwirth", 
        "givenName": "Thom", 
        "id": "sg:person.013750414271.15", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013750414271.15"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1998", 
    "datePublishedReg": "1998-01-01", 
    "description": "Constraint Handling Rules (CHR) is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers. An important property of any constraint solver is confluence: The result of a computation should be independent from the order in which constraints arrive and in which rules are applied. In previous work [1], a sufficient and necessary condition for the confluence of terminating CHR programs was given by adapting and extending results about conditional term rewriting systems. In this paper we investigate so-called completion methods that make a non-confluent CHR program confluent by adding new rules. As it turns out, completion can also exhibit inconsistency of a CHR program. Moreover, as shown in this paper, completion can be used to define new constraints in terms of already existing constraints and to derive constraint solvers for them.", 
    "editor": [
      {
        "familyName": "Maher", 
        "givenName": "Michael", 
        "type": "Person"
      }, 
      {
        "familyName": "Puget", 
        "givenName": "Jean-Francois", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-49481-2_4", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-65224-3", 
        "978-3-540-49481-2"
      ], 
      "name": "Principles and Practice of Constraint Programming \u2014 CP98", 
      "type": "Book"
    }, 
    "keywords": [
      "Constraint Handling Rules", 
      "constraint solver", 
      "Handling Rules", 
      "CHR programs", 
      "high-level language", 
      "completion method", 
      "conditional term", 
      "solver", 
      "constraints", 
      "previous work", 
      "new rules", 
      "rules", 
      "important properties", 
      "computation", 
      "new constraints", 
      "language", 
      "scratch", 
      "system", 
      "terms", 
      "program", 
      "inconsistencies", 
      "work", 
      "necessary condition", 
      "order", 
      "method", 
      "results", 
      "completion", 
      "confluence", 
      "properties", 
      "conditions", 
      "confluent", 
      "paper", 
      "non-confluent CHR program confluent", 
      "CHR program confluent", 
      "program confluent"
    ], 
    "name": "On Completion of Constraint Handling Rules", 
    "pagination": "25-39", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1053677545"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-49481-2_4"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-49481-2_4", 
      "https://app.dimensions.ai/details/publication/pub.1053677545"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T19:03", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211101/entities/gbq_results/chapter/chapter_75.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-49481-2_4"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

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-49481-2_4'

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-49481-2_4'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-49481-2_4'

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-49481-2_4'


 

This table displays all metadata directly associated to this object as RDF triples.

107 TRIPLES      23 PREDICATES      61 URIs      54 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-49481-2_4 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author Nf0ae7f1c2ef34c6aa8630cc9a6d09331
4 schema:datePublished 1998
5 schema:datePublishedReg 1998-01-01
6 schema:description Constraint Handling Rules (CHR) is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers. An important property of any constraint solver is confluence: The result of a computation should be independent from the order in which constraints arrive and in which rules are applied. In previous work [1], a sufficient and necessary condition for the confluence of terminating CHR programs was given by adapting and extending results about conditional term rewriting systems. In this paper we investigate so-called completion methods that make a non-confluent CHR program confluent by adding new rules. As it turns out, completion can also exhibit inconsistency of a CHR program. Moreover, as shown in this paper, completion can be used to define new constraints in terms of already existing constraints and to derive constraint solvers for them.
7 schema:editor Na599392d2f24488e865fd761fae29d2c
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf N2b3406f0b96445ff9ac58ef5810c3b5c
12 schema:keywords CHR program confluent
13 CHR programs
14 Constraint Handling Rules
15 Handling Rules
16 completion
17 completion method
18 computation
19 conditional term
20 conditions
21 confluence
22 confluent
23 constraint solver
24 constraints
25 high-level language
26 important properties
27 inconsistencies
28 language
29 method
30 necessary condition
31 new constraints
32 new rules
33 non-confluent CHR program confluent
34 order
35 paper
36 previous work
37 program
38 program confluent
39 properties
40 results
41 rules
42 scratch
43 solver
44 system
45 terms
46 work
47 schema:name On Completion of Constraint Handling Rules
48 schema:pagination 25-39
49 schema:productId N1ab502979bbf4d5185a653f94c3c943f
50 Nd1a7a730f5bc45189be6288ba9df9d45
51 schema:publisher N530192c60050461db2d6c9fec1441534
52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053677545
53 https://doi.org/10.1007/3-540-49481-2_4
54 schema:sdDatePublished 2021-11-01T19:03
55 schema:sdLicense https://scigraph.springernature.com/explorer/license/
56 schema:sdPublisher N1bc272918bcd4db380dca8f8fa1243f7
57 schema:url https://doi.org/10.1007/3-540-49481-2_4
58 sgo:license sg:explorer/license/
59 sgo:sdDataset chapters
60 rdf:type schema:Chapter
61 N1ab502979bbf4d5185a653f94c3c943f schema:name doi
62 schema:value 10.1007/3-540-49481-2_4
63 rdf:type schema:PropertyValue
64 N1bc272918bcd4db380dca8f8fa1243f7 schema:name Springer Nature - SN SciGraph project
65 rdf:type schema:Organization
66 N2b3406f0b96445ff9ac58ef5810c3b5c schema:isbn 978-3-540-49481-2
67 978-3-540-65224-3
68 schema:name Principles and Practice of Constraint Programming — CP98
69 rdf:type schema:Book
70 N4bc71455f42346efa6a55c168086482d rdf:first sg:person.013750414271.15
71 rdf:rest rdf:nil
72 N4e4eea820f5343ea9a7d2e4cb7990431 rdf:first N6e42572b39a744e9bbc1d96ff92967ec
73 rdf:rest rdf:nil
74 N530192c60050461db2d6c9fec1441534 schema:name Springer Nature
75 rdf:type schema:Organisation
76 N6e42572b39a744e9bbc1d96ff92967ec schema:familyName Puget
77 schema:givenName Jean-Francois
78 rdf:type schema:Person
79 Na599392d2f24488e865fd761fae29d2c rdf:first Nc741d1cd2834479c96dfd0629eed662a
80 rdf:rest N4e4eea820f5343ea9a7d2e4cb7990431
81 Nc741d1cd2834479c96dfd0629eed662a schema:familyName Maher
82 schema:givenName Michael
83 rdf:type schema:Person
84 Nd1a7a730f5bc45189be6288ba9df9d45 schema:name dimensions_id
85 schema:value pub.1053677545
86 rdf:type schema:PropertyValue
87 Nf0ae7f1c2ef34c6aa8630cc9a6d09331 rdf:first sg:person.010445445574.13
88 rdf:rest N4bc71455f42346efa6a55c168086482d
89 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
90 schema:name Information and Computing Sciences
91 rdf:type schema:DefinedTerm
92 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
93 schema:name Artificial Intelligence and Image Processing
94 rdf:type schema:DefinedTerm
95 sg:person.010445445574.13 schema:affiliation grid-institutes:grid.5252.0
96 schema:familyName Abdennadher
97 schema:givenName Slim
98 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010445445574.13
99 rdf:type schema:Person
100 sg:person.013750414271.15 schema:affiliation grid-institutes:grid.5252.0
101 schema:familyName Frühwirth
102 schema:givenName Thom
103 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013750414271.15
104 rdf:type schema:Person
105 grid-institutes:grid.5252.0 schema:alternateName Computer Science Institute, University of Munich Oettingenstr, 67, 80538, München, Germany
106 schema:name Computer Science Institute, University of Munich Oettingenstr, 67, 80538, München, Germany
107 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...