In the logic based framework of knowledge representation and reasoning many operators have been defined in order to capture different kinds of change : revision, update, merging and many others. There are close links between revision, update, and merging. Merging operators can be considered as extensions of revision operators to multiple belief bases. And update operators can be considered as p...

We present a novel proof of Toyama’s famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in that it factors through the decreasing diagrams technique for abstract rewriting systems, is constructive in that it gives a construction for the converging rewrite sequences given a pair of diverging rewrite sequences, and ...

The goal of this study is to characterize the meteorological and oceanographic conditions affecting the Azores Archipelago, and explore their biological implications. The Mid-Atlantic region of the Azores Archipelago is under the permanent influence of the Azores high pressure system, thereby providing sustained Ekman transport that facilitates the convergence in regional oceanography. The west...

Confluence reduction and partial order reduction by means of ample sets are two different techniques for state space reduction in both traditional and probabilistic model checking. This paper provides an extensive comparison between these two methods, and answers the question how they relate in terms of reduction power when preserving branching time properties. We prove that, while both preserv...

The relationship between the level of cell confluence near the plateau phase of growth and blastocyst yield following somatic cell cloning is not well understood. We examined the effect of distinct cell culture confluence levels on in vitro development of cloned bovine embryos. In vitro-matured bovine oocytes were manually bisected and selected by DNA staining. One or two enucleated hemi-cytopl...

For terminating double-pushout (DPO) graph rewriting systems confluence is, in general, undecidable. We show that confluence is decidable for an extension of DPO rewriting to graphs with interfaces. This variant is important due to it being closely related to rewriting of string diagrams. We show that our result extends, under mild conditions, to decidability of confluence for terminating rewri...

We develop diagram techniques for proving confluence in abstract reductions systems. The underlying theory gives a systematic and uniform framework in which a number of known results, widely scattered throughout the literature, can be understood. These results include Newman's lemma, Lemma 3.1 of Winkler and Buchberger, the Hindley Rosen lemma, the Request lemmas of Staples, the Strong Confluen...

τ -confluence is a reduction technique used in enumerative model-checking of labeled transition systems to avoid the state explosion problem. In this paper, we propose a new on-the-fly algorithm to calculate partial τ -confluence, and propose new techniques to do so on large systems in a compositional manner. Using information inherent in the way a large system is composed of smaller systems, w...

This paper describes a new confluence tool for term rewrite systems. Due to its modular design, the few techniques implemented so far can be combined flexibly. Methods developed for termination analysis are adapted to prove and disprove confluence. Preliminary experimental results show the potential of our tool.