Ontologies Reasoning Components Agents Simulations Rule-Based Reasoning: Constraint Solving and Deduction Jacques Robin.

Ontologies Reasoning Components Agents Simulations Rule-Based Reasoning: Constraint Solving and Deduction Jacques Robin

Outline  Rules as a knowledge representation formalism  Common characteristics of rule-based systems  Roadmap of rule-based languages  Common advantages and limitations  Example practical application of rules: declarative business rules  History of rule-based systems  Constraint Handling Rules (CHR)  Production Systems  Term Rewriting Systems  Logic Programming and Prolog

Rules as a Knowledge Representation Formalism  What is a rule?  A statement that specifies that:  If a determined logical combination of conditions is satisfied,  over the set of an agent’s percepts  and/or facts in its Knowledge Base (KB)  that represent the current, past and/or hypothetical future of its environment model, its goals and/or its preferences,  then a logico-temporal combination of actions can or must be executed by the agent,  directly on its environment (through actuators) or on the facts in its KB.  A KB agent such that the persistent part of its KB consists entirely of such rules is called a rule-base agent;  In such case, the inference engine used by the KB agent is an interpreter or a compiler for a specific rule language.

Rule-Based Agent Environment Sensors Effectors Rule Base: Persistant intentional knowledge Dependent on problem class, not instance Declarative code Ask Fact Base: Volatile knowledge Dependent on problem instance Data Rule Engine: Problem class independent Only dependent on rule language Declarative code interpreter or compiler TellRetract Ask

Rule Languages: Common Characteristics  Syntax generally:  Extends a host programming language and/or  Restricts a formal logic and/or  Uses a semi-natural language with  closed keyword set expressing logical connectives and actions classes,  and an open keyword set to refer to the entities and relations appearing in the agent’s fact base;  Some systems provide 3 distinct syntax layers for different users with automated tools to translate a rule across the various layers;  Declarative semantics: generally based on some formal logic;  Operational semantics:  Generally based on transition systems, automata or similar procedural formalisms;  Formalizes the essence of the rule interpreter algorithm.

Rule Languages: General Advantages  Human experts in many domains (medicine, law, finance, marketing, administration, design, engineering, equipment maintenance, games, sports, etc.) find it intuitive and easy to formalize their knowledge as a rule base  Facilitates knowledge acquisition  Rules can be easily paraphrased in semi-natural language syntax, friendlier to experts averse to computational languages  Facilitates knowledge acquisition  Rule bases easy to formalize as logical formulas (conjunctions of equivalences and/or implications)  Facilitates building rule engine that perform sound, logic-based inference  Each rule largely independent of others in the base (but to precisely what degree depends highly of the rule engine algorithm)  Can thus be viewed as an encapsulated, declarative piece of knowledge;  Facilitates life cycle evolution and composition of knowledge bases  Very sophisticated, mature rule base compilation techniques available  Allows scalable inference in practice  Some engines for simple rule languages can efficiently handle millions of rules

Rule Languages: General Limitations  Subtle interactions between rules hard to debug without:  sophisticated rule explanation GUI  detailed knowledge of the rule engine’s algorithm  Especially serious with:  Object-oriented rule languages for combining rule-based deduction or abduction with class-based inheritance;  Probabilistic rule languages for combining logical and Bayesian inference;  But purely logical relational rule language do not naturally:  Embed within mainstream object-oriented modeling and programming languages  Represent inherently procedural, taxonomic and uncertain knowledge  Current research challenge:  User-friendly reasoning engine for probabilistic object-oriented rules

Business Rules  Example of modern commercial application of rule-based knowledge representation GUI Layer Data Layer Business Logic Layer Classic 3-Tier Information System Architecture Imperative OO Program Imperative OO Language SQL API Imperative OO Language GUI API Classic Imperative OO Implementation Rule-Based Implementation Imperative OO Host Language Embedded Production Rule Engine Imperative OO Language SQL API Imperative OO Language GUI API Production Rule Base Generic Component Reusable in Any Application Domain Easier to reflect frequent policy changes than imperative code

Semi-Natural Language Syntax for Business Rules  Associate key word or key phrase to:  Each domain model entity or relation name  Each rule language syntactic construct  Each host programming language construct used in rules  Substitute in place of these constructs and symbols the associated words or phrase  Example: “Is West Criminal?” in semi-natural language syntax: IF P is American AND P sells a W to N AND W is a weapon AND N is a nation AND N is hostile THEN P is a criminal IF nono owns a W AND W is a missile THEN west sells nono to W IF W is a missile THEN W is a weapon IF N is an enemy of America THEN N is hostile

OO Rule Languages NeOPS JEOPS CLIPS JESS XML Web Markup Languages CLP(X) Rule-Based Constraint Languages Roadmap of Rule-Based Languages XSLT OPS5 Production Rules ISO Prolog Logic Programming Transaction Logic HiLog Concurrent Prolog Courteous Rules CCLP(X) Frame Logic Flora OCLMOF UML CHORD RuleML ELAN Maude Otter EProver Rewrite Rules SWSL CHR V CHR QVT Java Smalltalk C++ Pure OO Languages

Constraint Handling Rules (CHR): Key Ideas  Originally a logical rule-based language to declaratively program specialized constraint solvers on top of a host programming language (Prolog, Haskell, Java)  Since evolved in a general purpose first-order knowledge representation language and Turing-complete programming language  Fact base contains both extensional and intentional knowledge in the form of a conjunction of constraints  Rule base integrates and generalizes:  Event-Condition-Action rules (themselves generalizing production rules) for constraint propagation  Conditional rewrite rules for constraint simplification  Relies on forward chaining and rule Left-Hand-Side (LHS) matching  Extended variant CHR V adds backtracking search and thus generalizes Prolog rules as well

CHR by Example: Rule Base Defining  in Terms of = reflexivity@ X  Y X = Y | true. asymmetry@ X  Y, Y  X X=Y. % Constraint simplification (or rewriting) rules % Syntax: @ | % Logically:  X  vars(head  guard) %  (   Y  vars(body - (head  guard)) ) % Operationally: substitute in constraint store (knowledge base) constraints that match % the rule simplified head by those in rule body with their variables instantiated from % the match transitivity@ X  Y, Y  Z ==> X  Z. % Constraint propagation (or production) rule (in this case, unguarded) % Syntax: @ ==> guard | % Logically:  X  vars(head  guard) %  (   Y  vars(body - (head  guard)) ) % Operationally: if constraint store (knowledge base) contains constraints that match % the rule propagated head then add those in rule body to the store with their variables % instantiated from the match

