We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equational term rewriting systems and considering E-critical pairs and/or termination modulo E. In contrast, our method is based solely on usual critica...

The confluence of untyped λ-calculus with unconditional rewriting is now well understood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether betareduction is allo...

We consider the application of Constraint Handling Rules (CHR) for the specification of type inference systems, such as that used by Haskell. Confluence of CHR guarantees that the answer provided by type inference is correct and consistent. The standard method for establishing confluence relies on an assumption that the CHR program is terminating. However, many examples in practice give rise to...

multicast routing is one of the most important services in multi radio multi channel (mrmc) wireless mesh networks (wmn). multicast routing performance in wmns could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. in this paper we want to address the multicast routing problem for a given channel assignment in wmns. the channels...

many appealing multicast services such as on-demand tv, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. when multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. designing a good multicast tree to route data packets could enhance the...

We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie algebra of rank at most 2, gives rise to a confluent system of reduction rules of graphs (via Kuperberg’s spiders) in an arbitrary surface. As a further conse...

The morphological changes in the river channel over periods that occur due to flood events, affected sinuosity index of channel. characteristic like also determines intensity a Recent losses have increased as result variability rainfall; simultaneously such problems are coming up with sustainable development. attempted research study has been carried out evaluate and understand bank stability M...

This work focuses on the physical-chemical characterization of a mining effluent affected by acid mine drainage (AMD) from its source to confluence in Odiel river, one most polluted rivers AMD worldwide, order understand reactions involved modifications chemical characteristics water and precipitates resulting water–rock–atmosphere interaction an environment highly activity without corrective m...

CeTA was originally developed as a tool for certifying termination proofs [5] which have to be provided as certificates in the CPF-format. Its soundness is proven within IsaFoR, the Isabelle Formalization of Rewriting. In the meantime, CeTA can also be used as a tool for certifying confluence and non-confluence proofs. In the following system description, we give a short overview on what kind o...

We present a polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision procedure to get a polynomial time algorithm, assuming that the maximum arity of a symbol in the signature is a constant, for deciding confluence of rewrite systems where each rule contains a shallow linear term on one side and a ground term on the other. The existence of a ...