Automatic Generation of Propagation Rules for Finite Domains View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2000

AUTHORS

Slim Abdennadher , Christophe Rigotti

ABSTRACT

A general approach to specify the propagation and simplification process of constraints consists of applying rules over these constraints. In this paper, we propose a method for generating propagation rules for constraints over finite domains defined extensionally by e.g. a truth table or their tuples. Using our algorithm, the user has the possibility to specify the admissible syntactic forms of the rules. The generated rules will be implemented as rules of the language Constraint Handling Rules (CHR). Furthermore, we show that our approach performs well on various examples, including Boolean constraints, three valued logic, Allen’s qualitative approach to temporal logic and qualitative spatial reasoning with the Region Connection Calculus. More... »

PAGES

18-34

References to SciGraph publications

  • 2005-06-10. Operational semantics and confluence of constraint propagation rules in PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP97
  • Book

    TITLE

    Principles and Practice of Constraint Programming – CP 2000

    ISBN

    978-3-540-41053-9
    978-3-540-45349-9

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/3-540-45349-0_4

    DOI

    http://dx.doi.org/10.1007/3-540-45349-0_4

    DIMENSIONS

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


    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/0806", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information Systems", 
            "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/s0306-4379(99)00003-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000463430"
            ], 
            "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": "sg:pub.10.1007/bfb0017444", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010989701", 
              "https://doi.org/10.1007/bfb0017444"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/bfb0017444", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1010989701", 
              "https://doi.org/10.1007/bfb0017444"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1145/182.358434", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018860881"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2000", 
        "datePublishedReg": "2000-01-01", 
        "description": "A general approach to specify the propagation and simplification process of constraints consists of applying rules over these constraints. In this paper, we propose a method for generating propagation rules for constraints over finite domains defined extensionally by e.g. a truth table or their tuples. Using our algorithm, the user has the possibility to specify the admissible syntactic forms of the rules. The generated rules will be implemented as rules of the language Constraint Handling Rules (CHR). Furthermore, we show that our approach performs well on various examples, including Boolean constraints, three valued logic, Allen\u2019s qualitative approach to temporal logic and qualitative spatial reasoning with the Region Connection Calculus.", 
        "editor": [
          {
            "familyName": "Dechter", 
            "givenName": "Rina", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/3-540-45349-0_4", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": true, 
        "isPartOf": {
          "isbn": [
            "978-3-540-41053-9", 
            "978-3-540-45349-9"
          ], 
          "name": "Principles and Practice of Constraint Programming \u2013 CP 2000", 
          "type": "Book"
        }, 
        "name": "Automatic Generation of Propagation Rules for Finite Domains", 
        "pagination": "18-34", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/3-540-45349-0_4"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "e0bf782d54e81d2b52cdb127bc63225b0e1d41ee8c45fb3c0311c537356981c2"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1047179793"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/3-540-45349-0_4", 
          "https://app.dimensions.ai/details/publication/pub.1047179793"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-15T22:01", 
        "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_8693_00000272.jsonl", 
        "type": "Chapter", 
        "url": "http://link.springer.com/10.1007/3-540-45349-0_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-45349-0_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-45349-0_4'

    Turtle is a human-readable linked data format.

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


     

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

    88 TRIPLES      23 PREDICATES      31 URIs      20 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/3-540-45349-0_4 schema:about anzsrc-for:08
    2 anzsrc-for:0806
    3 schema:author Na0572e3b684041f8a7a847c9d5ea88d8
    4 schema:citation sg:pub.10.1007/bfb0017444
    5 https://doi.org/10.1016/0743-1066(94)90035-3
    6 https://doi.org/10.1016/s0306-4379(99)00003-4
    7 https://doi.org/10.1145/182.358434
    8 schema:datePublished 2000
    9 schema:datePublishedReg 2000-01-01
    10 schema:description A general approach to specify the propagation and simplification process of constraints consists of applying rules over these constraints. In this paper, we propose a method for generating propagation rules for constraints over finite domains defined extensionally by e.g. a truth table or their tuples. Using our algorithm, the user has the possibility to specify the admissible syntactic forms of the rules. The generated rules will be implemented as rules of the language Constraint Handling Rules (CHR). Furthermore, we show that our approach performs well on various examples, including Boolean constraints, three valued logic, Allen’s qualitative approach to temporal logic and qualitative spatial reasoning with the Region Connection Calculus.
    11 schema:editor Nf57f7bd98c334ed88478e2fd1d47a769
    12 schema:genre chapter
    13 schema:inLanguage en
    14 schema:isAccessibleForFree true
    15 schema:isPartOf N91cadf927b974399a9a745ce752053b9
    16 schema:name Automatic Generation of Propagation Rules for Finite Domains
    17 schema:pagination 18-34
    18 schema:productId N5f555f61a9db44c393ed2317974e428a
    19 Na92c7940989940cf835c744c81de5761
    20 Nbdceb80ddd66480084ea1bfc42ac0f79
    21 schema:publisher Nd0b4c75d8a5f46f8a56f0e16f4731f1e
    22 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047179793
    23 https://doi.org/10.1007/3-540-45349-0_4
    24 schema:sdDatePublished 2019-04-15T22:01
    25 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    26 schema:sdPublisher N1923d80250c9489ca5e1f0867627fd17
    27 schema:url http://link.springer.com/10.1007/3-540-45349-0_4
    28 sgo:license sg:explorer/license/
    29 sgo:sdDataset chapters
    30 rdf:type schema:Chapter
    31 N1923d80250c9489ca5e1f0867627fd17 schema:name Springer Nature - SN SciGraph project
    32 rdf:type schema:Organization
    33 N5f555f61a9db44c393ed2317974e428a schema:name readcube_id
    34 schema:value e0bf782d54e81d2b52cdb127bc63225b0e1d41ee8c45fb3c0311c537356981c2
    35 rdf:type schema:PropertyValue
    36 N91cadf927b974399a9a745ce752053b9 schema:isbn 978-3-540-41053-9
    37 978-3-540-45349-9
    38 schema:name Principles and Practice of Constraint Programming – CP 2000
    39 rdf:type schema:Book
    40 Na0572e3b684041f8a7a847c9d5ea88d8 rdf:first sg:person.010445445574.13
    41 rdf:rest Ncb1d3f7f53154a5ab148c554bd681463
    42 Na92c7940989940cf835c744c81de5761 schema:name doi
    43 schema:value 10.1007/3-540-45349-0_4
    44 rdf:type schema:PropertyValue
    45 Nba0cab16428a4a3690b460b77791d2cc schema:familyName Dechter
    46 schema:givenName Rina
    47 rdf:type schema:Person
    48 Nbdceb80ddd66480084ea1bfc42ac0f79 schema:name dimensions_id
    49 schema:value pub.1047179793
    50 rdf:type schema:PropertyValue
    51 Ncb1d3f7f53154a5ab148c554bd681463 rdf:first sg:person.016577712467.20
    52 rdf:rest rdf:nil
    53 Nd0b4c75d8a5f46f8a56f0e16f4731f1e schema:location Berlin, Heidelberg
    54 schema:name Springer Berlin Heidelberg
    55 rdf:type schema:Organisation
    56 Nf57f7bd98c334ed88478e2fd1d47a769 rdf:first Nba0cab16428a4a3690b460b77791d2cc
    57 rdf:rest rdf:nil
    58 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    59 schema:name Information and Computing Sciences
    60 rdf:type schema:DefinedTerm
    61 anzsrc-for:0806 schema:inDefinedTermSet anzsrc-for:
    62 schema:name Information Systems
    63 rdf:type schema:DefinedTerm
    64 sg:person.010445445574.13 schema:affiliation https://www.grid.ac/institutes/grid.5252.0
    65 schema:familyName Abdennadher
    66 schema:givenName Slim
    67 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010445445574.13
    68 rdf:type schema:Person
    69 sg:person.016577712467.20 schema:affiliation https://www.grid.ac/institutes/grid.15399.37
    70 schema:familyName Rigotti
    71 schema:givenName Christophe
    72 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016577712467.20
    73 rdf:type schema:Person
    74 sg:pub.10.1007/bfb0017444 schema:sameAs https://app.dimensions.ai/details/publication/pub.1010989701
    75 https://doi.org/10.1007/bfb0017444
    76 rdf:type schema:CreativeWork
    77 https://doi.org/10.1016/0743-1066(94)90035-3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1002893202
    78 rdf:type schema:CreativeWork
    79 https://doi.org/10.1016/s0306-4379(99)00003-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000463430
    80 rdf:type schema:CreativeWork
    81 https://doi.org/10.1145/182.358434 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018860881
    82 rdf:type schema:CreativeWork
    83 https://www.grid.ac/institutes/grid.15399.37 schema:alternateName Institut National des Sciences Appliquées de Lyon
    84 schema:name Laboratoire d’Ingénierie des Systèmes d’Information, Bâtiment 501, INSA Lyon, 69621 Villeurbanne Cedex, France
    85 rdf:type schema:Organization
    86 https://www.grid.ac/institutes/grid.5252.0 schema:alternateName Ludwig Maximilian University of Munich
    87 schema:name Computer Science Department, University of Munich, Oettingenstr. 67, 80538 München, Germany
    88 rdf:type schema:Organization
     




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


    ...