Fundamenta Informaticae - Volume 40, issue 4

Authors: del Cerro, Luis Fariñas | Gasquet, Olivier

Article Type: Research Article

Abstract: In this paper we present a decision procedures for modal logics with transitive models together with additionnal properties like confluence and density. These procedures are tableaux-based, and we show how to handle them in this well-known framework by generalizing usual tableaux (which are trees) to richer structures: directed acyclic graphs.

Keywords: Automated deduction, tableaux, modal logic, confluence, density, decidability

DOI: 10.3233/FI-1999-40401

Citation: Fundamenta Informaticae, vol. 40, no. 4, pp. 317-333, 1999

Authors: den Hartog, J.I. | de Vink, E.P. | de Bakker, J.W.

Article Type: Research Article

Abstract: For a process language with action refinement and synchronization both an operational and a denotational semantics are given. The operational semantics is based on an SOS-style transition system specification involving syntactical refinement sequences. The denotational semantics is an interleaving model which uses semantical refinement ‘environments'. It identifies those statements which are equal under all refinements. The denotational model is shown to be fully abstract with respect to the operational one. The underlying metric machinery is exploited to obtain this full abstractness result. Usually, action refinement is treated either in a model with some form of true concurrency, or, when an …interleaving model is applied, by assuming that the refining statements are atomized. We argue that an interleaving model without such atomization is attractive as well. Show more

Keywords: operational semantics, denotational semantics, metric topology, action refinement, full abstractness, semantical refinement

DOI: 10.3233/FI-1999-40402

Citation: Fundamenta Informaticae, vol. 40, no. 4, pp. 335-382, 1999

Authors: Nguyen, Hung Son | Nguyen, Sinh Hoa

Article Type: Research Article

Abstract: ASSOCIATION RULE (see [1]) extraction methods have been developed as the main methods for mining of real life data, in particular in Basket Data Analysis. In this paper we present a novel approach to generation of association rules, based on Rough Set and Boolean reasoning methods. Some results presented in this paper has been mentioned in [13, 17]. We will explain them precisely (with full proofs of theorems) in this paper. We show the relationship between the problems of association rule extraction for transaction data and relative reducts (or α-reducts generation) for a decision table. Moreover, the present approach can …be used to extract association rules in general form. The experimental results show that the presented methods are quite efficient. Large number of association rules with given support and confidence can be extracted in a short time. Show more

DOI: 10.3233/FI-1999-40403

Citation: Fundamenta Informaticae, vol. 40, no. 4, pp. 383-405, 1999

Authors: Ordman, E.T. | Eberbach, E. | Anwar, A.

Article Type: Research Article

Abstract: The paper deals with a generic solution of the Mutual Exclusion Problem using semaphores only. We use in the solution weakly fair binary semaphores and (not necessarily fair) semaphores with initial value k. All semaphores are simple in that the P and V operations on them are paired in the natural way avoiding split semaphores. No auxiliary shared variables are used. We define a general form of the mutual exclusion problem. We claim: (1) All mutual exclusion problems can be solved using only simple semaphores. (2) All mutual exclusion problems can be solved fairly (with bounded waiting) using simple semaphores …(weakly fair binary and initially–k; semaphores). We give some bounds on how many semaphores are needed for standard problems. The solutions given may be inefficient: a mutual exclusion problem which can be solved in linear time and space with shared variables may require exponentially many semaphores. Show more

Keywords: mutual exclusion, semaphore, weakly fair semaphore, bounded waiting

DOI: 10.3233/FI-1999-40404

Citation: Fundamenta Informaticae, vol. 40, no. 4, pp. 407-422, 1999