Theory and Practice of Constraint Handling Rules：（约束处理规则的理论和实践）.pdfVIP

J LOGIC PROGRAMMING Theory and Practice of Constraint Handling Rules Thom Fr uh wirth . Constraint Handling Rules CHR are our prop osal to allow more exibility and applicationoriented customization of constraint systems CHR are a declarative language extension esp ecially designed for writing userdened constraints CHR are essentially a committedchoice language consisting of multiheaded guarded rules that rewrite constraints into simpler ones until they are solved In this broad survey we aim at covering all asp ects of CHR as they cur rently present themselves Going from theory to practice we will dene syntax and semantics for CHR intro duce an imp ortant decidable prop erty conuence of CHR programs and dene a tight integration of CHR with constraint logic programming languages This survey then describ es im plementations of the language b efore we review several constraint solvers b oth traditional and nonstandard ones written in the CHR language Finally we intro duce two innovative applications that b eneted from using CHR / INTRODUCTION The advent of constraints in logic programming LP is one of the rare cases where theoretical practical and commercial asp ects of a programming language have b een improved simultaneously Constraint logic pr ogr amming JaLa vH vH Fr JaMa FrAb CLP combines the advantages of logic programming and constraint solving In logic programming problems are stated in a declarative way using rules to dene relations predicates Problems are solved by the builtin logi