Multiply sectioned Bayesian networks (MSBNs) provide a framework for probabilistic reasoning in a complex single user oriented system as well as in a cooperative multi-agent distributed interpretation system. During the construction or dynamic formation of a MSBN, automatic verification of the acyclicity of the overall structure is desired. Well known algorithms for acyclicity test assume a cen...

Multiply sectioned Bayesian networks (MSBNs) provide a framework for probabilistic reasoning in a single user oriented system in a large problem domain or in a cooperative multi-agent distributed interpretation system. During the construction or dynamic formation of a MSBN, an automatic verification of the acyclicity of the overall structure is desired. Although algorithms for testing acyclicit...

Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm. In this paper, we define a novel acyclicity notion which provides a sufficient condition for termination of the restricted chase over Horn-SRIQ TBoxes. We show that this notion generalizes most of the ex...

Sen [6] proved that by confining voters to value restricted (acyclic) domains voting paradoxes (intransitive relations) can be avoided in aggregation by majority. We generalize this result to any neutral monotone aggregation. In addition, we show that acyclicity is neither necessary nor sufficient for transitivity for neutral non-monotone aggregation: we construct a cyclic transitive domain and...

Numerous fundamental database and reasoning problems are known to be NP-hard in general but tractable on instances where the underlying hypergraph structure is β-acyclic. Despite importance of many these problems, there has been little success generalizing results beyond acyclicity. In this paper, we take challenge propose nest-set width, a novel generalization β-acyclicity. We demonstrate that...