A PROLOG CONSTRAINT HANDLING RULES COMPILER AND RUNTIME SYSTEM.
Saved in:
| 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 |
Be the first to leave a comment!
