CONDITIONAL NARROWING MODULO A SET OF EQUATIONS

被引:9
|
作者
BOCKMAYR, A [1 ]
机构
[1] MAX PLANCK INST INFORMAT,W-6600 SAARBRUCKEN,GERMANY
关键词
CONDITIONAL REWRITING; CONDITIONAL NARROWING; E-UNIFICATION; CONSTRAINT LOGIC AND FUNCTIONAL PROGRAMMING;
D O I
10.1007/BF01202035
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Narrowing is a universal unification procedure for equational theories given by a canonical term rewrite system. In this paper we introduce conditional narrowing modulo a set of conditional equations and give a full proof of its correctness and completeness for equational conditional rewrite systems R,E without extravariables where E is regular and R,E is Church-Rosser modulo E and decreasing modulo E. This result can be seen as the theoretical foundation of a special form of constraint logic and functional programming.
引用
收藏
页码:147 / 168
页数:22
相关论文
共 50 条
  • [31] Conditional uncertain set and conditional membership function
    Kai Yao
    Fuzzy Optimization and Decision Making, 2018, 17 : 233 - 246
  • [32] Conditional uncertain set and conditional membership function
    Yao, Kai
    FUZZY OPTIMIZATION AND DECISION MAKING, 2018, 17 (02) : 233 - 246
  • [33] Distribution of a sparse set of fractions modulo q
    Cobeli, C
    Zaharescu, A
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2001, 33 : 138 - 148
  • [34] On Set-Valued Derivations Modulo K
    Jablonska, Eliza
    JOURNAL OF CONVEX ANALYSIS, 2025, 32 (04) : 1135 - 1144
  • [35] On the Set of Images Modulo Viewpoint and Contrast Changes
    Sundaramoorthi, G.
    Petersen, P.
    Varadarajan, V. S.
    Soatto, S.
    CVPR: 2009 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOLS 1-4, 2009, : 832 - 839
  • [36] EQUALITY OF ORDERS OF A SET OF INTEGERS MODULO A PRIME
    Jarviniemi, Olli
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2021, 149 (09) : 3651 - 3668
  • [37] The set of k-units modulo n
    Castillo, John H.
    Caranguay Mainguez, Jhony Fernando
    INVOLVE, A JOURNAL OF MATHEMATICS, 2022, 15 (03): : 367 - 378
  • [38] Answer Set Programming as SAT modulo Acyclicity
    Gebser, Martin
    Janhunen, Tomi
    Rintanen, Jussi
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 351 - 356
  • [39] LSE narrowing for decreasing conditional term rewrite systems
    Bockmayr, A
    Werner, A
    CONDITIONAL AND TYPED REWRITING SYSTEMS, 1995, 968 : 51 - 70
  • [40] On the complexity of deduction modulo leaf permutative equations
    De la Tour, TB
    Echenim, M
    JOURNAL OF AUTOMATED REASONING, 2004, 33 (3-4) : 271 - 317