Henryk Rybinski

Prof. Henryk Rybinski

orcid

Research Focus & Metrics

Academic Career Length

46Years (1981-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2016 in Expert Systems with Applications
Verified
Journal Article
Closed access
MPMariusz Podsiadlo
Mariusz Podsiadlo
HRHenryk Rybinski
Henryk Rybinski

21 January 2009 in Journal of Intelligent Information Systems
Verified
Journal Article
Closed access
PDF file
RBRobert Bembenik
Robert Bembenik
HRHenryk Rybinski
Henryk Rybinski

1 September 1987 in ACM Transactions on Database Systems
Verified
Journal Article
Open access
HRHenryk Rybinski
Henryk Rybinski
The use of first-order logic as database logic is shown to be powerful enough for formalizing and implementing not only relational but also hierarchical and network-type databases. It enables one to treat all the types of databases in a uniform manner. This paper focuses on the database language for heterogeneous databases. The language is shown to be general enough to specify constraints for a particular type of database, so that a specification of database type can be “translated” to the specification given in the database language, creating a “logical environment” for different views that can be defined by users. Owing to the fact that any database schema is seen as a first-order theory expressed by a finite set of sentences, the problems concerned with completeness and compactness of the database logic discussed by Jacobs ("On Database Logic,” J. ACM 29 ,2 (Apr. 1982), 310-332) are avoided.

18 December 2018 in Journal of Intelligent Information Systems
Verified
Journal Article
Open access
PDF file
MKMarek Kozlowski
Marek Kozlowski
HRHenryk Rybinski
Henryk Rybinski
The paper is devoted to the issue of clustering small sets of very short texts. Such texts are often incomplete and highly inconclusive, so establishing a notion of proximity between them is a challenging task. In order to cope with polysemy we adapt the SenseSearcher algorithm (SnS), by Kozlowski and Rybinski in Computational Intelligence 33(3): 335–367, 2017b . In addition, we test the possibilities of improving the quality of clustering ultra-short texts by means of enriching them semantically. We present two approaches, one based on neural-based distributional models, and the other based on external knowledge resources. The approaches are tested on SnSRC and other knowledge-poor algorithms.

1 January 1996 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
MKMarzena Kryszkiewicz
Marzena Kryszkiewicz
HRHenryk Rybinski
Henryk Rybinski
A set-theoretical approach to finding reducts of composed information systems is presented. It is shown how the search space can be represented in form of a pair of boundaries. It is also shown, how reducts of composing information systems can be use

1 January 1994
Verified
Book Chapter
Closed access
PDF file
MKMarzena Kryszkiewicz
Marzena Kryszkiewicz
HRHenryk Rybinski
Henryk Rybinski