ACD Term Rewriting

被引:11
|
作者
Duck, Gregory J. [1 ]
Stuckey, Peter J. [1 ]
Brand, Sebastian [1 ]
机构
[1] Univ Melbourne, Dept Comp Sci & Software Engn, NICTA Victoria Lab, Parkville, Vic 3052, Australia
来源
关键词
D O I
10.1007/11799573_11
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we introduce Associative Commutative Distributive Term Rewriting (ACDTR), a rewriting language for rewriting logical formulae. ACDTR extends AC term rewriting by adding distribution of conjunction over other operators. Conjunction is vital for expressive term rewriting systems since it allows us to require that multiple conditions hold for a term rewriting rule to be used. ACDTR uses the notion of a "conjunctive context", which is the conjunction of constraints that must hold in the context of a term, to enable the programmer to write very expressive and targeted rewriting rules. ACDTR can be seen as a general logic programming language that extends Constraint Handling Rules and AC term rewriting. In this paper we define the semantics of ACDTR and describe our prototype implementation.
引用
收藏
页码:117 / 131
页数:15
相关论文
共 50 条
  • [1] Cadmium: An Implementation of ACD Term Rewriting
    Duck, Gregory J.
    De Koninck, Leslie
    Stuckey, Peter J.
    [J]. LOGIC PROGRAMMING, PROCEEDINGS, 2008, 5366 : 531 - +
  • [2] Demand-Driven Normalisation for ACD Term Rewriting
    De Koninck, Leslie
    Duck, Gregory J.
    Stuckey, Peter J.
    [J]. LOGIC PROGRAMMING, 2009, 5649 : 484 - +
  • [3] Term Graph Rewriting and Parallel Term Rewriting
    Corradini, Andrea
    Drewes, Frank
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (48): : 3 - 18
  • [4] TERM REWRITING
    THOMAS, M
    [J]. COMPUTER JOURNAL, 1991, 34 (01): : 1 - 1
  • [5] Natural rewriting for general term rewriting systems
    Escobar, S
    Meseguer, J
    Thati, P
    [J]. LOGIC BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2005, 3573 : 101 - 116
  • [6] A Rewriting Machine and Optimization of Strategies of Term Rewriting
    A. A. Letichevskii
    V. V. Khomenko
    [J]. Cybernetics and Systems Analysis, 2002, 38 (5) : 637 - 649
  • [7] ON THE ADEQUACY OF GRAPH REWRITING FOR STIMULATING TERM REWRITING
    KENNAWAY, JR
    KLOP, JW
    SLEEP, MR
    DEVRIES, FJ
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (03): : 493 - 523
  • [8] Term rewriting and Hoare logic - Coded rewriting
    Sun, Y
    [J]. INFORMATION PROCESSING LETTERS, 1996, 60 (05) : 237 - 242
  • [9] Implementing conditional term rewriting by graph rewriting
    Ohlebusch, E
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 311 - 331
  • [10] From Infinitary Term Rewriting to Cyclic Term Graph Rewriting and back
    Bahr, Patrick
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (48): : 2 - 2