On representation and approximation of operations in Boolean algebras

Several universal approximation and universal representation results are known for non-Boolean multivalued logics such as fuzzy logics. In this paper, we show that similar results can be proven for multivalued Boolean logics as well. © 2001 John Wiley & Sons, Inc.     

Interval Methods and Their Applications: Invited Sessions at the World Automation Congress (WAC'2000) Maui,Hawaii, June 10–16, 2000

Reliable Computing -     

On how to merge sorted lists coming from different web search tools

Different web search tools often complement each other. So, if we want to have a good coverage of all relevant web items, a reasonable strategy is to use different search tools and them merge the resulting lists. How to merge them? In this paper, we describe reasonable axioms for the merging procedure and describe all mergings that satisfy these reasonable axioms.     

Measurement Information: Scales and Conversions

A theoretical group apparatus is utilized to demonstrate the closeness of scale theory to measurement conversions. The merits of a projective group of conversions are revealed. A geometric interpretation of the measurement procedure is given.     

Using Gelfond-Przymusinska’s epistemic specifications to justify (some) heuristic methods used in expert systems and intelligent control

 We show that epistemic specifications, proposed by M. Gelfond and H. Przymusinska in [4], lead to a natural justification of several heuristic methods used in expert systems and in intelligent control. This paper is an overview of several results, some of which have already been published before. In contrast to the original publications, that were targeted specifically towards researchers that design and analyze traditional (degree of certainty, MYCIN-type) expert systems and intelligent control systems, we present the corresponding results in such a way that they become understandable (and hopefully, natural) to the logic programming community as well. The relationship between epistemic specifications and heuristic methods not only makes heuristic methods more reliable, it also adds confidence that the formalism of epistemic specifications, as proposed by M. Gelfond and H. Przymusinska, is an appropriate formalization of knowledge: Indeed, the fact that the language of epistemic specifications, that was originally proposed without any numerical degree of certainty in mind, turns out to be quite consistent with (practically successful) number-valued heuristics, is a strong argument in favor of this language. Received: 18 March 1997/Accepted: 13 May 1997     

Applications of interval computations to earthquake-resistant engineering: How to compute derivatives of interval functions fast

One of the main sources of destruction during earthquake is resonance. Therefore, the following idea has been proposed. We design special control linkages between floors that are normally unattached to the building but can be attached if necessary. They are so designed that adding them changes the building's characteristic frequency. We continuously monitor displacements within the structure, and when they exceed specified limits, the linkages are engaged in a way to control structural motion. This idea can also be applied to avoid vibrational destruction of large aerospace structures.     

A new characterization of the set of all intervals,based on the necessity to check consistency easily

The purpose of this paper is to present a new characterization of the set of all intervals. This characterization is based on several natural properies useful in mathematical modeling; the main of these properties is the necessity to easily check consistency of incompletes knowledge. This characterization is obtained both for one-dimensional and for multidimensional cases.