Existential rules, i.e. Datalog extended with existential quantifiers in rule heads, are currently studied under a variety of names such as Datalog+/–, ∀∃-rules, and tuple-generating dependencies. The renewed interest in this formalism is fuelled by a wealth of recently discovered language fragments for which query answering is decidable. This paper extends and consolidates two of the main appr...

In programming languages with dynamic use of memory, such as Java, knowing that a reference variable x points to an acyclic data structure is valuable for the analysis of termination and resource usage (e.g., execution time ormemory consumption). For instance, this information guarantees that the depth of the data structure to which x points is greater than the depth of the data structure point...

The article is devoted to some critical problems of using Bayesian networks for solving practical problems, in which graph models contain directed cycles. strict requirement the acyclicity representing network does not allow efficiently solve most that modern theory prohibits use can significantly simplify general networks, development algorithms and their implementation program code calculatio...

Abstract We study homotopy epimorphisms and covers formulated in terms of derived Tate’s acyclicity for commutative $C^*$-algebras algebras continuous functions valued non-Archimedean fields. prove that a epimorphism between precisely corresponds to closed immersion the compact Hausdorff topological spaces associated with them cover $C^*$-algebra space it by immersions admitting finite subcover...

This study determined effects of follicle stimulating hormone (FSH) alone and in combination with tumour necrosis factor (TNF), on granulosa cells from small (5-10 mm diameter) and large (>10-25 mm) follicles during follicular and luteal phases of the cycle and during periods of acyclicity. Granulosa cells were collected from ovaries of premenopausal women undergoing oophorectomy. The cells wer...

α-acyclicity is an important notion in database theory. The α-arboricity of a hypergraphH is the minimum number of α-acyclic hypergraphs that partition the edge set of H. The α-arboricity of the complete 3-uniform hypergraph is determined completely.

In the context of the stable roommates problem, it is shown that acyclicity of preferences is equivalent to the existence of symmetric utility functions, i.e. the utility of agent i when matched with j is the same as j’s utility when matched with i. © 2007 Published by Elsevier Inc. JEL classification: C78

We study what topological assumptions should be added to the acyclicity of individual best response improvements in order to ensure the existence of a (pure strategy) Nash equilibrium as well as the possibility to reach a Nash equilibrium in the limit of a best response improvement path. JEL Classification Number: C 72.