Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 5

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  three-valued logics
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
This paper focuses on approximate reasoning based on the use of similarity spaces. Similarity spaces and the approximated relations induced by them are a generalization of the rough set-based approximations of Pawlak [17, 18]. Similarity spaces are used to define neighborhoods around individuals and these in turn are used to define approximate sets and relations. In any of the approaches, one would like to embed such relations in an appropriate logic which can be used as a reasoning engine for specific applications with specific constraints. We propose a framework which permits a formal study of the relationship between approximate relations, similarity spaces and three-valued logics. Using ideas from correspondence theory for modal logics and constraints on an accessibility relation, we develop an analogous framework for three-valued logics and constraints on similarity relations. In this manner, we can provide a tool which helps in determining the proper three-valued logical reasoning engine to use for different classes of approximate relations generated via specific types of similarity spaces. Additionally, by choosing a three-valued logic first, the framework determines what constraints would be required on a similarity relation and the approximate relations induced by it. Such information would guide the generation of approximate relations for specific applications.
2
Content available remote Formalization of the Sentential Logic Dual to Łukasiewicz’s Three-valued Logic
EN
Dual logics with respect to Łukasiewicz’s logics were investigated by G. Malinowski, M. Spasowski and R. Wójcicki in [4,5]. Our aim is to discuss the generalized method of natural deduction for the logic which is dual to Łukasiewicz’s three-valued logic.
3
EN
In this paper one of possible optimum conditions distribution processes algorithmes with precised (limited) number of processors is described. This method accepts that realization lines of particular variavles with initial supplementary procedures application are specified earlier. Results are produced as a time-vectors of particular rules realization with determine each variable creation stages. In this algorithm criterions relavant with minimalization following rules expection of time which determine particular variable creation stages and also with conferment highest priorites lines which are characterized by langest realization time is regarded. Moreover in investigations is experimentated a simulation program of proposed algorithm.
4
Content available remote The Principles of Creating the Critical Path of the Formation
EN
Assumptions and the algorithm for creating the critical path the formation of variables have been presented for programming procedures. The algorithm is based on the parallelization map and information related to the actions that are performed when calculating the values of variables in the particular phases of parallelization. Also, information was used in the algorithm for the analysis, which related to the time of the execution of the particular actions, and each time the time of the operation of each node was determined. i.e. the time of the calculation of a variable in the particular phase of its modification. The critical paths created are used for the optimization of distribution in multi-processor systems with a limited number of conversion nodes.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.