Dynamic composition of parameterised logic modules

We present a logic-based programming language that features meta-level composition operations over programs. Object programs are parameterised named collections of definite clauses which may contain formulae of the form A in Pexp, where A is a standard atomic formula and Pexp is a program expression obtained by applying composition operations over named object programs. The semantics of the language is presented in two different equivalent styles. An operational, top-down semantics is given by means of inference rules, while a denotational, bottom-up semantics is given via an immediate consequence operator associated with program expressions. A meta-programming implementation of the language is also presented by transforming the operational inference rules into meta-level axioms. Several programming examples are discussed to illustrate the expressive power of the language.     

Multifunctional use of elements in computer devices

Cybernetics and Systems Analysis -     

Tunable multifunction logic modules based on parametric representation of functions of k-valued logic over quasifields

We propose a new class of tunable logic modules that realize functions of k-valued logic. These modules are characterized by homogeneous structure and linear dependence of the number of tunable inputs on the number of input variables.Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 24–29, July–August, 1991.     

Accelerated simulation of failure probability of a system consisting of elements with considerably differing reliability

The failure probability of a system in a given time interval is investigated. Failure and repair distribution functions are assumed to be of a general form. A new accelerated simulation method is proposed that makes it possible to construct estimates with bounded relative root-mean-square errors for systems consisting of components with frequency-different reliability. A numerical example is given. Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 48–58, November–December, 1999.     

Assembly of hybrid integrated micro-optical modules using passive alignment with LIGA mounting elements and adhesive bonding techniques

 Assembling hybrid integrated micro-optical modules for mono-mode applications requires alignment tolerances better than ±1 μm which, so far, were achieved by complex active alignment of the micro-optical components. This article describes a passive assembly concept employing high-precision LIGA structures to simplify assembly and reduce manufacturing costs. The advantages of this passive assembly concept are demonstrated in the micro-optical assembly of a heterodyne receiver. The micro-optical components (ball microlenses, prisms, glass fibers, photodiodes) were aligned passively by means of alignment structures made of PMMA, and were subsequently fixed by UV-curing adhesive. Photodiodes were additionally contacted with electrically conducting adhesive cured at 70 °C. The mono-mode glass fibers were mounted in fiber mounts into the fiber grooves of which the glass fibers were inserted and immobilized with UV-curing adhesive. Measurements of the optical quality of the heterodyne receiver indicated an accuracy of assembly better than 1 μm. Received: 3 January 2000/Accepted: 9 February 2000     

Synthesis of multifunction and universal logic elements over residue class rings. I

Translated from Kibernetika, No. 4, pp. 89–94, July–August, 1988.     

Reliable interactive programming with modules

Interactive programming is a convenient programming style that supports fast prototyping and debugging but often results in a loss of modularity and security. This article addresses the problem of supporting reliable and modular interactive programming. A module system designed for interactive use is introduced. This module system supports separate compilation and automatic updating of module interfaces during program development. It also allows the programmer to obtain a fresh program state for reliable testing, eliminating the need to reload an entire program.A preliminary version of this article was presented at the 1992 ACM Conference on Lisp and Functional Programming.     

Fuzzy logic with biomolecules

 The uncertain and inexact nature of the chemical reactions used to implement DNA computations can be turned into an advantage for implementing robust soft computing systems. The key feature of DNA hybridization that makes it appropriate for fuzzy computing is the uncertainty and incompleteness in the formation of a double-stranded duplex from single-stranded oligonucleotides. To implement fuzzy computing, a set of encoding DNA molecules is given that reproduces a specific membership function in the energetics of the DNA duplex. In addition, a fuzzy inference system implemented with DNA hybridization on solid supports is discussed. The ultimate success of this idea as a general technique, however, is dependent on the actual geometry of the Gibbs free-energy landscapes in the space of all duplex formations. Elucidating this problem is undoubtedly of great importance for biomolecular implementation of soft-computing because it may, in particular, shed light on the true import of fuzzy models in biological processes fundamental to life.     

