Towards Inductive Constraint Solving View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2001

AUTHORS

Slim Abdennadher , Christophe Rigotti

ABSTRACT

A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation rules [5],[17],[3] and simplification rules [4] for constraints defined over finite domains have been proposed. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite. This approach can be seen as a concrete step towards Inductive Constraint Solving. More... »

PAGES

31-45

References to SciGraph publications

Book

TITLE

Principles and Practice of Constraint Programming — CP 2001

ISBN

978-3-540-42863-3
978-3-540-45578-3

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/3-540-45578-7_3

DOI

http://dx.doi.org/10.1007/3-540-45578-7_3

DIMENSIONS

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


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/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }, 
      {
        "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"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Ludwig Maximilian University of Munich", 
          "id": "https://www.grid.ac/institutes/grid.5252.0", 
          "name": [
            "Computer Science Department, University of Munich, Oettingenstr. 67, 80538\u00a0M\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": "Institut National des Sciences Appliqu\u00e9es de Lyon", 
          "id": "https://www.grid.ac/institutes/grid.15399.37", 
          "name": [
            "Laboratoire d\u2019Ing\u00e9nierie des Syst\u00e8mes d\u2019Information, B\u00e2timent 501, INSA Lyon, 69621\u00a0Villeurbanne Cedex, France"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Rigotti", 
        "givenName": "Christophe", 
        "id": "sg:person.016577712467.20", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016577712467.20"
        ], 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "https://doi.org/10.1016/s0743-1066(98)10005-5", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1000275719"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0743-1066(94)90035-3", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1002893202"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0743-1066(94)90033-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1004885944"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/s0743-1066(98)10006-7", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1014830724"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf03037230", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020684666", 
          "https://doi.org/10.1007/bf03037230"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/bf03037230", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1020684666", 
          "https://doi.org/10.1007/bf03037230"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "https://doi.org/10.1016/0743-1066(93)90047-k", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1033004420"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2001", 
    "datePublishedReg": "2001-01-01", 
    "description": "A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation rules [5],[17],[3] and simplification rules [4] for constraints defined over finite domains have been proposed. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite. This approach can be seen as a concrete step towards Inductive Constraint Solving.", 
    "editor": [
      {
        "familyName": "Walsh", 
        "givenName": "Toby", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/3-540-45578-7_3", 
    "inLanguage": [
      "en"
    ], 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-540-42863-3", 
        "978-3-540-45578-3"
      ], 
      "name": "Principles and Practice of Constraint Programming \u2014 CP 2001", 
      "type": "Book"
    }, 
    "name": "Towards Inductive Constraint Solving", 
    "pagination": "31-45", 
    "productId": [
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/3-540-45578-7_3"
        ]
      }, 
      {
        "name": "readcube_id", 
        "type": "PropertyValue", 
        "value": [
          "5f2a156d49ff8ee91415c80146dbd291b6062588f40e8b188822901ab4817bbd"
        ]
      }, 
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1019972995"
        ]
      }
    ], 
    "publisher": {
      "location": "Berlin, Heidelberg", 
      "name": "Springer Berlin Heidelberg", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/3-540-45578-7_3", 
      "https://app.dimensions.ai/details/publication/pub.1019972995"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2019-04-15T19:08", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000001_0000000264/records_8684_00000255.jsonl", 
    "type": "Chapter", 
    "url": "http://link.springer.com/10.1007/3-540-45578-7_3"
  }
]
 

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-45578-7_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-45578-7_3'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-45578-7_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-45578-7_3'


 

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

