Ivo Düntsch

Orcid: 0000-0001-8907-2382

According to our database1, Ivo Düntsch authored at least 92 papers between 1985 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Special issue on small data analytics.
Int. J. Mach. Learn. Cybern., January, 2023

The fork and its role in unification of closure algebras.
CoRR, 2023

2021
Ideal related algebras and their logics.
J. Log. Comput., 2021

2020
Indices for rough set approximation and the application to confusion matrices.
Int. J. Approx. Reason., 2020

Ideal Related Algebras and Their Logics Extended Abstract.
Proceedings of the Logic and Argumentation - Third International Conference, 2020

2019
Confusion matrices and rough set data analysis.
CoRR, 2019

A Discrete Representation of Lattice Frames.
Proceedings of the Logic, Rationality, and Interaction - 7th International Workshop, 2019

2018
Approximation by Filter Functions.
Proceedings of the Rough Sets - International Joint Conference, 2018

2017
Mixed algebras and their logics.
J. Appl. Non Class. Logics, 2017

A Discrete Representation for Dicomplemented Lattices.
Fundam. Informaticae, 2017

2016
A Relational Logic for Spatial Contact Based on Rough Set Approximation.
Fundam. Informaticae, 2016

Discrete dualities for n-potent MTL-algebras and 2-potent BL-algebras.
Fuzzy Sets Syst., 2016

2015
PRE and Variable Precision Models in Rough Set Data Analysis.
Trans. Rough Sets, 2015

Simplifying Contextual Structures.
Proceedings of the Pattern Recognition and Machine Intelligence, 2015

2014
Standard Errors of Indices in Rough Set Data Analysis.
Trans. Rough Sets, 2014

Discrete dualities for some algebras with relations.
J. Log. Algebraic Methods Program., 2014

2013
On the Gradual Evolvement of Things.
Proceedings of the Rough Sets and Intelligent Systems - Professor Zdzisław Pawlak in Memoriam, 2013

Functions definable by numerical set-expressions.
J. Log. Comput., 2013

Discrete Duality for Rough Relation Algebras.
Fundam. Informaticae, 2013

Lattice Machine Classification based on Contextual Probability.
Fundam. Informaticae, 2013

2012
Weighted lambda precision models in rough set data analysis.
Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Extension Properties of Boolean Contact Algebras.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2012

2011
Quadtree Representation and Compression of Spatial Data.
Trans. Rough Sets, 2011

Discrete Dualities for Double Stone Algebras.
Stud Logica, 2011

An Algebraic Approach to Preference Relations.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

2010
Structures with Multirelations, their Discrete Dualities and Applications.
Fundam. Informaticae, 2010

A Fast Randomisation Test for Rule Significance.
Proceedings of the Rough Sets and Current Trends in Computing, 2010

2009
Complex Algebras of Arithmetic.
Fundam. Informaticae, 2009

Timed Contact Algebras.
Proceedings of the TIME 2009, 2009

Affordance Relations.
Proceedings of the Rough Sets, 2009

Choosing the root node of a quadtree.
Proceedings of the 2009 IEEE International Conference on Granular Computing, 2009

Functions Definable by Arithmetic Circuits.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Distributive contact lattices: Topological representations.
J. Log. Algebraic Methods Program., 2008

A discrete duality between apartness algebras and apartness frames.
J. Appl. Non Class. Logics, 2008

Moving Spaces.
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning, 2008

Probabilistic Granule Analysis.
Proceedings of the Rough Sets and Current Trends in Computing, 2008

The Lattice of Contact Relations on a Boolean Algebra.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2008

2007
Axioms, Algebras and Topology.
Proceedings of the Handbook of Spatial Logics, 2007

Relational Attribute Systems II: Reasoning with Relations in Information Structures.
Trans. Rough Sets, 2007

A Multi-modal Logic for Disagreement and Exhaustiveness.
Fundam. Informaticae, 2007

Region-based theory of discrete spaces: A proximity approach.
Ann. Math. Artif. Intell., 2007

2006
Rough Relation Algebras Revisited.
Fundam. Informaticae, 2006

Betweenness and Comparability Obtained from Binary Relations.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

Lattice-Based Relation Algebras II.
Proceedings of the Theory and Applications of Relational Structures as Knowledge Instruments II, 2006

Topological Representation of Contact Lattices.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2006

2005
A representation theorem for Boolean contact algebras.
Theor. Comput. Sci., 2005