CHR by Example: Rule Base Defining  in Terms of = idempotence@ X  Y \ X  Y true. % Constraint simpagation rule (in this case, unguarded) % Syntax: @ \ guard | % Logically:  X  vars((head  guard)  %   Y  vars(body - (head  guard))  % Operationally: if constraint store (knowledge base) contains constraints that match % the rule simplified head and the rule propagated head, then substitute in the store % those matching the simplified head by the rule body with their variables instantiated % from the match query1: A  B, C  A, B  C, A = 2 % Initial constraint store: a constraint conjunction answer1: A = 2, B = 2, C = 2, % Final constraint store = initial constraint store % simplified through repeated rule application until no rule neither simplifies nor % propagates any new constraint query2: A  B, B  C, C  A answer2: A = B, B = C

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG A  B, C  A, B  C A = 2 Matching Equations  Guard Built-In Constraint StoreRule-Defined Constraint Store

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. Condition for firing a rule: 1.Rule head matches active constraint in RDCS  Generates set of equations between variables and constants from the head and the constraint (inserted to MEG) 2.Every other head from the rule matches against some other (partner) constraint in the RDCS  Generates another set of equations (inserted to MEG) 3.Rule r fires iff:  X1,...,Xi  vars(MEGS  BICS - r) BICS   Y1,...,Yj  vars(r) MEG RuleRDCSBICSMEG r? A  B, C  A, B  C A = 2X' = A, Y' = B, X' = Y' Active Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG r? A  B, C  A, B  C A = 2X' = A = Y' = B Normalizing Simplification Active Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true.  A,B A = 2 |   X',Y' X' = A = Y' = B, eg, B = 3  2 = A a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG r? A  B, C  A, B  C A = 2X' = A = Y' = B Active Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Rule firing order depends on 3 heuristics, with the following priority: 1.Rule-defined constraint ordering to become active 2.Rule ordering to try matching and entailment check with active constraint 3.Rule-defined constraint ordering to become partner constraints  Engine first tries matching and entailment check for all rules with current active constraint, before trying any rule with the next constraint in the RDCS RuleRDCSBICSMEG a? A  B, C  A, B  C A = 2X' = A, Y' = B, Y' = C, X' = A Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2 |   X',Y' X' = A, Y' = B = C, eg, B = 3  4 = C t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG a? A  B, C  A, B  C A = 2X' = A, Y' = B = C Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG a? A  B, C  A, B  C A = 2X' = C, Y' = A, Y' = A, X' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2 |   X',Y' X' = B = C, Y' = A eg, B = 3  4 = C t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG a? A  B, C  A, B  C A = 2X' = B = C, Y' = A Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t? A  B, C  A, B  C A = 2X' = A, Y' = B, Y' = C, Z' = A Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z.  A,B,C A = 2 |   X',Y', Z' X' = Z' = A, Y' = B = C, eg, B = 3  4 = C i@ X  Y \ X  Y true. RuleRDCSBICSMEG t? A  B, C  A, B  C A = 2X' = Z' = A, Y' = B = C Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t? A  B, C  A, B  C A = 2X' = C, Y' = A, Y' = A, Z' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z.  A,B,C A = 2 |=  X'=C,Y'=2,Z'=B, X' = C, Y' = A, Z' = B i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t? A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B A  B, C  A, B  C, C  B A = 2

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B r? A  B, C  A, B  C, C  B A = 2X' = C, Y' = B, X' = Y' Active Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true.  B,C A = 2 |   X',Y' X' = Y' = B = C, eg, B = 3  2 = C a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B r? A  B, C  A, B  C, C  B A = 2X' = Y' = B = C Active Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B a? A  B, C  A, B  C, C  B A = 2X' = C, Y' = B, Y' = A, X' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2 |   X',Y' X' = Y' = A = B = C, eg, B = 3  2 = C t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B a? A  B, C  A, B  C, C  B A = 2X' = Y' = A = B = C Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B a? A  B, C  A, B  C, C  B A = 2X' = A, Y' = B, Y' = C, X' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2 |   X',Y' X' = Y' = A = B = C, eg, B = 3  2 = C t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B a? A  B, C  A, B  C, C  B A = 2X' = Y' = A = B = C Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B t? A  B, C  A, B  C, C  B A = 2X' = C, Y' = B, Y' = A, Z' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z.  A,B,C A = 2 |   X',Y',Z' X' = C, Y' = A = B = C eg, B = 3  2 = C i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B t? A  B, C  A, B  C, C  B A = 2X' = C, Y' = A = B = C Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B t? A  B, C  A, B  C, C  B A = 2X' = A, Y' = B, Y' = C, Z' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z.  A,B,C A = 2 |   X',Y',Z' X' = A, Y' = B = C, Z' = B eg, B = 3  2 = C i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B t? A  B, C  A, B  C, C  B A = 2X' = A, Y' = B = C, Z' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = B, X' = A, Y' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  A,B,C A = 2 |   X',Y' X' = A = C, Y' = B, eg, C = 3  2 = A RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = A = C, Y' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = A, Y' = B, X' = C, Y' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  A,B,C A = 2 |   X',Y' X' = A = C, Y' = B, eg, C = 3  2 = A  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = A = C, Y' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = B, Y' = C, X' = A Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2 |   X',Y' X' = Y' = A = B = C eg, C = 3  2 = A t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = Y' = A = B = C Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = A, X' = C, Y' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2 |   X',Y' X' = C, Y' = A = B eg, B = 3  2 = A t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost head RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = A = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = B, Y' = C, Z' = A Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z.  A,B,C A = 2 |   X',Y',Z' X' = Y' = B = C, Z' = A eg, B = 3  2 = C i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = Y' = B = C, Z' = A Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = A, Y' = C, Z' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z.  A,B,C A = 2 |   X',Y',Z' X' = Y' = A = C, Z' = B eg, B = 3  2 = A i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = Y' = A = C, Z' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = B, X' = C, Y' = A Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  A,B,C A = 2 |   X',Y' X' = C, Y' = A = B eg, B = 3  2 = A RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = A = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = A, X ' = C, Y' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true.  A,B,C A = 2 |   X',Y' X' = C, Y' = A = B eg, B = 3  2 = A  Alternate matching combination:  Active constraint matched against rightmost head  Partner constraint matched against leftmost RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = A = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = C, Y' = B, Y' = B, Z' = C Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2 |=  X'=C,Y'=2,Z'=C X' = Z' = C, Y' = B t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i? A  B, C  A, B  C, C  B A = 2X' = Z' = C, Y' = B Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2 |=  X'=C,Y'=2,Z'=C X' = Z' = C, Y' = B t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i! A  B, C  A, B  C, C  B A = 2X' = Z' = C, Y' = B A  B, C  A A = 2, B = C

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i! A  B, C  A, B  C, C  B A = 2X' = Z' = C, Y' = B r? A  B, C  A A = 2, B = CX' = A, Y' = B, X' = Y' Active Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true.  A,B,C A = 2  B = C |   X',Y' X' = Y' = A = B eg, B = 3  2 = A a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i! A  B, C  A, B  C, C  B A = 2X' = Z' = C, Y' = B r? A  B, C  A A = 2, B = CX' = Y' = A = B Active Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i! A  B, C  A, B  C, C  B A = 2X' = Z' = C, Y' = B a? A  B, C  A A = 2, B = CX' = A, Y' = B, Y' = C, X' = A Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y  A,B,C A = 2  B = C |=  X'=2,Y'=B X' = A, Y' = B = C t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i! A  B, C  A, B  C, C  B A = 2X' = Z' = C, Y' = B a! A  B, C  A A = 2, B = CX' = A, Y' = B = C Active Constraint Partner Constraint

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i! A  B, C  A, B  C, C  B A = 2X' = Z' = C, Y' = B a! A  B, C  A A = 2, B = CX' = A, Y' = B = C A = 2, B = C, A = B Constraints Simplified

CHR by Example: Rule Base Defining  in Terms of = r@ X  Y X = Y | true. a@ X  Y, Y  X X=Y t@ X  Y, Y  Z ==> X  Z. i@ X  Y \ X  Y true. RuleRDCSBICSMEG t! A  B, C  A, B  C A = 2X' = C, Y' = A, Z' = B i! A  B, C  A, B  C, C  B A = 2X' = Z' = C, Y' = B a! A  B, C  A A = 2, B = CX' = A, Y' = B = C A = B = C = 2 Final Normalized Solved Form

Body: Rule-Defined and Built-In Constraints Guard: Built-In Constraints (from host language) Head: Rule-Defined Constraints Simplification rule: sh1(X,a), sh2(b,Y) g1(X,Y), g2(a,b,c) | b1(X,c), b2(Y,c). Propagation rule: ph1(X,Y), ph2(d) ==> g3(X), g4(d,Y) | b3(X,d), b4(X,Y). Simpagation rule: ph3(X), ph4(Y,Z) \ sh3(X,U), sh4(Y,V) g5(X,Z), g6(Z,Y) | b5(X), b6(Y,Z). Simplification rules are conditional rewrite rules (condition is the guard) Propagation rules are event-condition-action rules (event is the guard) Simpagation rules heads are hybrid syntactic sugar, each can be replaced by a semantically equivalent simplification rule, ex, p, r \ s, t g, h | b, c. is equivalent to p, r, s, t g, h | p, r, b, c. 2..* And Formula CHR: Syntax Overview CHR Base * CHR Rule guard simplified head propagated head body Logical Formula 0..1 Atomic Formula Simpagation Rule Simplification Rule Propagation Rule {disjoint, complete} Built-In Constraint Rule Defined Constraint

CHR: Complete Abstract Syntax Simpagation Rule Simplification Rule Propagation Rule CHR Base * CHR Rule guard simplified head propagated head body Logical Formula 0..1 2..* {disjoint, complete} Non-Ground Term Ground Term {disjoint, complete} And Formula Atomic Formula arg * Term Constraint Symbol Functional Term Non-Functional Term {disjoint, complete} arg * Function Symbol Constraint Domain * * * Built-In Constraint Rule Defined Constraint truefalse Variable Constant Symbol Rule Defined Constraint Symbol Built-In Constraint Symbol

CHR: Derivation Data Structures Simpagation Rule Simplification Rule Propagation Rule CHR Base * CHR Rule guard simplified head propagated head body CHR Logical Formula Atomic Formula Built-In Constraint Rule Defined Constraint 0..1 2..* Term And Formula arg * * * * {ordered} Rule Defined Constraint Store Built-In Constraint Store Used Rule Derivation State * CHR Derivation

CHR: Declarative Semantics in Classical First-Order Logic (CFOL)  Simplification rule: sh 1,..., sh i g 1,..., g j | b 1,..., b k. where: {X 1,..., X n } = vars(sh 1 ...  sh i  g 1 ...  g j ) and {Y 1,..., Y m } = vars(b 1 ...  b k ) \ {X 1,..., X n }  X 1,..., X n g1 ...  gj  (sh 1 ...  sh i   Y 1,..., Y m b 1 ...  b k )  Propagation rule: ph 1,..., ph i ==> g 1,..., g j | b 1,..., b k. where: {X 1,..., X n } = vars(ph 1 ...  ph i  g 1 ...  g j ) and {Y 1,..., Y m } = vars(b 1 ...  b k ) \ {X 1,..., X n }  X 1,..., X n g 1 ...  g j  (ph 1 ...  ph i   Y 1,..., Y m b 1 ...  b k )

CHR: Constraint and Rule Priority Heuristics  No standard, implementation dependent  Active constraint priority heuristics:  Preferring constraints most recently inserted in store  Left-to-right writing order in query  Rule priority heuristics:  Preferring simplification rules over simpagation rules and simpagation over propagation rules  Preferring simplification and simpagation rules with highest number of simplified heads  Preferring propagation rules with lowest number of heads  Preferring rules whose head constraint have never be matched yet  Top to bottom writing order  Partner constraint priority heuristics:  Preferring constraints most recently inserted in store  Left-to-right writing order in query

CHR Base Example: Defining min in Terms of ,  and = r1@ min(X,Y,Z) X  Y | Z = X r2@ min(X,Y,Z) Y  X | Z = Y. r3@ min(X,Y,Z) Z < X | Y = Z. r4@ min(X,Y,Z) Z < Y | X = Z. r5@ min(X,Y,Z) ==> Z  X, Z  Y. RuleRDCSBICSMEG min(1,2,M)

CHR Base Example: Defining min in Terms of ,  and = r1@ min(X,Y,Z) X  Y | Z = X  M true |=  X'=1,Y'=2,Z'=M X' = 1, Y' = 2, Z' = M, 1  2 r2@ min(X,Y,Z) Y  X | Z = Y. r3@ min(X,Y,Z) Z < X | Y = Z. r4@ min(X,Y,Z) Z < Y | Y = Z. r5@ min(X,Y,Z) ==> Z  X, Z  Y. RuleRDCSBICSMEG r?min(1,2,M)true X' = 1, Y' = 2, Z' = M, X'  Y'

CHR Base Example: Defining min in Terms of ,  and = r1@ min(X,Y,Z) X  Y | Z = X  M true |=  X'=1,Y'=2,Z'=M X' = 1, Y' = 2, Z' = M, X' = 1  2 = Y' r2@ min(X,Y,Z) Y  X | Z = Y. r3@ min(X,Y,Z) Z < X | Y = Z. r4@ min(X,Y,Z) Z < Y | Y = Z. r5@ min(X,Y,Z) ==> Z  X, Z  Y. RuleRDCSBICSMEG r!min(1,2,M)true X' = 1, Y' = 2, Z' = M, X'  Y' trueM = Z' = X' = 1

CHR Base Example: Defining min in Terms of ,  and = r1@ min(X,Y,Z) X  Y | Z = X  M true |=  X'=1,Y'=2,Z'=M X' = 1, Y' = 2, Z' = M, X' = 1  2 = Y' r2@ min(X,Y,Z) Y  X | Z = Y. r3@ min(X,Y,Z) Z < X | Y = Z. r4@ min(X,Y,Z) Z < Y | Y = Z. r5@ min(X,Y,Z) ==> Z  X, Z  Y. RuleRDCSBICSMEG r!min(1,2,M)true X' = 1, Y' = 2, Z' = M, X'  Y' trueM = 1 Projection(CS,vars(Query))

CHR Base Example: Defining min in Terms of ,  and = r1@ min(X,Y,Z) X  Y | Z = X r2@ min(X,Y,Z) Y  X | Z = Y. r3@ min(X,Y,Z) Z < X | Y = Z. r4@ min(X,Y,Z) Z < Y | Y = Z. r5@ min(X,Y,Z) ==> Z  X, Z  Y. RuleRDCSBICSMEG min(A,B,M) A  B

CHR Base Example: Defining min in Terms of ,  and = r1@ min(X,Y,Z) X  Y | Z = X  A,B,M A  B |=  X'=A,Y'=B,Z'=M X' = A, Y' = B, Z' = M, X' = A  B = Y' r2@ min(X,Y,Z) Y  X | Z = Y. r3@ min(X,Y,Z) Z < X | Y = Z. r4@ min(X,Y,Z) Z < Y | Y = Z. r5@ min(X,Y,Z) ==> Z  X, Z  Y. RuleRDCSBICSMEG r1?min(A,B,M) A  BX' = A, Y' = B, Z' = M, X'  Y'

CHR Base Example: Defining min in Terms of ,  and = r1@ min(X,Y,Z) X  Y | Z = X  A,B,M A  B |=  X'=A,Y'=B,Z'=M X' = A, Y' = B, Z' = M, X' = A  B = Y' r2@ min(X,Y,Z) Y  X | Z = Y. r3@ min(X,Y,Z) Z < X | Y = Z. r4@ min(X,Y,Z) Z < Y | Y = Z. r5@ min(X,Y,Z) ==> Z  X, Z  Y. RuleRDCSBICSMEG r1!min(A,B,M) A  BX' = A, Y' = B, Z' = M, X'  Y' true M = Z' = X' = A, A  B

CHR Base Example: Defining min in Terms of ,  and = r1@ min(X,Y,Z) X  Y | Z = X  A,B,M A  B |=  X'=A,Y'=B,Z'=M X' = A, Y' = B, Z' = M, X' = A  B = Y' r2@ min(X,Y,Z) Y  X | Z = Y. r3@ min(X,Y,Z) Z < X | Y = Z. r4@ min(X,Y,Z) Z < Y | Y = Z. r5@ min(X,Y,Z) ==> Z  X, Z  Y. RuleRDCSBICSMEG r1!min(A,B,M) A  BX' = A, Y' = B, Z' = M, X'  Y' true M = A, A  B Projection(CS,vars(Query))

CHR Component Bases  Several solvers, each one implemented by a pair (CHR base, CHR engine)  can be assembled in a component-based architecture,  with server solvers' CHR bases defining in their rule heads  the constraints used as built-ins by client solvers' CHR bases

X  Y  X = Y | true X  Y  Y  X  X = Y X  Y  Y  Z  X = Z X  Y  X  Y  X  Y X  X  false X  Y  Y  Z  X  Y  Y  Z | X  Z X  Y  Y  Z  X  Y  Y  Z | X  Z X  Y  Y  Z  X  Y  Y  Z | X  Z > strictlyLessCHRDBase    derive > lessOrEqualCHRDBase = derive > HostPlatform  > CHRDEngine derive = > SyntacticEquality = (X:Real, Y:Real): Boolean  (X:Real, Y:Real): Boolean  > strictlyLess  (X:Real, Y:Real): Boolean min(X,Y,Z)  X  Y | Z = X min(X,Y,Z)  Z  Y | Z = X min(X,Y,Z)  Y  Z | Z = Y min(X,Y,Z)  Z  X | Z = Y min(X,Y,Z)  Z  X  Z  Y > MinCHRDBase min   derive > Min min(X:Real, Y:Real, out Z:Real) > CHRDEngine derive() > lessOrEqual  (X:Real, Y:Real): Boolean bug: x <= Y built-in so in guard

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C ?P = C. r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R. r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. Notation:  ?P Constraint Domain Variable and CHR Variable  C Constraint Domain Constant and CHR Variable  == Constraint Domain Equality Predicate  = CHR Equality Predicate  0,1,2,... CHR and Host Programming Language Constants  := Host Programming Language Variable Assignment Predicate, always returns true, performs arithmetic computation as side-effect  +, -, / Host Programming Language Arithmetic Function  number Host Programming Language Type Checking Function RuleRDCSBICSMEG ?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C  ?Y, true |=  ?P=?Y,C=2 ?P = ?Y, C = 2 r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R. r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1??Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R. r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R. r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r1??X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R.  ?X,?Y,?U,?V ?Y = 2 |=  = ?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2??X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R.  ?X,?Y,?U,?V ?Y = 2 |=  = ?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 ?Y = 2, ?X = 1

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R. r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r1??U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r2??U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 2, ?Q.number

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r3??U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 2, ?P.number

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r4??U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 0, ?P = ?U, ?Q = ?V, D = 2, R = 1

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R  ?X,?Y,?U,?V ?X = 1, ?Y = 2 |=  = ?P = ?U, ?Q = ?V, C = 0, D = 2, R = 1 RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r4??U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 0, D = 2, R = 1

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R.  ?X,?Y,?U,?V ?X = 1, ?Y = 2 |=  = ?P = ?U, ?Q = ?V, C = 0, D = 2, R = 1 RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r4!?U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 0, D = 2, R = 1 ?U + ?V == 0?Y = 2, ?X = 1, ?U = 1

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r4!?U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 0, D = 2, R = 1 r1??U + ?V == 0?Y = 2, ?X = 1, ?U = 1

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R. r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r4!?U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 0, D = 2, R = 1 r2??U + ?V == 0?Y = 2, ?X = 1, ?U = 1?P = ?U, ?Q = ?V, C = 0, ?Q.number

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R. r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R.  ?X,?Y,?U,?V ?X = 1, ?Y = 2, ?U = 1 |=  = ?P = ?U, ?Q = ?V, C = 0, ?P.number, R = -1 r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r4!?U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 0, D = 2, R = 1 r3??U + ?V == 0?Y = 2, ?X = 1, ?U = 1?P = ?U, ?Q = ?V, C = 0, ?P.number, R = -1

CHR Base Example: Restricted Form of Real Linear Equations Solver r1@ ?P == C P = C r2@ ?P + ?Q == C ?Q.number, R := C - ?Q | ?P = R. r3@ ?P + ?Q == C ?P.number, R := C - ?P | ?Q = R.  ?X,?Y,?U,?V ?X = 1, ?Y = 2, ?U = 1 |=  = ?P = ?U, ?Q = ?V, C = 0, ?P.number, R = -1 r4@ ?P + ?Q == C \ ?P - ?Q == D R := (C + D) / 2 | ?P = R. RuleRDCSBICSMEG r1!?Y == 2, ?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 true?P = ?Y, C = 2 r2!?X + ?Y == 3, ?U - ?V == 2, ?U + ?V == 0 ?Y = 2?P = ?X, ?Q = ?Y, C = 3, ?Q.number, R = 1 r4!?U - ?V == 2, ?U + ?V == 0 ?Y = 2, ?X = 1?P = ?U, ?Q = ?V, C = 0, D = 2, R = 1 r3!?U + ?V == 2?Y = 2, ?X = 1, ?U = 1?P = ?U, ?Q = ?V, C = 0, ?P.number, R = -1 true?Y = 2, ?X = 1, ?U = 1, ?V = -1

CHR  : Abstract Syntax OrAnd Formula connective: enum{or,and} Simpagation Rule Simplification Rule Propagation Rule CHR Base * CHR Rule guard simplified head propagated head body And Formula Atomic Formula Constraint Built-In Constraint Rule Defined Constraint 2..* truefalse 0..1 Built-In Constraint Store Rule Defined Constraint Store * Fired Rule Derivation State * CHR Derivation * {ordered} ** Tried Alternative Body * *

CHR  : Declarative Semantics in Classical First-Order Logic (CFOL)  Simplification rule: sh 1,..., sh i g 1,..., g j | b 1 1,..., b k p ;... ; b 1 1,..., b l q. where: {X 1,..., X n } = vars(sh 1 ...  sh i  g 1 ...  g j ) and {Y 1,..., Y m } = vars(b 1 ...  b k ) \ {X 1,..., X n }  X 1,..., X n g1 ...  gj  (sh 1 ...  sh i   Y 1,..., Y m ((b 1 1 ...  b k p ) ...  (b 1 1 ...  b k q ))  Propagation rule: ph 1,..., ph i ==> g 1,..., g j | b 1 1,..., b k p ;... ; b 1 1,..., b l q. where: {X 1,..., X n } = vars(ph 1 ...  ph i  g 1 ...  g j ) and {Y 1,..., Y m } = vars(b 1 ...  b k ) \ {X 1,..., X n }  X 1,..., X n g 1 ...  g j  (ph 1 ...  ph i   Y 1,..., Y m ((b 1 1 ...  b k p ) ...  (b 1 1 ...  b k q ))

CHR  : Operational Semantics  When rule R with disjunctive body B 1 ;... ; B k is fired  Update both constraint stores using B 1  Start next matching-updating cycle  When BICS = false or when no rule matches the RDCS  Backtrack to last alternative body B i  Restore both constraint stores to their states prior to their update with B i  Update both constraint stores using B i+1  Start next matching-updating cycle  Exhaustively try all alternative bodies of all fired rules through backtracking

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b). d4@ d(r4,C) ==> (C = r ; C = b). d3@ d(r3,C) ==> (C = r ; C = b). d2@ d(r2,C) ==> (C = b ; C = g). d5@ d(r5,C) ==> (C = r ; C = g). d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]).true

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m?m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]).true

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) true

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2?l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6]

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) true

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] n?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) true

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = r

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 n?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = r

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 d1a?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r1, C = C1 Already fired w/ same constraint. Not repeated to avoid trivial non-termination

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6]

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false.  C1,C7  Ri',Rj',Ci',Cj' C1=r |  Ri=r1, Rj=r7, Ci=C1, Cj=C7, Ci=Cj l1@ l([ ],[ ]) true. eg., Cj = b  r = Ci l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] n?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r1, Rj = r7, Ci = C1, Cj = C7, Ci = Cj

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7a?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r, C7 = r

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 n?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r, C7 = r Ri = r1, Rj = r7, Ci = r, Cj = r

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 n!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r, C7 = r Ri = r1, Rj = r7, Ci = r, Cj = r n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) false

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 n!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r, C7 = r Ri = r1, Rj = r7, Ci = r, Cj = r btn(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) false

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7b?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7b!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r, C7 = b

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false.  C1,C7  Ri',Rj',Ci',Cj' C1=r |  Ri=r1, Rj=r7, Ci=C1, Cj=C7, Ci=Cj l1@ l([ ],[ ]) true. eg., Cj = b  r = Ci l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7b!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 n?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r, C7 = b Ri = r1, Rj = r7, Ci = C1, Cj = C7, Ci = Cj

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7b!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 l2?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r, C7 = b R = r4, Rs = [r3,r2,r5,r6], C = C4, Cs = [C3,C2,C5,C6]

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7b!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), d(r4,C4), l([r3,r2,r5,r6],[C3,C2,C5,C6]) C1 = r, C7 = b R = r4, Rs = [r3,r2,r5,r6], C = C4, Cs = [C3,C2,C5,C6]

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b).... m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m!m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]),true l2!l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]), n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7) trueR = r1, Rs = [r7,r4,r3,r2,r5,r6], C = C1, Cs = [C7,C4,C3,C2,C5,C6] d1a!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) trueC = C1 l2!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), l([r7,r4,r3,r2,r5,r6],[C7,C4,C3,C2,C5,C6]) C1 = rR = r7, Rs = [r4,r3,r2,r5,r6], C = C7, Cs = [C4,C3,C2,C5,C6] d7b!n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = rRi = r7, C = C7 l2?n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r7,C7), l([r4,r3,r2,r5,r6],[C4,C3,C2,C5,C6]) C1 = r, C7 = b

