For each Painlevé system, we have a manifold, called the defining manifold, on which the system defines a uniform foliation. In this paper, we describe confluence processes in these manifolds as deformations of manifolds compatible to those in Painlevé systems.

Available online 13 March 2015

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...

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...

this paper aims at studying the effects of work/family conflict and family/ work conflict as a result of work alienation. some theories of goffman, duxbury and higgins, kirchmeyer and cohen, merton, inglehart and faunce are applied in the study. the research is conducted through a survey method. stratified random sampling has been used for selection of the samples. main data collection method f...

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...

It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply...