We prove the following result: Theorem. Every algebraic distributive lattice D with at most א1 compact elements is isomorphic to the ideal lattice of a von Neumann regular ring R. (By earlier results of the author, the א1 bound is optimal.) Therefore, D is also isomorphic to the congruence lattice of a sectionally complemented modular lattice L, namely, the principal right ideal lattice of R. F...

Authors who report ground reaction force (GRF), free moment (FM), and resultant joint moments usually normalize these variables by division normalization. Normalization parameters include body weight (BW), body weight x height (BWH), and body weight x leg length (BWL). The purpose of this study was to explore the appropriateness of division normalization, power curve normalization, and offset n...

in this paper, we define the notions of ultra and involution ideals in $bck$-algebras. then we get the relation among them and other ideals as (positive) implicative, associative, commutative and prime ideals. specially, we show that in a bounded implicative $bck$-algebra, any involution ideal is a positive implicative ideal and in a bounded positive implicative lower $bck$-semilattice, the not...

in this paper we investigate some hereditary properties of amenability modulo an ideal of banach algebras. we show that if (e) is a bounded approximate identity modulo i of a banach algebra a and x is a neo-unital modulo i, then (e) is a bounded approximate identity for x. moreover we show that amenability modulo an ideal of a banach algebra a can be only considered by the neo-unital modulo...

The examples in literature of applying TRIZ to software are that of applying the Inventive Principles (see [6] chapter 8 and 10). They are used to solve an algorithmic problem by defining the ideal situation, analyzing the contradictions and using the principles to develop a better algorithm. (An intelligent algorithm is something like the equivalent of a smart construction in Mechanical Engine...

In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in the situation calculus. The idea is to replace an initial database by a new set of sentences which reflect the changes due to an action. Unfortunately, progression requires secondorder logic in general. In this paper, we introduce the notion of strong progression, a slight variant of Lin and Reit...

A fundamental task in reasoning about action and change is projection, which refers to determining what holds after a number of actions have occurred. A powerful method for solving the projection problem is regression, which reduces reasoning about the future to reasoning about the initial state. In particular, regression has played an important role in the situation calculus and its epistemic ...

We define a notion of bounded action theory in the situation calculus, where the theory entails that in all situations, the number of ground fluent atoms is bounded by a constant. Such theories can still have an infinite domain and an infinite set of states. We argue that such theories are fairly common in applications, either because facts do not persist indefinitely or because one eventually ...

We propose a translation into Modal Logic of the ideas that formalise belief change in the Situation Calculus. This translation is extended to the case of revision. In the conclusion is presented a set of open issues.

A Situated Conversational Assistant (SCA) is a system with sensing, acting and speech synthesis/recognition abilities, which engages in physically situated natural language conversation with human partners and assists them in carrying out tasks. This thesis addresses some prerequisites towards an ideal truly cooperative SCA through the development of a computational model of embodied, situated ...