CHR  Base Example: Map Coloring Problem d1@ d(r1,C) ==> (C = r ; C = b ; C = g). d7@ d(r7,C) ==> (C = r ; C = b). d4@ d(r4,C) ==> (C = r ; C = b). d3@ d(r3,C) ==> (C = r ; C = b). d2@ d(r2,C) ==> (C = b ; C = g). d5@ d(r5,C) ==> (C = r ; C = g). d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb RuleRDCSBICSMEG m, l([r1,r7,r4,r3,r2,r5,r6],[C1,C7,C4,C3,C2,C5,C6]).true n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7), d(r1,C1), d(r2,C2), d(r2,C2), d(r1,C3), d(r4,C4), d(r5,C5), d(r6,C6), d(r7,C7) C1 = g, C2 = b, C3 = r, C4 = r, C5 = g, C6 = r, C7 = b

CHR  Base Example: Map Coloring Problem % More efficient version with forward checking d1@ c(r1,r), c(r1,b), c(r1,g) ==> false. d1@ d(r1,C), c(r1,r), c(r1,b) ==> C = g. d1@ d(r1,C), c(r1,r), c(r1,g) ==> C = b. d1@ d(r1,C), c(r1,b), c(r1,g) ==> C = r. d1@ d(r1,C), c(r1,b) ==> (C = r ; C = g). d1@ d(r1,C), c(r1,g) ==> (C = r ; C = b). d1@ d(r1,C), c(r1,r) ==> (C = b ; C = g). d1@ d(r1,C) ==> (C = r ; C = b ; C = g).... d6@ d(r6,C) ==> (C = r ; C = g; C = t). m@ m n(r1,r2), n(r1,r3), n(r1,r4), n(r1,r7), n(r2,r6), n(r3,r7), n(r4,r5), n(r4,r7), n(r5,r6), n(r5,r7). fcr@ n(Ri,Rj), d(Rj,Cj) ==> c(Ri,Cj). n@ n(Ri,Rj), d(Ri,Ci), d(Rj,Cj) ==> Ci = Cj | false. l1@ l([ ],[ ]) true. l2@ l([R|Rs],[C|Cs]) d(R,C), l(Rs,Cs). r2r2 bg r6r6 rgt r3r3 rb r4r4 rb r5r5 bg r1r1 rbg r7r7 rb

