A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Modular termination of basic narrowing and equational unification
2010
Logic Journal of the IGPL
Preserved Fulltext
via the modularity of basic narrowing (completeness and) termination. ...
As a particularly interesting application, we consider solving equations modulo a theory that is given by a TRS, and then distill a number of modularity results for the decidability of equational unification ...
Acknowledgements We gratefully acknowledge the anonymous referees for providing many insights and extremely useful suggestions. ...
doi:10.1093/jigpal/jzq009
fatcat:zc5mu47hjzfrxorpojxffiup7e
Page 1592 of Mathematical Reviews Vol. , Issue 92c
[page]
1992
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In other words, completeness is not a modular property of term rewriting systems. Toyama, Klop and Barendregt showed that completeness is a modular property of left-linear TRSs. ...
In this paper we show that it is sufficient to impose the constructor discipline for obtaining the modularity of completeness. ...
Unravelings and ultra-properties
[chapter]
1996
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show how to rediscover properties like decreasingness, and to give easy proofs of some existing results on CTRSs. ...
The second condition says that if we are unraveling a CTRS, we can extract from it the part that is already a TRS, and then go on computing the unraveling. ...
The intuition says that, just like in terminating nite TRSs every \reasonable question" like the ones seen above is decidable, in an e ectively terminating nite CTRSs they should be decidable as well. ...
doi:10.1007/3-540-61735-3_7
fatcat:rgmk4g7zsjcbvluxrz2smul5py
Model Checking a Modular-Structured Nonblocking Atomic Commitment Protocol for Asynchronous Distributed Systems
2009
2009 Software Technologies for Future Dependable Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We next construct temporal logic formulae expressing the termination, justification, and obligation properties of the NBAC protocol assuming that the properties that the consensus module and the unreliable ...
Various principal fault-tolerant agreement protocols for asynchronous distributed systems, such as atomic commitment and view synchrony, can be constructed in a modular way which is based on consensus ...
Acknowledgment This work was supported by Grant-in-Aid from the Ministry of Education, Culture, Sports, Science and Technology of Japan (No. 18049055). ...
doi:10.1109/stfssd.2009.34
fatcat:spn3zszarjdz7nximb2w2rta4a
Problems in rewriting III
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Acknowledgements We thank all the individuals who contributed questions, updates and solutions. Many thanks to Stefan Blom for substantial help producing this list. ...
When F only contains an AC symbol and constants, the theory reduces to Presburger's arithmetic and is hence decidable. On the other hand the 5~1 fragment of T is always decidable [26] . ...
Huet's proof [47] of the "completeness" of completion is predicated on the assumption that the ordering supplied to completion does not change during the process. ...
doi:10.1007/3-540-59200-8_82
fatcat:in5aspimbrbvngnrhzcm7tfwei
Decidability of reachability for disjoint union of term rewriting systems
1994
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
On the one hand, we study the disjoint union of term rewriting systems the reachability problem of which is decidable and give sufficient conditions for obtaining the modularity of decidability of this ...
The reachability problem for term rewriting systems is the problem of deciding for a system S and two terms t and t', whether t can be reduced to t' with rules of S. ...
Acknowledgment The authors would like to thank Aart Middeldorp, Hubert Comon and the referees for their pertinent remarks. ...
doi:10.1016/0304-3975(94)90267-4
fatcat:cw2inlenwjh35iohaxirmvpx2u
Page 2565 of Mathematical Reviews Vol. , Issue 98D
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Yves Metivier (F-BORD; Talence)
98d:68120 68Q42 03D05
Salomaa, Kai (FIN-TURK; Turku)
On the modularity of decidability of completeness and termination. (English summary)
J. Autom. Lang. ...
The author shows that (i) decidability of termination is not a modular property for finite left-linear monadic TRSs, (ii) decid- ability of confluence and decidability of completeness of (left- or right ...
Page 6951 of Mathematical Reviews Vol. , Issue 95k
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Symbolic Comput. 12 (1991), no. 2, 161-195; MR 92i:68077] for deciding strong sequentiality.”
95k:68094 68Q42
Gramlich, Bernhard (D-KSRL-I; Kaiserslautern)
On modularity of termination and confluence properties ...
and completeness of conditional rewrite systems.” ...
An on-line problem database
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
For the current proceedings, the main subjects were Term rewriting systems Symbolic and algebraic computation Uni cation and matching Completion techniques String and graph rewriting Conditional and typed ...
The RTA list seeks to summarize open problems and subsequent solutions in elds of interest to this conference. ...
Acknowledgements We couldn't have produced this report without the advice we received from many people: Franz ...
doi:10.1007/bfb0052380
fatcat:x57lyotlxrh5bdan42az6tileq
Comparative analysis of the expressiveness of shared dataspace coordination1 1Work partially supported by Italian Ministry of University - MURST 40% - Progetto TOSCA
2002
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The investigation is carried out by exploiting and integrating three different comparison techniques: weak and strong modular embedding and property-preserving encodings. ...
We study the expressiveness of the most prominent representatives of the family of shared dataspace coordination languages, namely Linda, Gamma and Concurrent Constraint Programming. ...
As the existence of a terminating firing sequence is decidable for P/T nets, we can conclude that termination is decidable for Gamma. ...
doi:10.1016/s1571-0661(04)00322-6
fatcat:rf5a7vgvdzgqjgqjxoevllp2pe
Page 38 of Journal of Systems Management Vol. 33, Issue 9
[page]
1982
Journal of Systems Management
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Add noun strings and terminology to the qual- ifier: On account of the status of the computer pro- gram assessment planning development effort, it was decided to terminate project processes.
7. ...
Add a qualifier of uncertain relation to the origi- nal statement: On account of the status of the com- puter, it was decided to terminate project processes.
6. ...
Manufacturing Development of the NCSX Modular Coil Windings
2005
21st IEEE/NPS Symposium on Fusion Engineering SOFE 05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The TRC included a complex shaped winding form, conductor, insulation scheme, leads and termination, cooling system and coil clamps typical of the modular coil design. ...
The modular coils on the National Compact Stellarator Experiment (NCSX) present a number of significant engineering challenges due to their complex shapes, requirements for high dimensional accuracy and ...
VPI Mold Due to complex geometry of the modular coils it was decided to utilize a "Bag" mold instead of procuring a rigid machined mold. ...
doi:10.1109/fusion.2005.252890
fatcat:reuimeqq7re6jcb3bhjuiufjrq
A Distributed Algorithm for Overlapped Community Detection in Large-Scale Networks
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show that DOCD algorithm is capable of keeping the asymptotically same results with the existing classical centralized algorithms in terms of community modularity and the number of identified communities ...
Most of the existing solutions are either centralized or parallel algorithms, which are computationally intensive - require complete knowledge of the entire networks. ...
ACKNOWLEDGMENT Dibakar Saha would like to acknowledge the Science and Engineering Research Board (SERB), Government of India, for financial support under the NPDF scheme (File Number: PDF/2018/000633). ...
arXiv:2011.05954v1
fatcat:lmdu5g4xtrfddjqdnqu3vknm34
In Silico Analysis: A New Demand for Molecular Genetic Interpretation
2017
Gene Cell and Tissue
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Without complete assessment of protein alternation, it is not possible to decide about the effect of alternation in the protein structure. ...
On the other hand, De novo and allelic, functional, segregation and population data analyses are required for certain decisions about the final effect of a variation (2). ...
Without complete assessment of protein alternation, it is not possible to decide about the effect of alternation in the protein structure. ...
doi:10.17795/gct-45041
fatcat:gp6blmwvhbgmje3fqfae7b5mye
Page 7659 of Mathematical Reviews Vol. , Issue 95m
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
{For the entire collection see MR 94m:68002. }
95m:68096 68Q42
Ohlebusch, Enno (D-BLFT; Bielefeld)
On the modularity of termination of term rewriting systems. (English summary)
Theoret. Comput. ...
When- ever the disjoint union of two terminating term rewriting systems is nonterminating, then one of the systems is not ¢-terminating (i.e., it loses its termination property when extended with the rules ...
« Previous
Showing results 1 — 15 out of 39,335 results