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 条
  • [41] ARCHITECTURE FOR CONDITIONAL TERM REWRITING
    RUSH, T
    COLEMAN, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 308 : 266 - 278
  • [42] Homomorphisms and concurrent term rewriting
    Seynhaeve, F
    Tison, S
    Tommasi, M
    [J]. FUNDAMENTALS OF COMPUTATION THEORY, 1999, 1684 : 475 - 487
  • [43] Term rewriting for normalization by evaluation
    Berger, U
    Eberl, M
    Schwichtenberg, H
    [J]. INFORMATION AND COMPUTATION, 2003, 183 (01) : 19 - 42
  • [44] Term rewriting for access control
    Barker, Steve
    Fernandez, Maribel
    [J]. DATA AND APPLICATIONS SECURITY XX, PROCEEDINGS, 2006, 4127 : 179 - 193
  • [45] Constrained Term Rewriting tooL
    Kop, Cynthia
    Nishida, Naoki
    [J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 549 - 557
  • [46] The termination hierarchy for term rewriting
    Zantema, H
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2001, 12 (1-2) : 3 - 19
  • [47] Origin tracking in term rewriting
    Klop, JW
    [J]. REWRITING TECHNIQUES AND APPLICATIONS, 1998, 1379 : 1 - 1
  • [48] Relative undecidability in term rewriting
    Geser, A
    Middeldorp, A
    Ohlebusch, E
    Zantema, H
    [J]. COMPUTER SCIENCE LOGIC, 1997, 1258 : 150 - 166
  • [49] Modularity in term rewriting revisited
    Gramlich, Bernhard
    [J]. THEORETICAL COMPUTER SCIENCE, 2012, 464 : 3 - 19
  • [50] A TERM-REWRITING CHARACTERIZATION OF PSPACE
    Eguchi, N.
    [J]. PROCEEDINGS OF THE 10TH ASIAN LOGIC CONFERENCE, 2010, : 93 - 112