94 TRIPLES      23 PREDICATES      33 URIs      20 LITERALS      8 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/3-540-45578-7_3 schema:about anzsrc-for:08
2 anzsrc-for:0801
3 schema:author N5e516794c73c44dcbd660b603e1499b9
4 schema:citation sg:pub.10.1007/bf03037230
5 https://doi.org/10.1016/0743-1066(93)90047-k
6 https://doi.org/10.1016/0743-1066(94)90033-7
7 https://doi.org/10.1016/0743-1066(94)90035-3
8 https://doi.org/10.1016/s0743-1066(98)10005-5
9 https://doi.org/10.1016/s0743-1066(98)10006-7
10 schema:datePublished 2001
11 schema:datePublishedReg 2001-01-01
12 schema:description A difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation and simplification algorithm. In previous work, different methods for automatic generation of propagation rules [5],[17],[3] and simplification rules [4] for constraints defined over finite domains have been proposed. In this paper, we present a method for generating rule-based solvers for constraint predicates defined by means of a constraint logic program, even when the constraint domain is infinite. This approach can be seen as a concrete step towards Inductive Constraint Solving.
13 schema:editor Ne8dc1cc67ecd4e8691d7c313f3d18785
14 schema:genre chapter
15 schema:inLanguage en
16 schema:isAccessibleForFree true
17 schema:isPartOf N61f94c17903a483c8dfc6a86de195caf
18 schema:name Towards Inductive Constraint Solving
19 schema:pagination 31-45
20 schema:productId N7488fc29aa3e46dfa95a2f5817dcd9f8
21 Nad28ca986ae7488483cb688e36bd833e
22 Nb42e26ff4e374368b170f080ae55ebb6
23 schema:publisher Nbbdbd4cdfc9541dfa94fd6d238f52629
24 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019972995
25 https://doi.org/10.1007/3-540-45578-7_3
26 schema:sdDatePublished 2019-04-15T19:08
27 schema:sdLicense https://scigraph.springernature.com/explorer/license/
28 schema:sdPublisher N1b4de370466947348db35562076ba5ce
29 schema:url http://link.springer.com/10.1007/3-540-45578-7_3
30 sgo:license sg:explorer/license/
31 sgo:sdDataset chapters
32 rdf:type schema:Chapter
33 N17a6368b13ab4ef3a07b27e82a08a0a7 rdf:first sg:person.016577712467.20
34 rdf:rest rdf:nil
35 N1b4de370466947348db35562076ba5ce schema:name Springer Nature - SN SciGraph project
36 rdf:type schema:Organization
37 N5e516794c73c44dcbd660b603e1499b9 rdf:first sg:person.010445445574.13
38 rdf:rest N17a6368b13ab4ef3a07b27e82a08a0a7
39 N61f94c17903a483c8dfc6a86de195caf schema:isbn 978-3-540-42863-3
40 978-3-540-45578-3
41 schema:name Principles and Practice of Constraint Programming — CP 2001
42 rdf:type schema:Book
43 N7488fc29aa3e46dfa95a2f5817dcd9f8 schema:name readcube_id
44 schema:value 5f2a156d49ff8ee91415c80146dbd291b6062588f40e8b188822901ab4817bbd
45 rdf:type schema:PropertyValue
46 Nad28ca986ae7488483cb688e36bd833e schema:name doi
47 schema:value 10.1007/3-540-45578-7_3
48 rdf:type schema:PropertyValue
49 Nb3f0aa95fc9c4bad831dc038507db10a schema:familyName Walsh
50 schema:givenName Toby
51 rdf:type schema:Person
52 Nb42e26ff4e374368b170f080ae55ebb6 schema:name dimensions_id
53 schema:value pub.1019972995
54 rdf:type schema:PropertyValue
55 Nbbdbd4cdfc9541dfa94fd6d238f52629 schema:location Berlin, Heidelberg
56 schema:name Springer Berlin Heidelberg
57 rdf:type schema:Organisation
58 Ne8dc1cc67ecd4e8691d7c313f3d18785 rdf:first Nb3f0aa95fc9c4bad831dc038507db10a
59 rdf:rest rdf:nil
60 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
61 schema:name Information and Computing Sciences
62 rdf:type schema:DefinedTerm
63 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
64 schema:name Artificial Intelligence and Image Processing
65 rdf:type schema:DefinedTerm
66 sg:person.010445445574.13 schema:affiliation https://www.grid.ac/institutes/grid.5252.0
67 schema:familyName Abdennadher
68 schema:givenName Slim
69 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010445445574.13
70 rdf:type schema:Person
71 sg:person.016577712467.20 schema:affiliation https://www.grid.ac/institutes/grid.15399.37
72 schema:familyName Rigotti
73 schema:givenName Christophe
74 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016577712467.20
75 rdf:type schema:Person
76 sg:pub.10.1007/bf03037230 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020684666
77 https://doi.org/10.1007/bf03037230
78 rdf:type schema:CreativeWork
79 https://doi.org/10.1016/0743-1066(93)90047-k schema:sameAs https://app.dimensions.ai/details/publication/pub.1033004420
80 rdf:type schema:CreativeWork
81 https://doi.org/10.1016/0743-1066(94)90033-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004885944
82 rdf:type schema:CreativeWork
83 https://doi.org/10.1016/0743-1066(94)90035-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002893202
84 rdf:type schema:CreativeWork
85 https://doi.org/10.1016/s0743-1066(98)10005-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000275719
86 rdf:type schema:CreativeWork
87 https://doi.org/10.1016/s0743-1066(98)10006-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1014830724
88 rdf:type schema:CreativeWork
89 https://www.grid.ac/institutes/grid.15399.37 schema:alternateName Institut National des Sciences Appliquées de Lyon
90 schema:name Laboratoire d’Ingénierie des Systèmes d’Information, Bâtiment 501, INSA Lyon, 69621 Villeurbanne Cedex, France
91 rdf:type schema:Organization
92 https://www.grid.ac/institutes/grid.5252.0 schema:alternateName Ludwig Maximilian University of Munich
93 schema:name Computer Science Department, University of Munich, Oettingenstr. 67, 80538 München, Germany
94 rdf:type schema:Organization
 




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


...