The module theorem by Janhunen et al. demonstrates how to provide a modular structure in answer set programming, where each module has a well-defined input/output interface which can be used to establish the compositionality of answer sets. The theorem is useful in the analysis of answer set programs, and is a basis of incremental grounding and reactive answer set programming. We extend the mod...

We study certain ltrations of indecomposable injective modules over classical Lie superalgebras, applying a general approach for noetherian rings developed by Brown, Jategaonkar, Lenagan, and Warreld. To indicate the consequences of our analysis, suppose that g is a complex classical simple Lie superalgebra and that E is an indecomposable injective g-module with nonzero (and so necessarily simp...

A number of new distributed file systems have been developed, but the development of such file systems is not a simple task because it requires the operating system kernel to be modified. We have therefore developed the CAPELA operating system, which makes distributed file systems easy to develop. CAPELA allows the users to develop a file system as an extension module separated from the kernel,...

We propose method shells, which is a module system for avoiding conflicts on customization by language mechanisms such as aspects in AspectJ and open classes in Ruby. These mechanisms allow programmers to customize a library without rewriting original source code but by only describing differences in a separate file. We call these mechanisms destructive class extensions. A problem with destruct...

The module of derivations D(1)(A) of a hyperplane arrangement A ∈ C (henceforth called an n-arrangement) is an interesting and much studied object [10, 9, 8]. In particular, the question whether this module is free, for various classes of arrangements, has received great attention. On the other hand, the module of higher differential operators D(m)(A) received their first incisive treatment in ...

With the development of time management service of Run-Time Infrastructure (RTI), it is necessary to consider an efficient design approach and an algorithm of Greatest Available Logical Time (GALT) computation. However, many time management services of existing RTIs have difficult in modification and extension. Although some RTIs avoid this difficulty through modular design, they comply with no...

Most learning systems applied to problem solving have the goal of learning knowledge for solving problems more eeciently. However, very few systems have focused on the acquisition of planning operator descriptions. In this paper, we present a system that learns operator deenitions from the interaction with a completely unknown environment. In order to achieve better learning convergence, severa...

In this contribution a new method for artificial bandwidth extension of telephone speech towards frequencies below 300 Hz is proposed. The method defines a self-contained module which can be applied to any artificial bandwidth extension system, designed for extending the bandwidth only to frequencies above the telephone-band. At this, the amplification of a separate ARMA filter with a pass-band...

Most learning systems applied to problem solving have the goal of learning knowledge for solving problems more eeciently. However, very few systems have focused on the acquisition of planning operator descriptions. In this paper, we present a system that learns operator deenitions from the interaction with a completely unknown environment. In order to achieve better learning convergence, severa...

In our previous paper we describe the Galois module structures of pth-power class groups K/K, where K/F is a cyclic extension of degree p over a field F containing a primitive pth root of unity. Our description relies upon arithmetic invariants associated with K/F . Here we construct field extensions K/F with prescribed arithmetic invariants, thus completing our classification of Galois modules...