Propositional dynamic logic of context-free programs and fixpoint logic with chop

This paper compares propositional dynamic logic of non-regular programs and fixpoint logic with chop. It identifies a fragment of the latter which is equi-expressive to the former. This relationship transfers several decidability and complexity results between the two logics.     

Equivalent logic programs and symmetric homogeneous forms of logic programs with equality

This article introduces the notion of CAS-equivalent logic programs: logic programs with identical correct answer substitutions. It is shown that the notions CAS-equivalence, refutational equivalence, and logical equivalence do not coincide in the case of definite clause logic programs. Least model criteria for refutational and CAS-equivalence are suggested and their correctness is proved. The least model approach is illustrated by two proofs of CAS-equivalence. It is shown that the symmetric extension of a logic program subsumes the symmetry axiom and the symmetric homogeneous form of a logic program with equality subsumes the symmetry, transitivity, and predicate substitutivity axioms of equality. These results contribute towards the goal of building equality into standard Prolog without introducing additional inference rules.     

Multifunctional terminal device with adaptive grasping force

This paper describes the servosystem for adaptive control of the grasping force in the operation of industrial manipulators. Problems involved in the design of adaptive servosystems using anthropomorphic multifunctional terminal devices are pointed out. The essential part of the adaptive servosystem is the new slippage transducer which meets all the requirements needed in the operation of industrial manipulators.     

ispPAC多功能精密调节器的设计与实现

继可编程逻辑器件之后,在系统可编程模拟器件(ispPAC)为模拟电路的设计开发开辟了一条崭新的思路。论文利用ispPAC10设计和实现了一种多功能精密调节器,为其应用和研究提供了一个方便且经济的硬件平台。通过在线仿真和下载实验验证,该设计精确,且变化灵活,具有较好的可重构性。     

Specifying coalgebras with modal logic

We propose to use modal logic as a logic for coalgebras and discuss it in view of the work done on coalgebras as a semantics of object-oriented programming. Two approaches are taken: First, standard concepts of modal logic are applied to coalgebras. For a certain kind of functor it is shown that the logic exactly captures the notion of bisimulation and a complete calculus is given. Examples of verifications of object properties are given. Second, we discuss the relationship of this approach with the coalgebraic logic of Moss (Coalgebraic logic, Ann Pure Appl. Logic 96 (1999) 277–317.).     

Proving linearizability with temporal logic

Linearizability is a global correctness criterion for concurrent systems. One technique to prove linearizability is applying a composition theorem which reduces the proof of a property of the overall system to sufficient rely-guarantee conditions for single processes. In this paper, we describe how the temporal logic framework implemented in the KIV interactive theorem prover can be used to model concurrent systems and to prove such a composition theorem. Finally, we show how this generic theorem can be instantiated to prove linearizability of two classic lock-free implementations: a Treiber-like stack and a slightly improved version of Michael and Scott’s queue.     

Legal reasoning with subjective logic

Judges and jurors must make decisions in an environment of ignoranceand uncertainty for example by hearing statements of possibly unreliable ordishonest witnesses, assessing possibly doubtful or irrelevantevidence, and enduring attempts by the opponents to manipulate thejudge's and the jurors' perceptions and feelings. Three importantaspects of decision making in this environment are the quantificationof sufficient proof, the weighing of pieces of evidence, and therelevancy of evidence. This paper proposes a mathematical frameworkfor dealing with the two first aspects, namely the quantification ofproof and weighing of evidence. Our approach is based on subjectivelogic, which is an extension of standard logic and probability theory,in which the notion of probability is extended by including degrees ofuncertainty. Subjective Logic is a framework for modelling humanreasoning and we show how it can be applied to legalreasoning.     

在双端口SRAM中实现同步硬件原语

在多处理器并行环境中,必须通过同步机制保证系统的一致性.硬件实现同步原语能大大减小系统开销,提高同步可靠性.本文介绍了如何在双端口SRAM中实现同步硬件原语,可在处理器不支持同步硬件原语的条件下提供可靠的同步机制.