CHR  for Deduction: Formulating Logical Entailment as Constraint Simplification  How to use CHR  to answer KB |= Q? 1.Using only propagation rules, simulating forward chaining  Complete only for KB Horn clause conjunction and Q atom conjunction 2.Using only simplification rules, simulating backward chaining  Complete only for KB Horn clause conjunction and Q atom conjunction 3.Using only propagation rules, simulating resolution-based refutation proof  Complete only for Q atom conjunctions 4.Using only simplification rules, simulating resolution-based refutation proof  Complete only for Q atom conjunctions

Forward Chaining as CHR  Constraint Propagation 1.Put KB in Implicative Normal Form (INF) 2.Map each deductive rule in INF(KB) of the form: p 1 ...  p i  c 1 ...  c j onto a CHR  rule of the form: p 1,..., p i ==> c 1 ;... ; c j 3.Map each integrity constraint in INF(KB) of the form: p 1 ...  p i  false onto a CHR  rule of the form: p 1,..., p i ==> false 4.Map all the facts in INF(KB) of the form: true  f l onto a single CHR  rule of the form: facts ==> f 1,..., f k 5.Map query Q of the form (q 11 ...  q 1n ) ...  (q m1 ...  q mp ) onto the set of CHR constraint {(q 11,..., q 1n ) ;...; (q m1,..., q mp )} 6.Initialize RDCS = facts 7.Simplify RDCS with CHR engine 8.If at the end of the simplification:   D  RCDS  BICS | disjunct(Q) and BICS  {false} then KB |= Q  BICS = {false}, then the KB was inconsistent  Otherwise KB may or may not entail Q

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P) RuleRDCSBICSMEG f?starttrue

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P ) RuleRDCSBICSMEG f!starttrue start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), true

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P ) RuleRDCSBICSMEG f!starttrue s?start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono) truenono=nono, W'=m1

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P ) RuleRDCSBICSMEG f!starttrue s!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), truenono=nono, W'=m1 start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1) true

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P ) RuleRDCSBICSMEG f!starttrue s!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), truenono=nono, W'=m1 w?start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1) trueW'=m1

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P ) RuleRDCSBICSMEG f!starttrue s!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), truenono=nono, W'=m1 w!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1) trueW'=m1 start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1) true

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P ) RuleRDCSBICSMEG f!starttrue s!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), truenono=nono, W'=m1 w!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1) trueW'=m1 h?start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1) trueN=nono

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P) RuleRDCSBICSMEG f!starttrue s!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), truenono=nono, W'=m1 w!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1) trueW'=m1 h!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1) trueN'=nono start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1), hostile(nono) true

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P ) RuleRDCSBICSMEG f!starttrue s!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), truenono=nono, W'=m1 w!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1) trueW'=m1 h!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1) trueN'=nono c?start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1), hostile(nono) trueP'=west, W'=m1, N'=nono

Forward Chaining as CHR  Constraint Propagation: Is West Criminal? f@ start ==> owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono). s@ owns(nono,W), missile(W) ==> sells(west,nono,W) w@ missile(W) ==> weapon(W) h@ enemy(N,america) ==> hostile(N) c@ american(P), weapon(W), nation(N), hostile(N), sells(P,N,W) ==> criminal(P ) RuleRDCSBICSMEG f!starttrue s!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), truenono=nono, W'=m1 w!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1) trueW'=m1 h!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1) trueN'=nono c!start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1), hostile(nono) trueP'=west, W'=m1, N'=nono start, owns(nono,m1), missile(m1), enemy(nono,america), american(west), nation(nono), sells(west,nono,m1), weapon(m1), hostile(nono), criminal(west)

Backward Chaining as CHR  Constraint Simplification 1.Put Horn KB in Implicative Normal Form (INF) 2.Map each set of deductive rule in INF(KB) of the form: { p 1 1 ...  p i l  c,..., p n 1 ...  p n m  c }, i.e., clauses with same positive conclusion onto a CHR  rule of the form: c e 1,..., e n | (ng(p 1 1 ),..., ng(p i l )) ;...; (ng(p n 1 ),..., ng(p n l )) where ng(p k ) is a non-ground version of p k with each constant v k substituted by a variable X k and e 1,..., e n are equations of the form X k = v k 3.Map each integrity constraint in INF(KB) of the form: p 1 ...  p i  false onto a CHR  rule of the form: ng(p 1 ),..., ng(p i ) | e 1,..., e n ==> false. 4.Map all the facts in INF(KB) of the form: true  f l onto a single CHR  rule of the form: f 1,..., f k true. 5.Map query Q of the form (q 11 ...  q 1n ) ...  (q m1 ...  q mp ) onto CHR constraint of the form q: (q 11,..., q 1n ) ;...; (q m1,..., q mp ) 6.Initialize RDCS = q 7.Simplify RDCS with CHR engine 8.If at the end of the simplification:  RDCS =  and BICS  {false}, then KB |= Q  BICS = {false}, then KB |  Q  Otherwise, KB may or may not entail Q

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c?criminal(P)true

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true w?weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true w!weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true sells(P,N,W), hostile(N), nation(N), american(P), missile(W)true

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true w!weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true s?sells(P,N,W), hostile(N), nation(N), american(P), missile(W)trueP=west, N=nono

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true w!weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true s!sells(P,N,W), hostile(N), nation(N), american(P), missile(W)trueP=west, N=nono hostile(N), nation(N), american(P), missile(W), owns(N,W), missile(W).P=west, N=nono

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true w!weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true s!sells(P,N,W), hostile(N), nation(N), american(P), missile(W)trueP=west, N=nono h?hostile(N), nation(N), american(P), missile(W), owns(N,W), missile(W).P=west, N=nonoA = america

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true w!weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true s!sells(P,N,W), hostile(N), nation(N), american(P), missile(W)trueP=west, N=nono h!hostile(N), nation(N), american(P), missile(W), owns(N,W), missile(W).P=west, N=nonoA = america nation(N), american(P), missile(W), owns(N,W), missile(W), enemy(N,A)P=west, N=nono, A = america

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true w!weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true s!sells(P,N,W), hostile(N), nation(N), american(P), missile(W)trueP=west, N=nono h!hostile(N), nation(N), american(P), missile(W), owns(N,W), missile(W). P=west, N=nonoA = america f?nation(N), american(P), missile(W), owns(N,W), missile(W), enemy(N,A) P=west, N=nono, A = america N'= N, W' = W, W' = W, N' = N, A' = A, P' = P, N' = N, N = nono, W = m1, A = america, P = west

