Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: reguły wnioskowania

Sortuj według:

Ogranicz wyniki do:

Integrity rules for multiargument relationships in possibilistic databases

Myszkorowski K.

Journal of Applied Computer Science

2016

Vol. 24, nr 3

21--32

The paper contains an analysis of multiargument relationships in possibilistic databases. A multiargument relationship may be formally presented using the relational notation R(X1, X2,...,Xn), where R is the name of the relationship and attributes Xi denote keys of entity sets which participate in it. The dependencies between all n attributes describe the integrity constraints and must not be infringed. They constitute a restriction for relationships of fewer attributes. In the paper it is considered a possible coexistence of associations between k < n attributes of the n-ary relationship. The analysis is carried out using the theory of fuzzy functional dependencies. The notion of functional dependency has been appropriately extended according to the representation of data.

Modeling communication processes in maritime transport using computing with words

Wójcik A., Hatłas P., Pietrzykowski Z.

Archives of Transport System Telematics

2016

Vol. 9, iss. 4

47--51

The paper deals with communication processes between ship navigators based on standard marine communication phrases. The authors consider information exchange, message perception and interactions, e.g. negotiations. For this purpose navigational information and communication ontologies have been complemented by elements of the protoform theory. The considerations include inference processes, related to additional information acquisition and negotiations. Computing with words is applied to the modelling of communication processes.

The estimation of the cause of the machines damages

Tylicki H., Żółtowski B.

Diagnostyka

2012

nr 1(61)

31-38

In this paper we introduce problem of determining algorithms for state genesis which is the basis for rules creating of machine state estimation in the past.

W artykule przedstawiono problemy związane z określeniem algorytmów genezowania stanu, które są podstawą do wyznaczania reguł wnioskowania dla oszacowania stanu maszyny w przeszłości.