A Linear-Logic Semantics for Constraint Handling Rules | Zendy

Hariolf Betz | Zendy; Thom Frühwirth | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Linear-Logic Semantics for Constraint Handling Rules

Author(s) -

Hariolf Betz,

Thom Frühwirth

Publication year - 2005

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

DOI - 10.1007/11564751_13

Subject(s) - computer science , linear logic , semantics (computer science) , programming language , constraint (computer aided design) , constraint logic programming , logic program , theoretical computer science , logic programming , constraint satisfaction , algorithm , artificial intelligence , mathematics , geometry , probabilistic logic

One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate logic. However, the more CHR is used as a general-purpose programming language, the more the limitations of that kind of declarative semantics in modelling change become apparent. We propose an alternative declarative seman- tics based on (intuitionistic) linear logic, establishing strong theorems on both soundness and completeness of the new declarative semantics w.r.t. operational semantics.

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