Backward Chaining as CHR  Constraint Simplification: Is West Criminal? c@ criminal(P) weapon(W), sells(P,N,W), hostile(N), nation(N), american(P). w@ weapon(W) missile(W) s@ sells(P,N,W) P = west, N = nono | owns(N,W), missile(W). h@ hostile(N) A = america | enemy(N,A) f@ owns(N,W), missile(W), enemy(N,A), american(P), nation(N) N = nono, W = m1, A = america, P = West | true RuleRDCSBICSMEG c!criminal(P)true w!weapon(W), sells(P,N,W), hostile(N), nation(N), american(P)true s!sells(P,N,W), hostile(N), nation(N), american(P), missile(W)trueP=west, N=nono h!hostile(N), nation(N), american(P), missile(W), owns(N,W), missile(W). P=west, N=nonoA = america f!nation(N), american(P), missile(W), owns(N,W), missile(W), enemy(N,A) P = west, N=nono, A = america N'= N, W' = W, W' = W, N' = N, A' = A, P' = P, N' = N, N = nono, W = m1, A = america, P = west P = west, N=nono, A = america, W = m1

Resolution-Based Refutation as CHR  Constraint Simplification 1.Put KB in Implicative Normal Form (INF) 2.Map each deductive rule in INF(KB) of the form: p 1 ...  p i  c 1 ...  c j onto a CHR  rule of the form: p 1,..., p i ==> c 1 ;... ; c j 3.Map each integrity constraint in INF(KB) of the form: p 1 ...  p i  false onto a CHR  rule of the form: p 1,..., p i ==> false 4.Map all the facts in INF(KB) of the form: true  f l onto a single CHR  rule of the form: facts f 1,..., f k 5.Map negation of query Q of the form q 11 ...  q 1n onto a single CHR  rule of the form: q 11,..., q 1n ==> false 6.Initialize RDCS = facts 7.Simplify RDCS with CHR engine 8.If at the end of the simplification:  BICS = {false}, then KB |= Q  Otherwise, KB |  Q

CHR V : Practical Applications  Declarative, easy to extend and compose constraint solvers and all their applications  Scheduling, allocation, planning, optimization, recommendation, configuration  Deductive theorem proving (propositional and first-order) and all its applications:  CASE tools, declarative programs analysis, formal methods in hardware and software design,  Hypothetical abductive reasoning and all its applications:  Diagnosis and repair, observation explanation, sensor data integration  Multi-agent reasoning  Spatio-temporal reasoning and robotics  Hybrid reasoning integrating:  Deduction, belief revision, abduction, constraint solving and optimization  with open and closed world assumption  Heterogeneous knowledge integration  Semantic web services  Natural language processing

CHR V vs. Production Systems CHR V :  Constraint store contains arbitrary atoms including functional, non-ground atoms  Simplification rules allow straightforward modeling for goal-driven reasoning, with rewriting simulating Prolog-like backward chaining  Disjunctive bodies  Built-in backtracking search Production Systems:  Fact base only contains ground Datalog atoms  Cumbersome modeling to implement goal-driven reasoning  No disjunctions in RHS  No built-in search Common characteristics:  Forward chains rules  Requires conflict resolution strategy to choose:  Which of several matching rules to fire  Non-monotonic reasoning due to:  Constraint retraction in Rule-Defined Constraint Store  Fact retraction in the RHS  Tricky confluence and termination issues

CHR V vs. Rewriting Systems CHR V :  Matching applied to atomic formula conjunctions  Rule head is matched with constraint store sub-set, which requires head to be more general than sub-set  Propagation rules provide further simplification opportunities Rewriting Systems:  Unification of LHS is applied recursively down to sub-terms  Rule LHS is unified with sub-term which can thus be more general than LHS  All reasoning done through rewriting (no propagation rules) Common characteristics:  Forward chains rules  Requires conflict resolution strategy to choose:  Which of several matching rules to fire  Non-monotonic reasoning due to:  Constraint retraction in Rule-Defined Constraint Store  Retraction of substituted sub-term  Tricky confluence and termination issues

CHR V vs. Prolog  CFOL semantics of CHR V guardless, single head simplification rule, equivalent to CFOL semantics of pure Prolog clause set sharing same conclusion (Clark's completion)  Simplification rule: sh true | b 1 1,..., b k p ;... ; b 1 1,..., b l q. w here: {X 1,..., X n } = vars(sh i ), and {Y 1,..., Y m } = vars(b 1 ...  b k ) \ {X 1,..., X n }  X 1,..., X n true  (sh   Y 1,..., Y m ((b 1 1 ...  b k p ) ...  (b 1 1 ...  b k q ))  Equivalent Prolog clauses: { sh :- b 1 1,..., b k p.,..., sh :- b 1 1,..., b l q.}  Thus, using Clark's completion, any Prolog program can be reformulated into a semantically equivalent CHR V program  CHR V extends Prolog with:  Conjunctions in the heads  Guards  Non-ground numerical constraints heads, guards and bodies  Propagation rules

Rewrite Rules: Abstract Syntax Rewrite Rule Base Rewrite Rule * RHS plus(X,0)  X fib(suc(suc(N)))  plus(fib(suc(N)),fib(N)) Functional Term Non-Functional Term Ground Term Non-Ground Term Function Symbol Constant Symbol Variable * args {disjoint, complete} LHS Term

Rewrite Rules: Operational Semantics : Rewrite Rule Base T : Term Unify LHS of Rewrite Rule Base against sub-terms of Term : Unifying Set of Pairs: - Instantiated Rule - Instantiated Sub-term [ Matching Pair Set Empty ] [ Matching Pair Set Singleton ] : Pair - Instantiated Rule R - Instantiated Sub-Term S Pick one Pair Set [ Else ] Substitute Sub-Term S in Term T by RHS of Rule R

Rewrite Rule Base Computation Example a)plus(X,0)  X b)plus(X,suc(Y))  suc(plus(X,Y)) c)fib(0)  suc(0) d)fib(suc(0))  suc(0) e)fib(suc(suc(N))  plus(fib(suc(N)),fib(N)) 1.fib(suc(suc(suc(0)))) w/ rule e  2.plus(fib(suc(suc(0))),fib(suc(0))) w/ rule d  3.plus(fib(suc(suc(0))),suc(0)) w/ rule b  4.suc(plus(fib(suc(suc(0))),0)) w/ rule a  5.suc(fib(suc(suc(0)))) w/ rule e  6.suc(plus(fib(suc(0)),fib(0))) w/ rule c  7.suc(plus(fib(suc(0)),suc(0))) w/ rule b  8.suc(suc(plus(fib(suc(0)),0))) w/ rule a  9.suc(suc(fib(suc(0)))) w/ rule c  10.suc(suc(suc(0)))

Conditional Rewrite Rules: Abstract Syntax Rewrite Rule Base Rewrite Rule * LHS Term RHS Condition Equation * 2 X = 0  Y = 0 | X + Y  0 Rule with matching LHS can only be fired if condition is also verified Proving condition can be recursively done by rewriting it to true

Rewrite Rule Base Deduction Example: Is West Criminal? Rewrite Rule Base: a)criminal(P)  american(P)  weapon(W)  nation(N)  hostile(N)  sells(P,N,W) b)sells(west,nono,W)  owns(nono,W)  missile(W) c)hostile(N)  enemy(N,america) d)weapon(W)  missile(W) e)owns(nono,m1)  missile(m1)  american(west)  nation(nono)  enemy(nono,america)  true f)A  B  B  A g)A  A  A Term: criminal(P) american(P)  weapon(W)  nation(N)  hostile(N)  sells(P,N,W) w/ rule a american(P)  weapon(W)  nation(N)  hostile(N)  owns(nono,W)  missile(W) w/ rule b american(P)  weapon(W)  nation(N)  enemy(N,america)  owns(nono,W)  missile(W) w/ rule c american(P)  missile(W)  nation(N)  enemy(N,america)  owns(nono,W)  missile(W) w/ rule d american(P)  missile(W)  nation(N)  enemy(N,america)  owns(nono,W) w/ rule g... w/ rule f owns(nono,W)  missile(W)  american(P)  nation(N)  enemy(N,america) w/ rule f true w/ rule e

Rewriting Systems: Practical Application  Theorem proving  CASE:  Programming language formal semantics  Program verification  Compiler design and implementation  Model transformation and automatic programming  Data integration  Using XSLT an XML-based language to rewrite XML-based data and documents  Web server pages and web services (also using XSLT)

Implementing a Rewriting System in CHR   Map each conditional rewrite system rule of the form Condition | LHS  RHS onto a CHR  simplification rule of the form LHS  Condition | RHS i.e., map the rewrite rule condition onto the CHR  guard the rewrite rule LHS onto the CHR  head the rewrite rule RHS onto the CHR  body  For example: X = 0  Y = 0 | X + Y  0 becomes X + Y  X= 0, Y = 0 | 0  But this translation is naive and not working in the general case  The inferior expressive power of uni-directional and top-level only matching of a CHR  rule head with a constraint conjunction;  as compared to rewrite systems bi-directional and recursively down to any embedded sub-level unification of a rewrite rule LHS with an expression.

Implementing a Rewriting System in CHR   Overcoming matching's mono-directionality:  Ground terms in the rewrite rules must be transformed into non-ground terms with their variable values instantiated in the CHR  rule guard;  Overcoming matching's lack of recursivity down the embedded structures:  Each rewrite rule, must be translated into a set of CHR  simplification rules, one for each embedding context in which it can be recursively unified  In the general case, this can lead to an a CHR  base that is exponentially larger than the rewrite system base  ex: r) fib(0)  suc(0) translated as: r0@ fib(X)  X = 0 | suc(X) r1@ suc(fib(X))  X = 0 | suc(suc(X)) r2@ suc(suc(fib(X)))  X = 0 | suc(suc(suc(X)))... r1'@ plus(X,fib(Y))  Y = 0 | plus(X,suc(Y)) r2'@ plus(fib(X),Y)  X= 0 | plus(suc(X),suc(Y))...