Relation Algebras and their Application in Temporal and Spatial Reasoning.
Artif. Intell. Rev., 2005

Relational Semantics Through Duality.
Proceedings of the Relational Methods in Computer Science, 2005

Weak Contact Structures.
Proceedings of the Relational Methods in Computer Science, 2005

2004
On Model Evaluation, Indexes of Importance, and Interaction Values in Rough Set Analysis.
Proceedings of the Rough-Neural Computing: Techniques for Computing with Words., 2004

Hyperrelations in version space.
Int. J. Approx. Reason., 2004

Boolean algebras arising from information systems.
Ann. Pure Appl. Log., 2004

Construction of Boolean contact algebras.
AI Commun., 2004

Nearest Neighbours without <i>k</i>.
Proceedings of the Monitoring, Security, and Rescue Techniques in Multiagent Systems, 2004

2003
Maximum Consistency of Incomplete Data via Non-Invasive Imputation.
Artif. Intell. Rev., 2003

A Density Based Approach to Classification.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

Lattice-Based Relation Algebras and Their Representability.
Proceedings of the Theory and Applications of Relational Structures as Knowledge Instruments, 2003

Approximation Operators in Qualitative Data Analysis.
Proceedings of the Theory and Applications of Relational Structures as Knowledge Instruments, 2003

2002
A Proximity Approach to Some Region-Based Theories of Space.
J. Appl. Non Class. Logics, 2002

Modal-style operators in qualitative data analysis.
Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 2002

2001
A relation - algebraic approach to the region connection calculus.
Theor. Comput. Sci., 2001

Cylindric structures and dependencies in relational databases.
Theor. Comput. Sci., 2001

A Necessary Relation Algebra for Mereotopology.
Stud Logica, 2001

Relational attribute systems.
Int. J. Hum. Comput. Stud., 2001

Roughian: Rough information analysis.
Int. J. Intell. Syst., 2001

Algebras of Approximating Regions.
Fundam. Informaticae, 2001

Rough approximation quality revisited.
Artif. Intell., 2001

Classification through Maximizing Density.
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001

A note on proximity spaces and connection based mereology.
Proceedings of the 2nd International Conference on Formal Ontology in Information Systems, 2001

Tangent Circle Algebras.
Proceedings of the Relational Methods in Computer Science, 2001

2000
Logics of Complementarity in Information Systems.
Math. Log. Q., 2000

A Proof System for Contact Relation Algebras.
J. Philos. Log., 2000

A multimodal logic for reasoning about complementarity.
J. Appl. Non Class. Logics, 2000

Classificatory filtering in decision systems.
Int. J. Approx. Reason., 2000

Structures with Many-Valued Information and Their Relational Proof Theory.
Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic, 2000

An Algebraic and Logical Approach to the Approximation of Regions.
Proceedings of the Participants Copies of Fifth International Seminar on Relational Methods in Computer Science, 2000

1999
Relations Algebras in Qualitative Spatial Reasoning.
Fundam. Informaticae, 1999

The IsoMetrics usability inventory: An operationalization of ISO 9241-10 supporting summative and formative evaluation of software systems.
Behav. Inf. Technol., 1999

A Lattice Machine Approach to Automated Casebase Design: Marrying Lazy and Eager Learning.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999

1998
Simple data filtering in rough set systems.
Int. J. Approx. Reason., 1998

Uncertainty Measures of Rough Set Prediction.
Artif. Intell., 1998

Data Reduction Based on Hyper Relations.
Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), 1998

Relation algebras in spatial reasoning (invited paper).
Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1997
A Logic for Rough Sets.
Theor. Comput. Sci., 1997

Statistical evaluation of rough set dependency analysis.
Int. J. Hum. Comput. Stud., 1997

Algebraic Aspects of Attribute Dependencies in Information Systems.
Fundam. Informaticae, 1997

1996
GROBIAN: An engine for rough set data analysis.
Proceedings of the First International Conference on Practical Aspects of Knowledge Management, 1996

1995
Binary Relations and Permutation Groups.
Math. Log. Q., 1995

Expressibility of Properties of Relations.
J. Symb. Log., 1995

1994
A Microcomputer Based System for Small Relation Algebras.
J. Symb. Comput., 1994

Rough Relation Algebras.
Fundam. Informaticae, 1994

1985
Complements and quasicomplements in the lattice of subalgebras of P(omega).
Discret. Math., 1985


  Loading...