Jouni Järvinen

Umberto Rivieccio

J. Appl. Non Class. Logics, July, 2024

Relational correspondences for L-fuzzy rough approximations defined on De Morgan Heyting algebras.

[BibT_eX]

[DOI]

Soft Comput., January, 2024

2023

Pseudo-Kleene algebras determined by rough sets.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., October, 2023

2021

Defining rough sets as core-support pairs of three-valued functions.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2021

2020

The Structure of Multigranular Rough Sets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

2019

Defining rough sets using tolerances compatible with an equivalence.

[BibT_eX]

[DOI]

László Kovács

Inf. Sci., 2019

Rough Sets Defined by Multiple Relations.

[BibT_eX]

[DOI]

László Kovács

Proceedings of the Rough Sets - International Joint Conference, 2019

2016

Representing regular Kleene algebras by tolerance-based rough sets.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Tolerances Induced by Irredundant Coverings.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

2014

Rough sets determined by tolerances.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2014

Representing expansions of bounded distributive lattices with Galois connections in terms of rough sets.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2014

Characterizing intermediate tense logics in terms of Galois connections.

[BibT_eX]

[DOI]

Log. J. IGPL, 2014

Monteiro Spaces and Rough Sets Determined by Quasiorder Relations: Models for Nelson algebras.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

2013

Information Completeness in Nelson Algebras of Rough Sets Induced by Quasiorders.

[BibT_eX]

[DOI]

Piero Pagliani

Stud Logica, 2013

Intuitionistic modal logic with a galois connection has the finite model property<sup>1</sup>.

[BibT_eX]

[DOI]

Log. J. IGPL, 2013

2010

Intuitionistic propositional logic with Galois connections.

[BibT_eX]

[DOI]

Log. J. IGPL, 2010

2009

Rough Sets Determined by Quasiorders.

[BibT_eX]

[DOI]

Laura Veres

Order, 2009

An efficient algorithm for learning to rank from preference graphs.

[BibT_eX]

[DOI]

Mach. Learn., 2009

Matrix representations, linear transformations, and kernels for disambiguation in natural language.

[BibT_eX]

[DOI]

Mach. Learn., 2009

2008

Logics from Galois connections.

[BibT_eX]

[DOI]

Jari Kortelainen

Int. J. Approx. Reason., 2008

2007

Determining the Proper Number and Price of Software Licenses.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 2007

Lattice Theory for Rough Sets.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2007

Modal-Like Operators in Boolean Lattices, Galois Connections and Fixed Points.

[BibT_eX]

[DOI]

Jari Kortelainen

Fundam. Informaticae, 2007

Pawlak's Information Systems in Terms of Galois Connections and Functional Dependencies.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

A unifying study between modal-like operators, topologies and fuzzy sets.

[BibT_eX]

[DOI]

Jari Kortelainen

Fuzzy Sets Syst., 2007

BioInfer: a corpus for information extraction in the biomedical domain.

[BibT_eX]

[DOI]

BMC Bioinform., 2007

Set Operations for <i>L</i> -Fuzzy Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

2006

Incomplete Information: Structure, Inference, Complexity.

[BibT_eX]

[DOI]

Stud Logica, 2006

Evaluation of two dependency parsers on biomedical corpus targeted at protein-protein interactions.

[BibT_eX]

[DOI]

Int. J. Medical Informatics, 2006

2005

Properties of Rough Approximations.

[BibT_eX]

[DOI]

J. Adv. Comput. Intell. Intell. Informatics, 2005

Contextual weighting for Support Vector Machines in literature mining: an application to gene versus protein name disambiguation.

[BibT_eX]

[DOI]

BMC Bioinform., 2005

Kernels Incorporating Word Positional Information in Natural Language Disambiguation Tasks.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference, 2005

Relational Correspondences for Lattices with Operators.

[BibT_eX]

[DOI]

Ewa Orlowska

Proceedings of the Relational Methods in Computer Science, 2005

2004

New Techniques for Disambiguation in Natural Language and Their Application to Biological Text.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2004

Ontology-Based Feature Transformations: A Data-Driven Approach.

[BibT_eX]

[DOI]

Proceedings of the Advances in Natural Language Processing, 4th International Conference, 2004

The Ordered Set of Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2004

Extracting Protein-Protein Interaction Sentences by Applying Rough Set Data Analysis.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2004

Analysis of Link Grammar on Biomedical Dependency Corpus Targeted at Protein-Protein Interactions.

[BibT_eX]

[DOI]

Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications, 2004

2002

On the Structure of Rough Approximations.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2002

2001

Dense Families and Key Functions of Database Relation Instances.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Armstrong Systems on Ordered Sets.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2001

2000

Two exercises.

[BibT_eX]

[DOI]

Tomi Pasanen

SIGACT News, 2000

Difference Functions of Dependence Spaces.

[BibT_eX]

[DOI]

Acta Cybern., 2000

Approximations and Rough Sets Based on Tolerances.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2000

1998

Preimage Relations and Their Matrices.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 1998

1997

A Representation of Dependence Spaces and Some Basic Algorithms.

[BibT_eX]

[DOI]