CHR V vs. Rewriting Systems CHR V :  Matching applied to atomic formula conjunctions  Rule head is matched with constraint store sub-set, which requires head to be more general than sub-set  Propagation rules provide further simplification opportunities Rewriting Systems:  Unification of LHS is applied recursively down to sub-terms  Rule LHS is unified with sub-term which can thus be more general than LHS  All reasoning done through rewriting (no propagation rules) Common characteristics:  Forward chains rules  Requires conflict resolution strategy to choose:  Which of several matching rules to fire  Non-monotonic reasoning due to:  Constraint retraction in Rule-Defined Constraint Store  Retraction of substituted sub-term  Tricky confluence and termination issues

Production Rules: Abstract Syntax Production Rule Base Production Rule * Arithmetic Predicate Symbol Right-Hand Side (RHS) Action * Arithmetic Constant Symbol IF (p(X,a) OR p(X,b)) AND p(Y,Z) AND q(c) AND X <> Y AND X > 3.5 THEN Z = X + 12 AND add{r(a,c,Z} AND delete{p(Y,Z)} Fact Base * Atom And-Or Formula Connective: enum{and,or} Left-Hand Side (LHS) 2..* Arithmetic Calculation Fact Base Update Operator: enum{add,delete} Predicate Symbol Non-Ground Atom Constant Symbol Variable Ground Atom Non-Functional Term args Functor

Production System Architecture Fact Base Management Component Rule Firing Policy Component Host Language API Action Execution Component Fact Base Rule Base Pattern Matching Component Candidate Rules

Production Rules: Operational Semantics [Matching Instantiated Rule Set Empty] Pick one Instantiated Rule to Fire [Else] [Matching Instantiated Rule Set Singleton] Selected Instantiated Rule Execute in Sequence Actions in RHS of Selected Instantiated Rule Match LHS of Rule Base against Fact Base Rule Base Fact Base Matching Instantiated Rule Set

Conflict Resolution Strategies  Conflict resolution strategy:  Heuristic to choose at each cycle which of the matching rule set to fire  Common strategies:  Follow writing order of rules in rule base  Follow absolute priority level annotations associated with each rule or rule class  Follow relative priority level annotations associated with pairs of rules or rule classes  Prefer rules whose LHS match the most recently derived facts in the fact base  Prefer rules that have remained for the longest time unfired while matching a fact  Apply control meta-rules that declaratively specify arbitrarily sophisticated strategies

Production Rule Base Example: Is West Criminal? Production Rule Base: IF american(P) AND weapon(W) AND nation(N) AND hostile(N) AND sell(P,N,W) THEN add{criminal(P)} IF owns(nono,W) AND missile(W) THEN add{sells(west,nono,W) IF missile(W) THEN add{weapon(W)} IF enemy(N,america) THEN add{hostile(N)} Initial Fact Base: owns(nono,m1) missile(m1) american(west) nation(nono) enemy(nono,america) nation(america)

Production Rule Inference Example: Is West Criminal? criminal(P) american(P)weapon(W)nation(N)hostile(N)sells(P,N,W) criminal(west)? missile(W)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

Production Rule Inference Example: Is West Criminal? criminal(P) american(P)weapon(W)nation(N)hostile(N)sells(P,N,W) criminal(west)? missile(m1)enemy(nono,N)owns(nono,m1) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

Production Rule Inference Example: Is West Criminal? criminal(P) american(P)weapon(m1)nation(N)hostile(N)sells(P,N,W) criminal(west)? missile(W)enemy(nono,N)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

Production Rule Inference Example: Is West Criminal? criminal(P) american(P)weapon(m1)nation(N)hostile(N)sells(P,N,W) criminal(west)? missile(m1)enemy(nono,N)owns(nono,m1) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

Production Rule Inference Example: Is West Criminal? criminal(P) american(P)weapon(m1)nation(N)hostile(nono)sells(P,N,W) criminal(west)? missile(W)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enemy(nono,N)owns(nono,m1) sells(west,nono,W)

Production Rule Inference Example: Is West Criminal? criminal(P) american(P)weapon(m1)nation(N)hostile(nono)sells(P,N,W) criminal(west)? missile(m1)owns(nono,m1) missile(m1)american(west)nation(nono) nation(america) enemy(nono,america)owns(nono,m1) sells(west,nono,W)

Production Rule Inference Example: Is West Criminal? criminal(P) american(P)weapon(m1)nation(N)hostile(nono)sells(P,N,W) criminal(west)? missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,m1)

Production Rule Inference Example: Is West Criminal? criminal(P) american(west)weapon(m1)nation(nono)hostile(nono)sells(west,nono,m1) criminal(west)? missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,m1)

Production Rule Inference Example: Is West Criminal? criminal(west) weapon(m1)hostile(nono) criminal(west)? missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,m1)

Production Rule Inference Example: Is West Criminal? criminal(west) weapon(m1)hostile(nono) criminal(west)? yes missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,m1)

Properties of Production Systems  Confluence:  From confluent rule base, same final fact base is derived independently of rule firing order  Makes values of queries made to the system independent of the conflict resolution strategy  Termination:  Terminating system does not enter in an infinite loop;  Example of non-termination production rule base:  Initial fact base: p(0)  Production rule base: IF p(X) THEN Y = X + 1 AND add{p(Y)}  Any production system which conflict resolution strategy does not prevent the same rule instance to be fired in two consecutive cycles is trivially non-terminating.

Production System Inference vs. Lifted Forward Chaining Production System Inference  Sequential conjunction of actions in rule RHS  Non-monotonic reasoning due to delete actions  Matching only Datalog atoms (i.e., atoms which arguments are all non- functional terms)  Matching ground fact atoms against non-ground atoms in rule LHS And-Or atom  Neither sound nor complete inference engine Lifted Forward Chaining  Unique conclusion in Horn Clause  Monotonic reasoning  Unifying arbitrary first-order atoms, possibly functional  Unifying two arbitrary atoms, possibly both non-grounds  Sound and refutation-complete Common characteristics:  Data driven reasoning  Requires conflict resolution strategy to choose:  Which of several matching rules to fire  Which of several unifying clauses for next Modus Ponens inference step

Embedded Production System: Abstract Syntax HPL Operation HPL Ground Data Structure HPL Data Structure args * HPL Boolean Operation Right-Hand Side (RHS) Action * Fact Base Update Operator: enum{add,delete} Fact Base * Production Rule Base Production Rule * Left-Hand Side (LHS) And-Or Formula Connective: enum{and,or} 2..* HPL Boolean Operator HPL Operator

Generalized Production Rules: ECA Rules  Event-Condition-Action rule: extension of production rule with triggering event external to addition of facts in fact base  Only the rule subset which event just occurred is matched against the fact base  Events thus partition the rule base into subsets, each one specifying a behavior in response to a given events Event Condtion Action Rule Event LHS RHS Agent’s Percept HPL Boolean Operation

Production Systems: Practical Applications  Reactive agents  Expert systems in domains without complex entity taxonomy nor uncertainty  Business rules GUI Layer Data Layer Business Logic Layer Classic 3-Tier Information System Architecture Imperative OO Program Imperative OO Language SQL API Imperative OO Language GUI API Classic Imperative OO Implementation Rule-Based Implementation Imperative OO Host Language Embedded Production Rule Engine Imperative OO Language SQL API Imperative OO Language GUI API Production Rule Base Generic Component Reusable in Any Application Domain Easier to reflect frequent policy changes than imperative code

Semi-Natural Language Syntax for Production Rules  Associate key word or key phrase to:  Each domain model constant, function and predicate symbol  Each production rule syntactic construct  Each host programming language construct  Substitute in place of these constructs and symbols the associated words or phrase  Example: “Is West Criminal?” in semi-natural language syntax IF P is American AND P sells a W to N AND W is a weapon AND N is a nation AND N is hostile THEN P is a criminal IF nono owns a W AND W is a missile THEN west sells nono to W IF W is a missile THEN W is a weapon IF N is an enemy of America THEN N is hostile

Production Rules vs. Rewriting Rules Production System Inference  Fact base implicitly conjunctive  Matching only Datalog atoms (i.e., atoms which arguments are all non- functional terms)  Matching ground fact atoms against non-ground atoms in rule LHS And-Or atom Term Rewriting  Reified logical connectives in term provide full first-order expressivity  Unifying arbitrary first-order atoms, possibly functional  Unifying two arbitrary atoms, possibly both non-grounds Common characteristics:  Data driven reasoning  Requires conflict resolution strategy to choose:  Which of several matching rules to fire  Which of several rules with an LHS unifying with a sub-term  Non-monotonic reasoning due to:  Fact deletion actions in RHS  Retraction of substituted sub-term  Tricky confluence and termination issues

CHR V vs. Production Systems CHR V :  Constraint store contains arbitrary atoms including functional, non-ground atoms  Simplification rules allow straightforward modeling for goal-driven reasoning, with rewriting simulating Prolog-like backward chaining  Disjunctive bodies  Built-in backtracking search Production Systems:  Fact base only contains ground Datalog atoms  Cumbersome modeling to implement goal-driven reasoning  No disjunctions in RHS  No built-in search Common characteristics:  Forward chains rules  Requires conflict resolution strategy to choose:  Which of several matching rules to fire  Non-monotonic reasoning due to:  Constraint retraction in Rule-Defined Constraint Store  Fact retraction in the RHS  Tricky confluence and termination issues

Implementing a Production System in CHR   Map each production rule of the form: If m 1 and... and m l then a 1 and... and a n where: {a 1,..., a n } = {add(n 1 ),..., add(n i )}  {delete(o 1 ),..., delete(o j )}  {hplOp 1 (p 11,..., p 1n ),..., hplOp k (p k1,..., p km )}  onto a CHR  simpagation rule of the form: p 1,..., p r \ o 1,..., o j  hplOp 1 (p 11,..., p 1n ),..., hplOp k (p k1,..., p km ) | n 1,..., n i. where {p 1,..., p r } = {m 1,..., m l } \ {o 1,..., o j }  Valid only when:  {o 1,..., o j } \ {m 1,..., m l } = , and   C  {hplOp 1 (p 11,..., p 1n ),...,hplOp k (p k1,..., p km )},  O  {o 1,...,o j },  N  {n 1,...,n i } C occurs before O and N in a 1 and... and a n  i.e., there no direct way in CHR  to:  delete facts (ground constraints) not matched in the rule head  call host programming language operations after some matched facts have been deleted or add to the fact base (constraint store)  two possibilities allowed in production systems that make the resulting rule base operational behavior hard to comprehend, verify and maintain

