To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reasoning can be performed separately on each partition and the results trivially combined can achieve complete answers. Our method applies to SHIQ(D) knowledge bases. It first converts a DL knowledge base KB to a plain datalog progr...

Recently, different forgetting approaches for knowledge bases expressed in different logics were proposed. For EL terminologies containing each atomic concept at most once on the left-hand side, an approach has been proposed based on sufficient, but not necessary acyclicity conditions. In this paper, we propose an approach for computing a uniform interpolant for general EL terminologies. We fir...

We construct random iterative processes for weakly contractive and asymptotically nonexpansive random operators and study necessary conditions for the convergence of these processes. It is shown that they converge to the random fixed points of these operators in the setting of Banach spaces. We also proved that an implicit random iterative process converges to the common random fixed point of a...

It is impractical and uneconomic to design a structure that remains elastic throughout severe ground motions. The main design philosophy is that minor structural damages are acceptable as long as the structure does not collapse. Hence, seismic base isolation of structures provides a better alternative in constructing seismic resistant structures. A fixed-base structure designed in accordance to...

We consider a wireless system with multiple userbase pairs randomly distributed in some region, in which users try to greedily optimize their performance without any exchange of information between bases, and for which a fixed point is reached. This is a Nash equilibrium point for the system and corresponds to a simultaneous water filling solution. In this paper we focus on systems with strong ...

We show that for a fixed integer base g ≥ 2 the palindromes to base g which are k-powers form a very thin set in the set of all base g palindromes.

Recent years have witnessed tremendous developments regarding wireless network access. In this paper emphasis is given to methods for the design of in-door Coded Division Multiple Access (CDMA) based wireless networks and Fixed Wireless (e.g. Wireless Local Loop WLL) networks, which are referred to as wireless access networks. In these networks, two main types of network components are consider...