標(biāo)題: Titlebook: Rewriting Techniques and Applications; 9th International Co Tobias Nipkow Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 199 [打印本頁(yè)] 作者: LANK 時(shí)間: 2025-3-21 17:29
書目名稱Rewriting Techniques and Applications影響因子(影響力)
書目名稱Rewriting Techniques and Applications影響因子(影響力)學(xué)科排名
書目名稱Rewriting Techniques and Applications網(wǎng)絡(luò)公開度
書目名稱Rewriting Techniques and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Rewriting Techniques and Applications被引頻次
書目名稱Rewriting Techniques and Applications被引頻次學(xué)科排名
書目名稱Rewriting Techniques and Applications年度引用
書目名稱Rewriting Techniques and Applications年度引用學(xué)科排名
書目名稱Rewriting Techniques and Applications讀者反饋
書目名稱Rewriting Techniques and Applications讀者反饋學(xué)科排名
作者: 北極熊 時(shí)間: 2025-3-21 21:37
Decidable and undecidable second-order unification problems,s happens, for example, for one-variable problems where the variable occurs at most twice (because rigid E-unification is decidable for just one equation). We also prove decidability when no variable occurs more than once, hence significantly narrowing the gap between decidable and undecidable secon作者: 無(wú)目標(biāo) 時(shí)間: 2025-3-22 04:03
Friedrich Otto,Andrea Sattler-Klein,Klaus Madlener..作者: 水汽 時(shí)間: 2025-3-22 05:15 作者: 寬宏大量 時(shí)間: 2025-3-22 10:38 作者: Painstaking 時(shí)間: 2025-3-22 15:58
Anatoli Degtyarev,Yuri Gurevich,Paliath Narendran,Margus Veanes,Andrei Voronkovory, demographics, density, political governance, and social challenges. The findings indicate that in general the mobilisation of local inhabitants is significant to the process of social innovation in urban development, whilst an active citizenship can support a reproduction of innovation to incre作者: GEM 時(shí)間: 2025-3-22 18:11 作者: 倫理學(xué) 時(shí)間: 2025-3-22 23:34
Witold Charatonik,Andreas Podelski015 the housing estate surrounding Dickens Orchard included the most deprived area in the city and the 254th most deprived area in the England, placing this area inside the bottom 1% nationally. The findings of this case indicate that forming constructive state-civil society partnerships is importan作者: AWE 時(shí)間: 2025-3-23 01:25 作者: 新奇 時(shí)間: 2025-3-23 07:28
Claude Marché,Xavier Urbaint of 32,844, placing it at the national bottom 3%. This case study demonstrates how a social innovation intervention at the neighbourhood level is able to be translated and scaled-up into an urban policy, enabling the growth and replication of initiatives to effect far-reaching urban changes.作者: NIP 時(shí)間: 2025-3-23 12:57
978-3-540-64301-2Springer-Verlag Berlin Heidelberg 1998作者: parallelism 時(shí)間: 2025-3-23 15:56 作者: ligature 時(shí)間: 2025-3-23 18:06 作者: glamor 時(shí)間: 2025-3-24 01:50
https://doi.org/10.1007/BFb0052355Algorithms; Automat; Constraint; Monoid; Rack; Resolution; Variable; algorithm; functional programming; lambd作者: 確定 時(shí)間: 2025-3-24 06:23
Normalization of S-terms is decidable,The combinator S has the reduction rule . . (.). We investigate properties of ground terms built from S alone. We show that it is decidable whether such an .-term has a normal form. The decision procedure makes use of rational tree languages. We also exemplify and summarize other properties of .-terms and hint at open questions.作者: 平靜生活 時(shí)間: 2025-3-24 09:48 作者: conscribe 時(shí)間: 2025-3-24 13:49
Simultaneous critical pairs and Church-Rosser property,y left-linear term rewriting systems. Our result extends the well-known criterion given by Huet (1980), Toyama (1988), and Oostrom (1997) and incomparable with other well-known criteria for left-linear systems.作者: Conduit 時(shí)間: 2025-3-24 18:06
Church-Rosser theorems for abstract reduction modulo an equivalence relation,hnique is extended in two ways to abstract rewriting modulo an equivalence relation. It is shown that known Church-Rosser theorems can be viewed as special cases of the new criteria. Moreover, applications of the new criteria yield several new results.作者: 繁忙 時(shí)間: 2025-3-24 21:19
-unification for subsystems of ,al modal logics . and .. It presents improved unification algorithms for certain forms of the right identity and associativity laws. The algorithms employ mutation rules, which have the advantage that terms are worked off from the outside inward, making paramodulating into terms superfluous.作者: MAPLE 時(shí)間: 2025-3-25 00:51 作者: 古董 時(shí)間: 2025-3-25 03:28 作者: DEAWL 時(shí)間: 2025-3-25 09:00
Origin tracking in term rewriting,g and in higher-order rewriting, such as lambda calculus. Recently this classical notion has been given much attention. On the one hand, the notion has been studied in an abstract, axiomatic way, in order to isolate the essential properties of the descendant concept. On the other hand descendants we作者: Gesture 時(shí)間: 2025-3-25 12:07 作者: 玩忽職守 時(shí)間: 2025-3-25 16:38 作者: INCUR 時(shí)間: 2025-3-25 23:05
Automatic monoids versus monoids with finite convergent presentations,hrough finite automata based on a regular set of (not necessarily unique) representatives for the group, and hence, each automatic group has a tractable word problem and low derivational complexity. Consequently it has been asked whether corresponding results also hold for .. Here we show that there作者: 認(rèn)為 時(shí)間: 2025-3-26 03:03 作者: 斜坡 時(shí)間: 2025-3-26 08:21
On the exponent of periodicity of minimal solutions of context equations,ation was proved by Makanin, the decidability of context unification is currently an open question. This paper provides a step in understanding the complexity of context unification and the structure of unifiers. It is shown, that if a context unification problem of size . is unifiable, then there i作者: 原告 時(shí)間: 2025-3-26 09:55
Unification in extensions of shallow equational theories,standard equational theories. In order to prove decidability of unification in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality constraints between brother subterms as well as shallow作者: arthroscopy 時(shí)間: 2025-3-26 15:40
Unification and matching in process algebras, as two process algebraic terms with . variables are said to be compatible modulo some equivalence relation if a substitution on the free variables can make the resulting terms equivalent modulo that relation. We formulate this compatibility (modulo an equivalence relation) checking problems as . in作者: 流浪者 時(shí)間: 2025-3-26 19:48 作者: HARP 時(shí)間: 2025-3-26 22:50 作者: Harridan 時(shí)間: 2025-3-27 01:47
Decidable approximations of sets of descendants and sets of normal forms,chniques. In the context of rewriting logic, a Term Rewriting System is a program, and a normal form is a result of the program. Thus, approximations of sets of descendants and sets of normal forms provide tools for analysing a few properties of programs: we show how to compute a superset of results作者: CHIP 時(shí)間: 2025-3-27 08:48
Algorithms and reductions for rewriting problems,gorithm for Unique-normal-form property of ground systems for the first time. Next we prove undecidability of these problems for a fixed string rewriting system using our reductions. Finally, we prove partial decidability results for Confluence of commutative semi-thue systems. The Confluence and Un作者: 我悲傷 時(shí)間: 2025-3-27 12:53
The decidability of simultaneous rigid ,-unification with one variable,mplies that the ?*??* fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the ??-fragment, we obtain ., .. It is also proved that SREU with one variable and a constant bound on the number of rigid equations is P-complete.作者: 英寸 時(shí)間: 2025-3-27 15:57
Ordering constraints over feature trees expressed in second-order monadic logic,es. We investigate decidability and complexity questions for fragments of the first-order theory of FT≤. It is well-known that the first-order theory of FT is decidable and that several of its fragments can be decided in quasi-linear time, including the satisfiability problem of FT and its entailmen作者: 否決 時(shí)間: 2025-3-27 19:10 作者: 吞下 時(shí)間: 2025-3-28 00:39 作者: 預(yù)兆好 時(shí)間: 2025-3-28 03:43 作者: 王得到 時(shí)間: 2025-3-28 09:24
Decidable approximations of sets of descendants and sets of normal forms,rategy. The main technical contribution of the paper is the construction of an approximation automaton which recognises a superset of the set of normal forms of terms in a set ., w.r.t. a Term Rewriting System ..作者: HEPA-filter 時(shí)間: 2025-3-28 11:26 作者: 光明正大 時(shí)間: 2025-3-28 17:00 作者: 獨(dú)行者 時(shí)間: 2025-3-28 20:34 作者: enmesh 時(shí)間: 2025-3-29 00:43
Algorithms and reductions for rewriting problems,ique-normal-form property are shown Expspace-hard for commutative semi-thue systems. We also show that there is a family of string rewrite systems for which the word problem is trivially decidable but confluence undecidable, and we show a linear equational theory with decidable word problem but undecidable linear equational matching.作者: 說(shuō)笑 時(shí)間: 2025-3-29 04:16
Modularity of termination using dependency pairs,s yields new modularity criteria which extend previous results in this area. In particular, existing results for modularity of innermost termination can easily be obtained as direct consequences of our new criteria.作者: acquisition 時(shí)間: 2025-3-29 10:46
0302-9743 ing rewriting, theorem proving, resolution, normalization, unification, equational logics, lambda calculus, constraint solving, and functional programming.978-3-540-64301-2978-3-540-69721-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Radiation 時(shí)間: 2025-3-29 14:14 作者: Flagging 時(shí)間: 2025-3-29 19:35
Ordering constraints over feature trees expressed in second-order monadic logic,h existential quantifiers is decidable but PSPACE-hard. Our decidability proof is based on a new technique where feature constraints are expressed in second-order monadic logic with countably many successors SΩS. We thereby reduce the entailment problem of FT≤with existential quantification to Rabin‘s famous theorem on tree automata.作者: 顯而易見 時(shí)間: 2025-3-29 21:05 作者: locus-ceruleus 時(shí)間: 2025-3-30 03:29 作者: 品牌 時(shí)間: 2025-3-30 04:08 作者: Fillet,Filet 時(shí)間: 2025-3-30 08:37 作者: Multiple 時(shí)間: 2025-3-30 14:30 作者: 江湖騙子 時(shí)間: 2025-3-30 20:36 作者: arabesque 時(shí)間: 2025-3-30 21:54
Martin Müller,Joachim Niehren social innovation processes undertaken in the production of urban food spaces and, if present, what accounts for these?’ In so doing, it examines the relationships between social innovation processes to establish a common pattern of innovation through which urban stakeholders collaboratively produc作者: CLOT 時(shí)間: 2025-3-31 04:49 作者: 殖民地 時(shí)間: 2025-3-31 06:17 作者: 不溶解 時(shí)間: 2025-3-31 09:15
Claude Marché,Xavier Urbainin planning proposals incorporating food growing. The Keep Community Orchard represented a significant influence on this policy-based innovation, specifically the PANO6 Food Growing and Development Planning Advice Note (2011), the first of its kind in the UK. A community orchard was integrated withi作者: adjacent 時(shí)間: 2025-3-31 16:42
Pollution, Environmental Perturbation and Consequent Loss of Wetlands,which include a higher explosion of human population, considerable alteration in land use and land covers, modern agricultural practices, higher pace of urbanization, burgeoning development of industries and non-judicious use of watersheds. All of these changes usually during last one century have r作者: 周年紀(jì)念日 時(shí)間: 2025-3-31 20:01
Polyacrylate und Polymethacrylate,alische Polymerisationsverfahren in Frage. Die einen gr??eren apparativen Aufwand erfordernde anionische Polymerisation wird dort eingesetzt, wo Acrylate mit funktionellen Gruppen, die bei der radikalischen Polymerisation st?ren, polymerisiert werden sollen.作者: harangue 時(shí)間: 2025-3-31 23:22
Cerebrospinal Blood Flow and Its Regulationphenotype but also the pathophysiology of various neurodegenerative disorders, including Alzheimer’s disease and amyotrophic lateral sclerosis. In this review, we briefly highlight cerebral and spinal blood flow and its autoregulation and show its relationship to neurological diseases.作者: vasculitis 時(shí)間: 2025-4-1 02:30
Obstruktive Schlafapnoe im Kindesalter,g für die perioperative Planung. Die Sicherheitsaspekte im Umgang mit OSA-Kindern betreffen insbesondere die perioperative Atemwegssicherung und die ausreichend lange überwachung der respiratorischen Funktionen.作者: Patrimony 時(shí)間: 2025-4-1 09:06 作者: etidronate 時(shí)間: 2025-4-1 10:45
-change memory (PCM). We first review the basics of phase-change synaptic devices: device operation, phase-change materials, conduction mechanism, power consumption, and scaling. We then review the use of PCM synaptic device implementations spanning from single device operation to various array arch作者: entail 時(shí)間: 2025-4-1 15:47 作者: Filibuster 時(shí)間: 2025-4-1 20:27
2297-0215 Leray, J.-L. Lions, L. Schwartz, L. Nirenberg, and many others..The book also provides a detailed description of the main research directions of Ma978-3-031-33683-6978-3-031-33681-2Series ISSN 2297-0215 Series E-ISSN 2297-024X 作者: 體貼 時(shí)間: 2025-4-2 00:48
Java 2D APImorylmageSource enthalten, und das Anschauen von Dateien im GIF- oder JPEG-Format sowie das Abspielen von Sound im.AU-Format waren schon eingebaut. Dieses wurde in JDK 1.1.X weiterverfolgt und im JDK 1.2 um die Java-2D-API erweitert, auf die ich hier eingehen will. Au?erdem ist eine 3D-API von JavaS作者: Nebulizer 時(shí)間: 2025-4-2 04:01 作者: 不能逃避 時(shí)間: 2025-4-2 10:58
udies, counting rare cells can provide valuable information on the status of the patient; examples are the search for circulating tumor cells in peripheral blood, tumor stem cells, endothelial cells, hematopoietic progenitor cells and their subpopulations, antigen-specific T-cells, invariant natural