Formal Logic Theory Intelligent Databases Formal Software Specification Automated Reasoning Declarative Programming Logic Programming: a Versatile Metaphor Logic Programming

Logic Programming: Key Ideas Logical Theory Software Specification Declarative Programming Automated Reasoning Intelligent Databases Logical Formula Abstract Specification Declarative Program / Data Structure Knowledge Base Database Theorem Prover Specification Verifier Interpreter / Compiler Inference Engine Query Processor Theorem Proof Specification Verification Program ExecutionInferenceQuery Execution Theorem Proving Strategy Verification Algorithm Single, Fixed, Problem-Independent Control Structure Inference Search Algorithm Query Processing Algorithm

Logic programming vision logic-based declarative semantics  Single language with logic-based declarative semantics that is: programming  A Turing-complete, general purpose programming language knowledge representation  A versatile, expressive knowledge representation language to support deduction and other reasoning services useful for intelligent agents (abduction, induction, constraint solving, belief revision, belief update, inheritance, planning) Data definition, query and update  Data definition, query and update language for databases with built-in inference capabilities  "One tool solves all" philosophy:  Any computation = resolution + unification + search  Programming = declaring logical axioms (Horn clauses)  Running the program = query about theorems provable from declared axioms  Algorithmic design entirely avoided (single, built-in control structure)  Same language for formal specification (modeling) and implementation  Same language for model checking and code testing

Prolog  First and still most widely used logic programming language  Falls short to fulfill the vision in many respect:  Many imperative constructs with no logical declarative semantics  No commercial deductive database available  Most other logic programming languages both:  Extend Prolog  Fulfill better one aspect of the logic programming vision  In the 80s, huge Japanese project tried to entirely rebuild all of computing from ground up using logic programming as hardware basis

Definite Logic Program +connective =  Definite Query +connective =  Definite Clause +connective =  clauses Pure Prolog: abstract syntax Pure Prolog Atom arg headbody 0..1 * * arg Pure Prolog Term * c 1 1 (...,X k 1,...) :- p 1 1 (...,X i 1,...),..., p m 1 (...,X j 1,...).... c 1 n (...,X k n,...) :- p 1 n (...,X i n,...),..., p m n (...,X j n,...). parent(al,jim)  parent(jim,joe)  anc(A,D)  parent(A,D)  anc(A,D)  parent(A,P)  anc(P,D) Numerical Symbol Function-Free TermFunctional Term Variable functor * Symbol predicate

Full Prolog Full Prolog Atom Full Prolog Query +connective =  Full Prologl Clause +connective =  head body 0..1 Full Prolog Program +connective =  * Semantics of full Prolog: Cannot be purely logic-based Must integrate algorithmic ones User-Defined Symbol Built-in Symbol Built-in Logical Symbol Built-in Imperative Symbol Meta-Programming Predicate Symbol Numerical Symbol I/O Predicate Symbol Program Update Predicate Symbol Search Customization Predicate Symbol Full Prolog Term Function-Free Term Functional Term Variable Symbol functor arg predicate * Prolog Literal +connective = naf arg *

Pure Prolog program declarative formal semantics  Declarative, denotational, intentional:  Clark’s transformation to CFOL formula  First-order formula semantically equivalent to program  Declarative, denotational, extentional, model-theoretic:  Least Herbrand Model  Intersection of all Herbrand Models  Conjunction of all ground formulas that are deductive consequences of program

CFOL x Prolog Semantic Assumptions Classical First-Order Predicate Logic:  No Unique Name Assumption (UNA): two distinct symbols can potentially be paraphrases to denote the same domain entity  Open-World Assumption (OWA): If KB |≠ Q but KB |≠  Q, the truth value of Q is considered unknown  Ex: KB: true  core(ai)  true  core(se)  core(C)  offered(C,T)  true  offered(mda,fall) Q: true  offered(mda,spring)  OWA necessary for monotonic, deductively sound reasoning: If KB |= T then  A, KB  A |= T Logic Programming:  UNA: two distinct symbols necessarily denote two distinct domain entities  Closed-World Assumption (CWA): If KB |≠ Q but KB |≠  Q, the truth value of Q is considered false  Ex: ?- offered(mda,spring) fail  CWA is a logically unsound form of negatively abductive reasoning  CWA makes reasoning inherently non-monotonic as one can have: KB |= T but KB  A |≠ T if the proof KB |= T included steps assuming A false by CWA  Motivation: intuitive, representational economy, consistent w/ databases

Clark’s completion semantics  Transform Pure Prolog Program P into semantically equivalent CFOL formula comp(P)  Same answer query set derived from P (abductively) than from F P (deductively)  Example P: core(se). core(ai). offered(mda,fall). offered(C,T) :- core(C). ?- offered(mda,spring) no ?-  Naive semantics naive(P):  C,T true  core(ai)  true  core(se)  true  offered(mda,fall)  core(C)  offered(C,T) naive(P) |≠  offered(mda,spring)  Clark’s completion semantics comp(P):  C,T,C 1,T 1 (core(C 1 )  (C 1 =ai  C 1 =se))  (offered(C 1,T 1 )  (C 1 =mda  T 1 =fall)  (  C,T (C 1 =C  T 1 =T  core(C))))   (ai=se)   (ai=mda)   (ai=fall)   (se=fall)   (se=mda)   (mda=fall) F p |=  offered(mda,spring)

Clark’s transformation  Axiomatizes closed-world and unique name assumptions in CFOL  Starts from naive Horn formula semantics of pure Prolog program  Partitions program in clause sets, each one defining one predicate (i.e., group together clauses with same predicate c(t 1,..., t n ) as conclusion)  Replaces each such set by a logical equivalence  One side of this equivalence contains c(X 1,..., X n ) where X 1,..., X n are fresh universally quantified variables  The other side contains a disjunction of conjunctions, one for each original clause  Each conjunction is either of the form:  X i = c i ...  X j = c i, if the original clause is a ground fact   Y i... Y j X i = Y i ...  X j = Y j  p 1 (...) ...  p n (... ) if the original clause is a rule with body p 1 (...) ...  p n (... ) containing variables Y i... Y j  Joins all resulting equivalences in a conjunction  Adds conjunction of the form  (c i = c j ) for all possible pairs (c i,c j ) of constant symbols in pure Prolog program

SLD Resolution  SLD resolution (Linear resolution with Selection function for Definite logic programs):  Joint use of goal-driven set of support and input resolution heuristics  Always pick last proven theorem clause with next untried axiom clause  Always questions last pick even if unrelated to failure that triggered backtracking  A form of goal-driven backward chaining of Horn clauses seen as deductive rules  Prolog uses special case of SLD resolution where:  Axiom clauses tried in top to bottom program writing order  Atoms to unify in the two picked clauses:  Conclusion of selected axiom clause  Next untried premise of last proven theorem clause in left to right program writing order (goal)  Unification without occur-check  Generates proof tree in top-down, depth-first manner Generates proof tree in top-down, depth-first manner  Failure triggers systematic, chronological backtracking: Failure triggers systematic, chronological backtracking  Try next alternative for last selection even if clearly unrelated to failure  Reprocess from scratch new occurrences of sub-goals previously proven true or false  Simple, intuitive, space-efficient, time-inefficient, potentially non- terminating (incomplete)

Refutation Resolution Proof Example Refutation proof principle:  To prove KB |= F  Prove logically equivalent: (KB  F) |= True  In turn logically equivalent to: (KB   F) |= False (american(P)  weapon(W)  nation(N)  hostile(N)  sells(P,N,W)  criminal(P)) //1  (T  owns(nono,m1)) //2a  (T  missile(m1)) //2b  (owns(nono,W)  missile(W)  sells(west,nono,W)) //3  (T  american(west)) //4  (T  nation(nono)) //5  (T  enemy(nono,america)) //6  (missile(W)  weapon(W)) //7  (enemy(N,america)  hostile(N)) //8  (T  nation(america)) //9  (criminal(west)  F) //0 1. Solve 0 w/ 1 unifying P/west: american(west)  weapon(W)  nation(N)  hostile(N)  sells(west,N,W)  F //10 2. Solve 10 w/ 4: weapon(W)  nation(N)  hostile(N)  sells(west,N,W)  F //11 3. Solve 11 w/ 7: missile(W)  nation(N)  hostile(N)  sells(west,N,W)  F //12 4. Solve 12 w/ 2b unifying W/m1: nation(N)  hostile(N)  sells(west,N,m1)  F //13 5. Solve 13 w/ 5 unifying N/nono: hostile(nono)  sells(west,nono,m1)  F //14 6. Solve 14 w/ 8 unifying N/nono: enemy(nono,america)  sells(west,nono,m1)  F //15 7. Solve 15 w/ 6: sells(west,nono,m1)  F //16 8. Solve 16 w/ 3 unifying W/m1: owns(nono,m1)  missile(m1)  F //17 9. Solve 17 with 2a: missile(m1)  F //18 10. Solve 18 with 2b: F

