Constraint handling rules View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

1995

AUTHORS

Thom Frühwirth

ABSTRACT

We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination of constraint solvers. In our approach, constraint evaluation is specified using multi-headed guarded clauses called constraint handling rules (CHRs). CHRs define determinate conditional rewrite systems that express how conjunctions of constraints propagate and simplify.In this paper we concentrate on CHRs as an extension for constraint logic programming languages. Into such languages, the CHRs can be tightly integrated. They can make use of any hard-wired solvers already built into the host language. Program clauses can be used to specify the non deterministic behavior of constraints, i.e. to introduce search by constraints. In this way our approach merges the advantages of constraints (eager simplification by CHRs) and predicates (lazy choices by clauses). More... »

PAGES

90-107

Book

TITLE

Constraint Programming: Basics and Trends

ISBN

978-3-540-59155-9
978-3-540-49200-9

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-59155-9_6

DOI

http://dx.doi.org/10.1007/3-540-59155-9_6

DIMENSIONS

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


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/0803", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computer Software", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "ECRC, Arabellastrasse 17, D-81925, Munich, Germany", 
          "id": "http://www.grid.ac/institutes/None", 
          "name": [
            "ECRC, Arabellastrasse 17, D-81925, Munich, 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": "1995", 
    "datePublishedReg": "1995-01-01", 
    "description": "We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination of constraint solvers. In our approach, constraint evaluation is specified using multi-headed guarded clauses called constraint handling rules (CHRs). CHRs define determinate conditional rewrite systems that express how conjunctions of constraints propagate and simplify.In this paper we concentrate on CHRs as an extension for constraint logic programming languages. Into such languages, the CHRs can be tightly integrated. They can make use of any hard-wired solvers already built into the host language. Program clauses can be used to specify the non deterministic behavior of constraints, i.e. to introduce search by constraints. In this way our approach merges the advantages of constraints (eager simplification by CHRs) and predicates (lazy choices by clauses).", 
    "editor": [
      {
        "familyName": "Podelski", 
        "givenName": "Andreas", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-59155-9_6", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-59155-9", 
        "978-3-540-49200-9"
      ], 
      "name": "Constraint Programming: Basics and Trends", 
      "type": "Book"
    }, 
    "keywords": [
      "Constraint Handling Rules", 
      "constraint solver", 
      "Handling Rules", 
      "constraint logic programming language", 
      "constraint evaluation", 
      "logic programming language", 
      "advantage of constraints", 
      "conjunction of constraints", 
      "non deterministic behaviour", 
      "declarative formalism", 
      "programming language", 
      "conditional rewrite systems", 
      "host language", 
      "program clauses", 
      "logical formulas", 
      "such languages", 
      "deterministic behavior", 
      "rewrite systems", 
      "solver", 
      "language", 
      "constraints", 
      "prototyping", 
      "rules", 
      "same time", 
      "predicates", 
      "constraint theory", 
      "extension", 
      "representation", 
      "clauses", 
      "search", 
      "system", 
      "advantages", 
      "evaluation", 
      "formalism", 
      "way", 
      "use", 
      "class", 
      "time", 
      "conjunction", 
      "combination", 
      "theory", 
      "specialization", 
      "behavior", 
      "formula", 
      "approach", 
      "paper", 
      "determinate conditional rewrite systems", 
      "hard-wired solvers"
    ], 
    "name": "Constraint handling rules", 
    "pagination": "90-107", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1039095944"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-59155-9_6"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-59155-9_6", 
      "https://app.dimensions.ai/details/publication/pub.1039095944"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-11-01T18:54", 
    "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_292.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/3-540-59155-9_6"
  }
]
 

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-59155-9_6'

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-59155-9_6'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-59155-9_6'

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-59155-9_6'


 

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

