標(biāo)題: Titlebook: Conditional Term Rewriting Systems; Third International Micha?l Rusinowitch,Jean-Luc Rémy Conference proceedings 1993 Springer-Verlag Berl [打印本頁] 作者: ossicles 時(shí)間: 2025-3-21 19:07
書目名稱Conditional Term Rewriting Systems影響因子(影響力)
書目名稱Conditional Term Rewriting Systems影響因子(影響力)學(xué)科排名
書目名稱Conditional Term Rewriting Systems網(wǎng)絡(luò)公開度
書目名稱Conditional Term Rewriting Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Conditional Term Rewriting Systems被引頻次
書目名稱Conditional Term Rewriting Systems被引頻次學(xué)科排名
書目名稱Conditional Term Rewriting Systems年度引用
書目名稱Conditional Term Rewriting Systems年度引用學(xué)科排名
書目名稱Conditional Term Rewriting Systems讀者反饋
書目名稱Conditional Term Rewriting Systems讀者反饋學(xué)科排名
作者: paltry 時(shí)間: 2025-3-21 20:42 作者: 不適當(dāng) 時(shí)間: 2025-3-22 00:48
Explicit cyclic substitutions, lsexplicit substitutions’ used by Abadi, Cardelli, Curien, and Lévy [1] to describe sharing in .-terms. This leads to ‘explicit cyclic substitutions’ that can describe the mutual sharing of local recursive definitions. We demonstrate how this may be used to describe standard binding constructions (作者: 反話 時(shí)間: 2025-3-22 07:57 作者: 泥瓦匠 時(shí)間: 2025-3-22 10:39 作者: 不容置疑 時(shí)間: 2025-3-22 13:30
Collapsed tree rewriting: Completeness, confluence, and modularity,rees include applications of term rewrite rules as well as “folding steps” which identify common subexpressions. Different aspects of this model of computation are considered: (1) It is shown that collapsed tree rewriting is complete with respect to equational validity in the same sense as term rewr作者: 不容置疑 時(shí)間: 2025-3-22 18:06
Combinations of simplifying conditional term rewriting systems,any rewrite rule is greater than the right-hand side and the terms occurring in the conditions of that rule. If a simplifying join CTRS consists of finitely many rules, it is terminating and the applicability of a rewrite rule is decidable by recursively reducing the terms in the conditions. Conside作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-22 22:20 作者: incarcerate 時(shí)間: 2025-3-23 03:43
,Termination of combined (rewrite and λ-calculus) systems,iting systems in contrast to (extensions of) Tait-Girard‘s technique. In particular for some class of higher-order rule systems, we explicitly construct a well-founded ordering over .-terms whose combination with the .-reduction is terminating. Then, by embedding the higher-order rewriting relation 作者: 細(xì)節(jié) 時(shí)間: 2025-3-23 05:57
Type removal in term rewriting,ncy turns out to be a generalization of direct sum modularity. It is a more powerful tool for proving confluence and normalization properties. Strong normalization is persistent for the class of term rewriting systems for which not both duplicating rules and collapsing rules occur, generalizing a si作者: HACK 時(shí)間: 2025-3-23 11:55
Termination of term rewriting by interpretation, interpretations. A classification of types of termination is proposed built on properties in the semantic level. A transformation on term rewriting systems eliminating distributive rules is introduced. Using this distribution elimination a new termination proof of SUBST from [10] is given.作者: Obstacle 時(shí)間: 2025-3-23 15:13 作者: 繁榮中國(guó) 時(shí)間: 2025-3-23 19:32
A constructor-based approach for positive/negative-conditional equational specifications,itional equations. Under the assumption of confluence of the reduction relation we define, the factor algebra of the ground term algebra modulo the congruence of this reduction relation is a minimal model which is (beyond that) the minimum of all models that do not identify more constructor ground t作者: 墻壁 時(shí)間: 2025-3-23 23:25
Semantics for positive/negative conditional rewrite systems,s based on a well-founded ordering and leads to a perfect model semantics. The second — the built-in evaluation approach — is based on a set of predefined inequations and leads to an initial model semantics provided the inequations are interpreted in a non-standard way. Both approaches coincide if a作者: Ccu106 時(shí)間: 2025-3-24 03:58 作者: genuine 時(shí)間: 2025-3-24 10:10 作者: legislate 時(shí)間: 2025-3-24 10:45
Conditional term rewriting and first-order theorem proving,e propositional efficiency of theorem proving strategies, goal-sensitivity, and the use of semantics. We give several recommendations for theorem proving strategies to enable them to properly treat these issues. Although few current theorem provers implement these recommendations, we discuss the cla作者: 帶傷害 時(shí)間: 2025-3-24 15:18
Completeness of combinations of conditional constructor systems,o conditional constructor systems. We show that both completeness (i.e. the combination of confluence and strong normalization) and semi-completeness (confluence plus weak normalization) are decomposable properties of conditional constructor systems without extra variables in the conditions of the rewrite rules.作者: Brochure 時(shí)間: 2025-3-24 21:23
Termination of term rewriting by interpretation, interpretations. A classification of types of termination is proposed built on properties in the semantic level. A transformation on term rewriting systems eliminating distributive rules is introduced. Using this distribution elimination a new termination proof of SUBST from [10] is given.作者: diskitis 時(shí)間: 2025-3-25 00:36 作者: GULP 時(shí)間: 2025-3-25 04:00
A constructor-based approach for positive/negative-conditional equational specifications,itional equations. Under the assumption of confluence of the reduction relation we define, the factor algebra of the ground term algebra modulo the congruence of this reduction relation is a minimal model which is (beyond that) the minimum of all models that do not identify more constructor ground terms than necessary.作者: TRUST 時(shí)間: 2025-3-25 09:08 作者: Conflagration 時(shí)間: 2025-3-25 14:05 作者: neutrophils 時(shí)間: 2025-3-25 16:33 作者: 細(xì)查 時(shí)間: 2025-3-25 20:56 作者: 欲望小妹 時(shí)間: 2025-3-26 00:14
Transactions on Computational Science XXIo conditional constructor systems. We show that both completeness (i.e. the combination of confluence and strong normalization) and semi-completeness (confluence plus weak normalization) are decomposable properties of conditional constructor systems without extra variables in the conditions of the r作者: Ankylo- 時(shí)間: 2025-3-26 05:08
S. K. Saha,R. Kar,D. Mandal,S. P. Ghoshalrees include applications of term rewrite rules as well as “folding steps” which identify common subexpressions. Different aspects of this model of computation are considered: (1) It is shown that collapsed tree rewriting is complete with respect to equational validity in the same sense as term rewr作者: 刺耳的聲音 時(shí)間: 2025-3-26 10:51
Marina L. Gavrilova,C. J. Kenneth Tanany rewrite rule is greater than the right-hand side and the terms occurring in the conditions of that rule. If a simplifying join CTRS consists of finitely many rules, it is terminating and the applicability of a rewrite rule is decidable by recursively reducing the terms in the conditions. Conside作者: 易受騙 時(shí)間: 2025-3-26 14:51
Nikolay Tcholtchev,Ina Schieferdeckerte) terminating TRSs .., .. is non-terminating, then one of the systems, say .., enjoys an interesting property, namely it is not termination preserving under non-deterministic collapses, i.e. .. ⊕ {. is non-terminating, and the other system .. is collapsing, i.e. contains a rule with a variable rig作者: 松軟 時(shí)間: 2025-3-26 18:00
Zhengbiao Guo,Zhitang Li,Hao Tu,Da Xieiting systems in contrast to (extensions of) Tait-Girard‘s technique. In particular for some class of higher-order rule systems, we explicitly construct a well-founded ordering over .-terms whose combination with the .-reduction is terminating. Then, by embedding the higher-order rewriting relation 作者: amyloid 時(shí)間: 2025-3-26 22:39
Lecture Notes in Computer Sciencency turns out to be a generalization of direct sum modularity. It is a more powerful tool for proving confluence and normalization properties. Strong normalization is persistent for the class of term rewriting systems for which not both duplicating rules and collapsing rules occur, generalizing a si作者: 魔鬼在游行 時(shí)間: 2025-3-27 02:06
Luis F. Gutiérrez,Sergio Vargas,Félix Ramos interpretations. A classification of types of termination is proposed built on properties in the semantic level. A transformation on term rewriting systems eliminating distributive rules is introduced. Using this distribution elimination a new termination proof of SUBST from [10] is given.作者: 全部 時(shí)間: 2025-3-27 05:26
Transactions on Computational Science XXIVon is explicit here because induction orderings must be integrated into the specification. However, the proofs need less guidance if the specification is ground confluent and strongly terminating. Calculi for verifying these conditions are presented along with a list of useful applications.作者: 潛伏期 時(shí)間: 2025-3-27 09:45 作者: 漫步 時(shí)間: 2025-3-27 16:25 作者: Ordnance 時(shí)間: 2025-3-27 19:42
https://doi.org/10.1007/978-3-662-54563-8y. Technically proofs by consistency will be similar to proofs by case analysis over the term structure. As our method also allows to prove sufficient-completeness of function definitions in parallel with proving an inductive theorem we need not distinguish between constructors and defined functions作者: 不出名 時(shí)間: 2025-3-28 01:56
Alok Kumar Singh Kushwaha,Rajeev Srivastavaieve this to be a useful method for many practical applications involving clausal reasoning where the theory stays constant and is used repeatedly for proving many goals. Program synthesis (see [3]) is such an application. We have implemented a prototype completion procedure in Prolog and used it fo作者: 蛙鳴聲 時(shí)間: 2025-3-28 02:14 作者: 鍍金 時(shí)間: 2025-3-28 07:05 作者: 歡呼 時(shí)間: 2025-3-28 13:02 作者: Foment 時(shí)間: 2025-3-28 16:31 作者: 古文字學(xué) 時(shí)間: 2025-3-28 19:26 作者: 吵鬧 時(shí)間: 2025-3-28 23:09 作者: 毛細(xì)血管 時(shí)間: 2025-3-29 04:01
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/235213.jpg作者: 債務(wù) 時(shí)間: 2025-3-29 10:03
https://doi.org/10.1007/3-540-56393-8Automat; automated deduction; programming; programming language; proving; semantics; theorem proving作者: 致詞 時(shí)間: 2025-3-29 11:37 作者: 概觀 時(shí)間: 2025-3-29 16:11 作者: 柔軟 時(shí)間: 2025-3-29 22:45
Transactions on Computational Science XXIIIWe show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the “binary path condition”, suffices for establishing termination of extended rewriting modulo associativity and commutativity.作者: Assault 時(shí)間: 2025-3-30 03:35
Simple type inference for term graph rewriting systems,A methodology Tor polymorphic type inference for general term graph rewriting systems is presented. This requires modified notions of type and of type inference due to the absence of structural induction over graphs. Induction over terms is replaced by dataflow analysis.作者: 信任 時(shí)間: 2025-3-30 06:46 作者: 分期付款 時(shí)間: 2025-3-30 11:22
0302-9743 f Parisin 1987 and the second atConcordia University, Montreal, in1990. Their proceddings are published as Lecture Notes inComputer Science Volumes 308 and 516 respectively.978-3-540-56393-8978-3-540-47549-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 聽覺 時(shí)間: 2025-3-30 15:55
0302-9743 France, July 8-10, 1992.Topics covered include conditional rewriting and itsapplications to programming languages, specificationlanguages, automated deduction, constrained rewriting, typedrewriting, higher-order rewriting, and graph rewriting.The volume contains 40 papers, includingfour invited talk作者: 細(xì)胞學(xué) 時(shí)間: 2025-3-30 18:02 作者: Gratuitous 時(shí)間: 2025-3-30 22:12 作者: 發(fā)怨言 時(shí)間: 2025-3-31 01:07 作者: intrude 時(shí)間: 2025-3-31 05:31
Lecture Notes in Computer Sciencenormalization is persistent for the class of term rewriting systems for which not both duplicating rules and collapsing rules occur, generalizing a similar result of Rusinowitch for modularity. This result can be used for simplifying proofs on undecidabilily.作者: WAIL 時(shí)間: 2025-3-31 12:28
Transactions on Computational Science XXIXined inequations and leads to an initial model semantics provided the inequations are interpreted in a non-standard way. Both approaches coincide if a suitable inequation covering property is satisfied.作者: synchronous 時(shí)間: 2025-3-31 17:16 作者: 類似思想 時(shí)間: 2025-3-31 19:00 作者: 沉積物 時(shí)間: 2025-3-31 23:42 作者: Peculate 時(shí)間: 2025-4-1 03:06
Alok Kumar Singh Kushwaha,Rajeev Srivastavas work is the incorporation of equational reasoning. With the addition of equality, this method becomes viable for conditional equations, and it would extend the currently known completion procedures for them [2, 5].作者: Esalate 時(shí)間: 2025-4-1 06:51 作者: Enthralling 時(shí)間: 2025-4-1 13:51
Combinations of simplifying conditional term rewriting systems,t no other function symbols. It will be shown that the combined CTRS . = .. ∪ .. is simplifying if and only if .. and .. are simplifying. Moreover, confluence is a modular property of finite simplifying join CTRSs.作者: defenses 時(shí)間: 2025-4-1 15:46 作者: CLEAR 時(shí)間: 2025-4-1 22:29
Reduction techniques for first-order reasoning,s work is the incorporation of equational reasoning. With the addition of equality, this method becomes viable for conditional equations, and it would extend the currently known completion procedures for them [2, 5].作者: BUST 時(shí)間: 2025-4-2 01:26