SLD resolution example criminal(P) american(P)weapon(W)nation(N)hostile(N)sells(P,N,W) criminal(west)? missile(W)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(P)weapon(W)nation(N)hostile(N)sells(P,N,W) criminal(west)? missile(W)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(west)weapon(W)nation(N)hostile(N)sells(west,N,W) criminal(west)? missile(W)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(west)weapon(W)nation(N)hostile(N)sells(west,N,W) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(west)weapon(m1)nation(N)hostile(N)sells(west,N,W) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(west)weapon(m1)nation(N)hostile(N)sells(west,N,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(west)weapon(m1)nation(nono)hostile(N)sells(west,N,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(west)weapon(m1)nation(nono)hostile(nono)sells(west,nono,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(west)weapon(m1)nation(nono)hostile(nono)sells(west,nono,m1) criminal(west)? missile(m1)enemy(nono,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example criminal(west) american(west)weapon(m1)nation(nono)hostile(nono)sells(west,nono,m1) criminal(west)? missile(m1)enemy(nono,america)owns(nono,W) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,m1)

SLD resolution example criminal(west) american(west)weapon(m1)nation(nono)hostile(nono)sells(west,nono,m1) criminal(west)? missile(m1)enemy(nono,america)owns(nono,m1) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,m1)

SLD resolution example criminal(west) american(west)weapon(m1)nation(nono)hostile(nono)sells(west,nono,m1) criminal(west)? yes missile(m1)enemy(nono,america)owns(nono,m1) missile(m1)american(west)nation(nono) nation(america) enermy(nono,america)owns(nono,m1) sells(west,nono,m1)

SLD resolution example with backtracking criminal(west) american(west)weapon(m1)nation(N)hostile(N)sells(west,N,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example with backtracking criminal(west) american(west)weapon(m1)nation(america)hostile(N)sells(west,N,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example with backtracking criminal(west) american(west)weapon(m1)nation(america)hostile(america)sells(west,america,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example with backtracking criminal(west) american(west)weapon(m1)nation(america)hostile(america)sells(west,america,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W) fail

SLD resolution example with backtracking criminal(west) american(west)weapon(m1)nation(america)hostile(america)sells(west,america,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W) fail backtrack

SLD resolution example with backtracking criminal(west) american(west)weapon(m1)nation(N)hostile(N)sells(west,N,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W) backtrack

SLD resolution example with backtracking criminal(west) american(west)weapon(m1)nation(N)hostile(N)sells(west,N,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example with backtracking criminal(west) american(west)weapon(m1)nation(nono)hostile(N)sells(west,N,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W)

SLD resolution example with bactracking criminal(west) american(west)weapon(m1)nation(nono)hostile(nono)sells(west,nono,m1) criminal(west)? missile(m1)enemy(N,america)owns(nono,W) missile(m1)american(west) nation(nono) nation(america)enermy(nono,america)owns(nono,m1) sells(west,nono,W)

Dual use of Prolog for AI knowledge representation  As knowledge representation language programming  As Turing-complete programming language Knowledge Base: Prolog Facts and Rules Inference Engine: Prolog Compiler/ Interpreter Ask Tell Retract Knowledge Base: Sentences in formalism F Inference Engine Implementing in Prolog Reasoning R in formalism F Ask Tell Retract Inference Engine: Prolog Compiler/ Interpreter

Limitations of Pure Prolog and ISO Prolog knowledge representation For knowledge representation:  search customization:  No declarative constructs  Limited support procedimental constructs (cuts)  no support for uncertain reasoning  forces unintuitive rule-based encoding of inherently taxonomic and procedural knowledge  knowledge base updates non- backtrackable and without logical semantics  ab :- assert(a), b. if b fails, a remains as true programming For programming:  no fine-grained encapsulation  no code factoring (inheritance)  poor data structures (function symbols as only construct)  mismatch with dominant object- oriented paradigm  not integrated to comprehensive software engineering methodology  IDE not friendly enough  scarce middleware  very scarce reusable libraries or components (ex, web, graphics)  mono-thread declarative logic For declarative logic programming:  imperative numerical computation, I/O and meta-programming without logical semantics

Limitation of SLD resolution engines  Unsound: unification without occur-check  Incomplete: left-recursion  Correct ancestor Prolog program: anc(A,D) :- parent(A,D). anc(A,D) :- parent(P,D), anc(A,P).  Logically equivalent program (since conjunction is a commutative connective) that infinitely loops: anc(A,D) :- anc(A,P), parent(P,D). anc(A,D) :- parent(A,D).  Inefficient:  repeated proofs of same sub-goals  irrelevant chronological backtracking

Prolog’s imperative arithmetics fac(0,1) :- !. fac(I,O) :- I1 is I - 1, fac(I1,O1), O is I * O1. ?- fac(1,X). X = 1 ?- fac(3,X). X = 6 ?- I1 is I -1 error ?- I1 = I -1 I1 = I -1 ?- I = 2, I1 = I -1 I1 = 2 -1 ?- I = 2, I1 is I -1 I1 = 1  Arithmetic functions and predicates generate exception if queried with non-ground terms as arguments  is: requires a uninstantiated variable on the left and an arithmetic expression on the right  Relational programming property lost  Syntax more like assembly than functional ! variable assignment  is: Prolog’s sole explicit variable assignment predicate (only for arithmetics) query  =: is a bi-directional, general- purpose unification query predicate

Prolog’s redundant sub-goal proofs

Extensions of pure Prolog Pure Prolog ISO Prolog High-Order LP Functional LP Constraint LP Abductive LP Transaction LP Frame (OO) LP Preference LP Tabled LP Inductive LP XSB Aleph Flora

Constraint Logic Programming (CLP)  CSP libraries’ strengths:  Specification level, declarative programming for predefined sets of constraints over given domains  Efficient  Extensive libraries cover both finite domain combinatorial problems and infinite numerical domain optimization problems  CSP libraries’ weaknesses:  Constraint set extension can only be done externally through API using general-purpose programming language  Same problem for mixed constraint problems (ex, mixing symbolic finite domain with real variables) Prolog’s s trengths:  Allows specification level, declarative programming of arbitrary general purpose problems  A constraint is just a predicate  New constraints easily declaratively specified through user predicate definitions  Mixed-domain constraints straightforwardly defined as predicate with arguments from different domains  Prolog’s weakness:  Numerical programming is imperative, not declarative  Very inefficient at solving finite domain combinatorial problem

CLP  Integrate Prolog with constraint satisfaction and solving libraries in a single inference engine  Get the best of both worlds:  Declarative user definition of arbitrary constraints  Declarative definition of arbitrarily mixed constraints  Declarative numerical and symbolic reasoning, seamlessly integrated  Efficient combinatorial and optimization problem solving  Single language to program constraint satisfaction or solving problems and the rest of the application CLP Engine CLP Application Rule Base Prolog Engine Procedural Solver for Domain D 1 Procedural Solver for Domain D k Solver Programming Language L... Prolog/L Bridge

Implementing a Prolog Program in CHR   Map Prolog fact base of the form {f 1.... f n.}  onto a fact introduction CHR  propagation rule: facts  f 1,..., f n.  Map each set of Prolog deductive rules of the form {p(t 1 1,...,t n 1 ) :- b 1.... p(t 1 k,...,t n k ) :- b k.} that provide the intentional part of the definition for predicate p  onto a CHR  simplification rule of the form p(x 1,...,x n )  (x 1 =t 1 1,..., x n =t n 1, b 1 ) ;...; (x 1 =t 1 k,..., x n =t n k, b k ). where {x 1,...,x n } is a set of fresh variables not occurring in {t 1 1,...,t n 1,b 1,... p(t 1 k,...,t n k ), b k }  Map each set of Prolog facts of the form {p(t' 1 1,...,t' n 1 ).,..., p(t' 1 k,...,t' n k ).} that provide the extensional part of the definition for predicate p  onto a CHR  world closure propagation rule of the form p(x 1,...,x n )  (x 1 =t' 1 1,..., x n =t' n 1 ) ;...; (x 1 =t' 1 k,..., x n =t' n k ).  Valid only for pure Prolog programs

Example Prolog Program Implemented in CHR   Prolog Program father(john,mary). father(john,peter). mother(jane,mary). person(john,male). person(peter,male). person(jane,female). person(mary,female). person(paul, male). parent(P,C) :- father(P,C). parent(P,C) :- mother(P,C). sibling(C1,C2) :- not C1 = C2, parent(P,C1), parent(P,C2).  CHR  Translation facts  father(john,mary), father(john,peter), mother(jane,mary), person(john,male), person(peter,male), person(jane,female), person(mary,female), person(paul, male). parent(P,C)  father(P,C) ; mother(P,C). sibling(C1,C2)  C1  C2 | parent(P,C1), parent(P,C2). father(F,C)  (F=john,C=mary) ; (F=john,C=peter). mother(M,C)  (M=jane,C=mary). person(P,G)  (P=john, G=male) ; (P=peter, G=male) ; (P=jane, G=male) ; (P=mary, G=male) ; (P=paul, G=male).

CHR V vs. Prolog  CFOL semantics of CHR V guardless, single head simplification rule, equivalent to CFOL semantics of pure Prolog clause set sharing same conclusion (Clark's completion)  Simplification rule: sh true | b 1 1,..., b k p ;... ; b 1 1,..., b l q. w here: {X 1,..., X n } = vars(sh i ), and {Y 1,..., Y m } = vars(b 1 ...  b k ) \ {X 1,..., X n }  X 1,..., X n true  (sh   Y 1,..., Y m ((b 1 1 ...  b k p ) ...  (b 1 1 ...  b k q ))  Equivalent Prolog clauses: { sh :- b 1 1,..., b k p.,..., sh :- b 1 1,..., b l q.}  Thus, using Clark's completion, any Prolog program can be reformulated into a semantically equivalent CHR V program  CHR V extends Prolog with:  Conjunctions in the heads  Guards  Non-ground numerical constraints heads, guards and bodies  Propagation rules

CLP with CHR CLP Engine CLP Application Rule Base Prolog Engine CHR Host Programming Language L CHR Engine CHR Base for Domain D 1 Solver CHR Base for Domain D k Solver... Prolog/L Bridge

CLP with CHR  CLP Application Rule Base CHR  Host Programming Language L CHR  Engine CHR Base for Domain D 1 Solver CHR Base for Domain D k Solver...

Ontologies Reasoning Components Agents Simulations Rule-Based Reasoning: Constraint Solving and Deduction Jacques Robin.

Similar presentations

Presentation on theme: "Ontologies Reasoning Components Agents Simulations Rule-Based Reasoning: Constraint Solving and Deduction Jacques Robin."— Presentation transcript:

Similar presentations

About project

Feedback

Log in

Auth with social network:

Ontologies Reasoning Components Agents Simulations Rule-Based Reasoning: Constraint Solving and Deduction Jacques Robin.

Similar presentations

Presentation on theme: "Ontologies Reasoning Components Agents Simulations Rule-Based Reasoning: Constraint Solving and Deduction Jacques Robin."— Presentation transcript:

Similar presentations

About project

Feedback