Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "reasoning" wg kryterium: Temat


Wyświetlanie 1-7 z 7
Tytuł:
Imposing Restrictions on Density Functions Utilised in Computing With Words
Autorzy:
Gemeinder, M.
Powiązania:
https://bibliotekanauki.pl/articles/908038.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
computing with words
approximate reasoning
resemblance
Opis:
Applying the generalised extension principle within the area of Computing with Words typically leads to complex maximisation problems. If distributed quantities--such as, e.g., size distributions within human populations--are considered, density functions representing these distributions become involved. Very often the optimising density functions do not resemble those found in nature; for instance, an optimising density function could consist of two single Dirac pulses positioned near the opposite bounds of the interval limiting the possible values of the quantity considered. Therefore, in this article, density functions with certain shapes which enable us to overcome this lack of resemblance are considered. Furthermore, some considerations on solving the resulting maximisation problems are reported.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 3; 383-390
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of deontic logic in role-based access control
Autorzy:
Kołaczek, G.
Powiązania:
https://bibliotekanauki.pl/articles/907988.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
formal logic
access control
RBAC
system security
reasoning automation
Opis:
The paper presents a short overview of the foundations of the Role-Based Access Control Modal Model and its properties. In particular, the translation of these model formulae to the first-order logic formulae in a form of Horn's clauses is analysed. The automation of processes and mechanisms related to access control on the basis of logical automated reasoning and the PROLOG language are described.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 269-275
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic search of exact biclusters in binary data
Autorzy:
Michalak, Marcin
Jaksik, Roman
Ślęzak, Dominik
Powiązania:
https://bibliotekanauki.pl/articles/329789.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
biclustering
Boolean reasoning
prime implicant approximation
biomedical data analysis
Johnson heuristic
Opis:
The biclustering of two-dimensional homogeneous data consists in finding a subset of rows and a subset of columns whose intersection provides a set of cells whose values fulfil a specified condition. Usually it is defined as equality or comparability. One of the presented approaches is based on the model of Boolean reasoning, in which finding biclusters in binary or discrete data comes down to the problem of finding prime implicants of some Boolean function. Due to the high computational complexity of this task, the application of some heuristics should be considered. In the paper, a modification of the well-known Johnson strategy for prime implicant approximation induction is presented, which is necessary for the biclustering problem. The new method is applied to artificial and biomedical datasets.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 1; 161-171
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Neuro-Fuzzy System Based on Logical Interpretation of If-then Rules
Autorzy:
Łęski, J.
Henzel, N.
Powiązania:
https://bibliotekanauki.pl/articles/911145.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system rozmyty
implikacja rozmyta
fuzzy implications
approximate reasoning
neuro-fuzzy systems
soft computing
Opis:
Several important fuzzy implications and their properties are described on the basis of an axiomatic approach to the definition of the fuzzy implications. Then the idea of approximate reasoning using the generalized modus ponens and fuzzy implications is considered. The elimination of the non-informative part of the final fuzzy set before defuzzification plays the key role in this paper. After reviewing well-known fuzzy systems, a new artificial neural network based on logical interpretation of if-then rules (ANBLIR) is introduced. Moreover, this system automatically generates rules from numerical data. Applications of ANBLIR to pattern recognition on numerical examples using benchmark databases are indicated.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 4; 703-722
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Experimental analysis of some computation rules in a simple parallel reasoning system for the ALC description logic
Autorzy:
Meissner, A.
Powiązania:
https://bibliotekanauki.pl/articles/907821.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
wnioskowanie równoległe
logika opisowa
parallel reasoning
lean deduction
ALC description logic
Oz language
Opis:
A computation rule determines the order of selecting premises during an inference process. In this paper we empirically analyse three particular computation rules in a tableau-based, parallel reasoning system for the ALC description logic, which is built in the relational programming model in the Oz language. The system is constructed in the lean deduction style, namely, it has the form of a small program containing only basic mechanisms, which assure soundness and completeness of reasoning. In consequence, the system can act as a convenient test-bed for comparing various inference algorithms and their elements. We take advantage of this property and evaluate the studied methods of selecting premises with regard to their efficiency and speedup, which can be obtained by parallel processing.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 1; 83-95
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary computation based on Bayesian classifiers
Autorzy:
Miquelez, T.
Bengoetxea, E.
Larranaga, P.
Powiązania:
https://bibliotekanauki.pl/articles/907630.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
rozumowanie probabilistyczne
obliczenia ewolucyjne
sieć Bayesa
estymacja algorytmu dystrybucji
hybrid soft computing
probabilistic reasoning
evolutionary computing
classification
optimization
Bayesian networks
estimation of distribution algorithms
Opis:
Evolutionary computation is a discipline that has been emerging for at least 40 or 50 years. All methods within this discipline are characterized by maintaining a set of possible solutions (individuals) to make them successively evolve to fitter solutions generation after generation. Examples of evolutionary computation paradigms are the broadly known Genetic Algorithms (GAs) and Estimation of Distribution Algorithms (EDAs). This paper contributes to the further development of this discipline by introducing a new evolutionary computation method based on the learning and later simulation of a Bayesian classifier in every generation. In the method we propose, at each iteration the selected group of individuals of the population is divided into different classes depending on their respective fitness value. Afterwards, a Bayesian classifier---either naive Bayes, seminaive Bayes, tree augmented naive Bayes or a similar one---is learned to model the corresponding supervised classification problem. The simulation of the latter Bayesian classifier provides individuals that form the next generation. Experimental results are presented to compare the performance of this new method with different types of EDAs and GAs. The problems chosen for this purpose are combinatorial optimization problems which are commonly used in the literature.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 335-349
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A system for deduction-based formal verification of workflow-oriented software models
Autorzy:
Klimek, R.
Powiązania:
https://bibliotekanauki.pl/articles/330429.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
formal verification
deductive reasoning
temporal logic
semantic tableaux
workflow pattern
logical primitive
generating logical specification
business model
BPMN
formalna weryfikacja
wnioskowanie dedukcyjne
logika temporalna
tablica semantyczna
wzorzec przepływu pracy
generowanie specyfikacji logicznej
model biznesowy
Opis:
The work concerns formal verification of workflow-oriented software models using the deductive approach. The formal correctness of a model’s behaviour is considered. Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. A system, along with its architecture, for deduction-based verification of workflow-oriented models is proposed. The process inference is based on the semantic tableaux method, which has some advantages when compared with traditional deduction strategies. The algorithm for automatic generation of logical specifications is proposed. The generation procedure is based on predefined workflow patterns for BPMN, which is a standard and dominant notation for the modeling of business processes. The main idea behind the approach is to consider patterns, defined in terms of temporal logic, as a kind of (logical) primitives which enable the transformation of models to temporal logic formulas constituting a logical specification. Automation of the generation process is crucial for bridging the gap between the intuitiveness of deductive reasoning and the difficulty of its practical application when logical specifications are built manually. This approach has gone some way towards supporting, hopefully enhancing, our understanding of deduction-based formal verification of workflow-oriented models.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 941-956
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-7 z 7

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies