Compiling Constraint Handling Rules into Prolog with Attributed Variables | Zendy

Christian Holzbaur | Zendy; Thom Frühwirth | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Compiling Constraint Handling Rules into Prolog with Attributed Variables

Author(s) -

Christian Holzbaur,

Thom Frühwirth

Publication year - 1999

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-66540-4

DOI - 10.1007/10704567_7

Subject(s) - prolog , computer science , programming language , compiler , constraint programming , logic programming , implementation , constraint logic programming , constraint (computer aided design) , combinatory logic , theoretical computer science , constraint satisfaction , mathematics , artificial intelligence , statistics , geometry , probabilistic logic , stochastic programming

We introduce the most recent and advanced implementation of constraint handling rules (CHR) in a logic programming language, which improves both on previous implementations (in terms of completeness, flexibility and efficiency) and on the principles that should guide such a Prolog implementation consisting 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 multi-phase compiler, the core of which comprises a small number of compact code generating templates in the form of definite clause grammar rules.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research