Foundations of the rule-based system ρLog

We describe the foundations of a system for rule-based programming which integrates two powerful mechanisms: (1) matching with context variables, sequence variables, and regular constraints for their matching values; and (2) strategic programming with labeled rules. The system is called ρLog, and is built on top of the pattern matching and rule-based programming capabilities of Mathematica.

[2]  Krzysztof R. Apt,et al.  Logic Programming and Negation: A Survey , 1994, The Journal of Logic Programming.

[3]  Razvan Diaconescu,et al.  Logical foundations of CafeOBJ , 2002, Theor. Comput. Sci..

[4]  Eelco Visser,et al.  Program Transformation with Stratego/XT: Rules, Strategies, Tools, and Systems in Stratego/XT 0.9 , 2003, Domain-Specific Program Generation.

[5]  Enno Ohlebusch,et al.  Termination of Logic Programs: Transformational Methods Revisited , 2001, Applicable Algebra in Engineering, Communication and Computing.

[6]  Eelco Visser,et al.  A core language for rewriting , 1998, WRLA.

[7]  Claude Kirchner,et al.  A rho-Calculus of Explicit Constraint Application , 2004, WRLA.

[8]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[9]  Clara Bertolissi,et al.  A rewriting calculus for cyclic higher-order term graphs , 2004, Mathematical Structures in Computer Science.

[10]  autoepistemic Zogic.  Logic programming and negation : a survey , 2001 .

[12]  Clara Bertolissi,et al.  A Rewriting Calculus for Cyclic Higher-order Term Graphs , 2005, Electron. Notes Theor. Comput. Sci..

[13]  Temur Kutsia,et al.  On the Implementation of a Rule-Based Programming System and Some of its Applications , 2008 .

[14]  Jan A. Bergstra,et al.  The algebraic specification formalism ASF , 1989 .

[15]  Claude Kirchner,et al.  ELAN from a rewriting logic point of view , 2002, Theor. Comput. Sci..

[16]  Narciso Martí-Oliet,et al.  Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..

[17]  Aart Middeldorp,et al.  New completeness results for lazy conditional narrowing , 2004, PPDP '04.

[18]  Luigi Liquori,et al.  Rewriting Calculus with Fixpoints: Untyped and First-Order Systems , 2003, TYPES.

[19]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[20]  Temur Kutsia,et al.  Matching with Regular Constraints , 2005, LPAR.

[21]  Alexander Bockmayr.  Beiträge zur Theorie des logisch-funktionalen Programmierens , 1990 .

[22]  Mircea Marin,et al.  Deduction and Presentation in rho Log , 2004, Electron. Notes Theor. Comput. Sci..