View in EDS PDF Full Text

A PROLOG CONSTRAINT HANDLING RULES COMPILER AND RUNTIME SYSTEM.

Saved in:
Bibliographic Details
Title: A PROLOG CONSTRAINT HANDLING RULES COMPILER AND RUNTIME SYSTEM.
Authors: Holzbaur, Christian, Fruhwirth, Thom
Source: Applied Artificial Intelligence. Apr2000, Vol. 14 Issue 4, p369-388. 20p. 2 Graphs.
Subjects: Constraint satisfaction, Logic programming languages
Abstract: The most recent and advanced implementation of constraint handling rules (CHR) is introduced in a logic programming language. The Prolog implementation consists of a runtime system and a compiler. The runtime system utilizes attributed variables for the realization of the constraint store with efficient retrieval and update mechanisms. Rules describing the interactions between constraints are compiled into Prolog clauses by a compiler, the core of which comprises a small number of compact code generating templates in the form of definite clause grammar rules. [ABSTRACT FROM AUTHOR]
Copyright of Applied Artificial Intelligence is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 3837953
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A PROLOG CONSTRAINT HANDLING RULES COMPILER AND RUNTIME SYSTEM.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Holzbaur%2C+Christian%22">Holzbaur, Christian</searchLink><br /><searchLink fieldCode="AR" term="%22Fruhwirth%2C+Thom%22">Fruhwirth, Thom</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Applied+Artificial+Intelligence%22">Applied Artificial Intelligence</searchLink>. Apr2000, Vol. 14 Issue 4, p369-388. 20p. 2 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Constraint+satisfaction%22">Constraint satisfaction</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+programming+languages%22">Logic programming languages</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The most recent and advanced implementation of constraint handling rules (CHR) is introduced in a logic programming language. The Prolog implementation consists of a runtime system and a compiler. The runtime system utilizes attributed variables for the realization of the constraint store with efficient retrieval and update mechanisms. Rules describing the interactions between constraints are compiled into Prolog clauses by a compiler, the core of which comprises a small number of compact code generating templates in the form of definite clause grammar rules. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Applied Artificial Intelligence is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=3837953
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/088395100117043
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 20
        StartPage: 369
    Subjects:
      – SubjectFull: Constraint satisfaction
        Type: general
      – SubjectFull: Logic programming languages
        Type: general
    Titles:
      – TitleFull: A PROLOG CONSTRAINT HANDLING RULES COMPILER AND RUNTIME SYSTEM.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Holzbaur, Christian
      – PersonEntity:
          Name:
            NameFull: Fruhwirth, Thom
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2000
              Type: published
              Y: 2000
          Identifiers:
            – Type: issn-print
              Value: 08839514
          Numbering:
            – Type: volume
              Value: 14
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Applied Artificial Intelligence
              Type: main
ResultId 1