108 TRIPLES      23 PREDICATES      74 URIs      67 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-59155-9_6 schema:about anzsrc-for:08
2 anzsrc-for:0803
3 schema:author N9c02f55fec964e4798f569d37a045259
4 schema:datePublished 1995
5 schema:datePublishedReg 1995-01-01
6 schema:description We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination of constraint solvers. In our approach, constraint evaluation is specified using multi-headed guarded clauses called constraint handling rules (CHRs). CHRs define determinate conditional rewrite systems that express how conjunctions of constraints propagate and simplify.In this paper we concentrate on CHRs as an extension for constraint logic programming languages. Into such languages, the CHRs can be tightly integrated. They can make use of any hard-wired solvers already built into the host language. Program clauses can be used to specify the non deterministic behavior of constraints, i.e. to introduce search by constraints. In this way our approach merges the advantages of constraints (eager simplification by CHRs) and predicates (lazy choices by clauses).
7 schema:editor N69b6e2100e3f4d80b5afc35f284c97bf
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf N833f603cdd464eedafce529442bd2d93
12 schema:keywords Constraint Handling Rules
13 Handling Rules
14 advantage of constraints
15 advantages
16 approach
17 behavior
18 class
19 clauses
20 combination
21 conditional rewrite systems
22 conjunction
23 conjunction of constraints
24 constraint evaluation
25 constraint logic programming language
26 constraint solver
27 constraint theory
28 constraints
29 declarative formalism
30 determinate conditional rewrite systems
31 deterministic behavior
32 evaluation
33 extension
34 formalism
35 formula
36 hard-wired solvers
37 host language
38 language
39 logic programming language
40 logical formulas
41 non deterministic behaviour
42 paper
43 predicates
44 program clauses
45 programming language
46 prototyping
47 representation
48 rewrite systems
49 rules
50 same time
51 search
52 solver
53 specialization
54 such languages
55 system
56 theory
57 time
58 use
59 way
60 schema:name Constraint handling rules
61 schema:pagination 90-107
62 schema:productId N2c6776c56d5141018fa5800367442939
63 N3b5d67862acb466d81e9fcd8d2ca9692
64 schema:publisher N44b95d0082144f88a06daa6248166299
65 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039095944
66 https://doi.org/10.1007/3-540-59155-9_6
67 schema:sdDatePublished 2021-11-01T18:54
68 schema:sdLicense https://scigraph.springernature.com/explorer/license/
69 schema:sdPublisher Nac3ed57d7d064c21b93ee4d4ecea8a85
70 schema:url https://doi.org/10.1007/3-540-59155-9_6
71 sgo:license sg:explorer/license/
72 sgo:sdDataset chapters
73 rdf:type schema:Chapter
74 N2c6776c56d5141018fa5800367442939 schema:name doi
75 schema:value 10.1007/3-540-59155-9_6
76 rdf:type schema:PropertyValue
77 N3b5d67862acb466d81e9fcd8d2ca9692 schema:name dimensions_id
78 schema:value pub.1039095944
79 rdf:type schema:PropertyValue
80 N44b95d0082144f88a06daa6248166299 schema:name Springer Nature
81 rdf:type schema:Organisation
82 N69b6e2100e3f4d80b5afc35f284c97bf rdf:first Nd7882def1bb543899cbe59e5e56c18ac
83 rdf:rest rdf:nil
84 N833f603cdd464eedafce529442bd2d93 schema:isbn 978-3-540-49200-9
85 978-3-540-59155-9
86 schema:name Constraint Programming: Basics and Trends
87 rdf:type schema:Book
88 N9c02f55fec964e4798f569d37a045259 rdf:first sg:person.013750414271.15
89 rdf:rest rdf:nil
90 Nac3ed57d7d064c21b93ee4d4ecea8a85 schema:name Springer Nature - SN SciGraph project
91 rdf:type schema:Organization
92 Nd7882def1bb543899cbe59e5e56c18ac schema:familyName Podelski
93 schema:givenName Andreas
94 rdf:type schema:Person
95 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
96 schema:name Information and Computing Sciences
97 rdf:type schema:DefinedTerm
98 anzsrc-for:0803 schema:inDefinedTermSet anzsrc-for:
99 schema:name Computer Software
100 rdf:type schema:DefinedTerm
101 sg:person.013750414271.15 schema:affiliation grid-institutes:None
102 schema:familyName Frühwirth
103 schema:givenName Thom
104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013750414271.15
105 rdf:type schema:Person
106 grid-institutes:None schema:alternateName ECRC, Arabellastrasse 17, D-81925, Munich, Germany
107 schema:name ECRC, Arabellastrasse 17, D-81925, Munich, Germany
108 rdf:type schema:Organization
 




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


...