[1] I. Düntsch and G. Gediga. Rough set clustering. In C. M. Henning, M. Meila, F. Murtagh, and R. Rocci, editors, Handbook of Cluster Analysis, Handbooks of Modern Statistical Methods, chapter 5. Chapman & Hall, 2016. To appear. [ bib | .pdf ]
[2] I. Düntsch, E. Orlowska, and C. van Alten. Discrete dualities for n-potent MTL-algebras and 2-potent BL-algebras. Fuzzy Sets and Systems, 2016. In press. [ bib | DOI | .pdf ]
[3] I. Düntsch, E. Orlowska, and H. Wang. A relational logic for spatial contact based on rough set approximation. Fundamenta Informaticae, 2016. To appear. [ bib ]
[4] I. Düntsch and G. Gediga. PRE and variable precision models in rough set data analysis. Transactions in Rough Sets, pages 17-37, 2015. [ bib | .pdf ]
[5] I. Düntsch and G. Gediga. Simplifying contextual structures. In Proceddings of the 6th International Conference on Pattern Recognition and Machine Intelligence, volume 9124 of Lecture Notes in Computer Science, pages 23-32, Heidelberg, 2015. Springer Verlag. [ bib | .pdf ]
[6] I. Düntsch and E. Orlowska. Discrete dualities for some algebras with relations. Journal of Logical and Algebraic Methods in Programming, 83(2):169 - 179, 2014. MR3292915. [ bib | DOI | .pdf ]
[7] G. Gediga and I. Düntsch. Standard errors of indices in rough set data analysis. In J.F. Peters and A. Skowron, editors, Transactions on Rough Sets Vol. XVII, volume 8375 of Lecture Notes in Computer Science, pages 33 - 47. Springer Verlag, Heidelberg, 2014. [ bib | DOI | .pdf ]
[8] I. Düntsch and S. Li. On the homogeneous countable Boolean contact algebra. Logic and Logical Philosophy, 22:213-251, 2013. [ bib | .pdf ]
[9] I. Düntsch and E. Orlowska. Discrete duality for rough relation algebras. Fundamenta Informaticae, 127:35-47, 2013. MR3134947. [ bib | .pdf ]
[10] I. Pratt-Hartmann and I. Düntsch. Functions Definable by Numerical Set-Expressions. Journal of Logic and Computation, 23:873-895, 2013. MR3082531. [ bib | DOI ]
[11] H. Wang, I. Düntsch, and L. Trindade. Lattice machine classification based on contextual probability. Fundamenta Informaticae, 127:241-256, 2013. MR3134957. [ bib ]
[12] I. Düntsch and G. Gediga. Weighted λ precision models in rough set data analysis. In Proceedings of the Federated Conference on Computer Science and Information Systems, Wroclaw, Poland, pages 309-316. IEEE, 2012. [ bib ]
[13] I. Düntsch and G. Gediga. On the gradual evolvement of things. In A. Skowron and Z. Suraj, editors, Rough Sets and Intelligent Systems. Professor Zdzislaw Pawlak in Memoriam, volume 1, chapter 8, pages 247-257. Springer Verlag, Heidelberg, 2012. [ bib ]
[14] I. Düntsch and S. Li. Extension properties of Boolean contact algebras. In W. Kahl and T.G. Griffin, editors, Proceedings of RaMiCS 2012, volume 7560 of Lecture Notes in Computer Science, pages 342-356, Heidelberg, 2012. Springer Verlag. MR3040176. [ bib | .pdf ]
[15] I. Düntsch. Cylindric algebras and relational databases. In H. Andréka, M. Ferenczi, and I. Németi, editors, Cylindric-like Algebras and Algebraic Logic, volume 22 of Bolay Society Mathematical Studies, pages 301-311. North-Holland, 2012. MR3156406. [ bib ]
[16] S. Koppelberg, I. Düntsch, and M. Winter. Remarks on contact relations on Boolean algebras. Algebra Universalis, 68:353-366, 2012. MR3029961. [ bib ]
[17] I. Düntsch and E. Orlowska. An Algebraic Approach to Preference Relations. In Harrie C. M. de Swart, editor, Proceedings of the 12th International Conference on Relational and Algebraic Methods in Computer Science (RAMiCS 12), volume 6663 of Lecture Notes in Computer Science, pages 141-147. Springer Verlag, 2011. MR2913845. [ bib | .pdf ]
[18] I. Düntsch and E. Orlowska. Discrete dualities for double Stone algebras. Studia Logica, 99:127-142, 2011. MR2836437. [ bib ]
[19] X. Yin, I. Düntsch, and G. Gediga. Quadtree Representation and Compression of Spatial Data. Transactions on Rough Sets, 13:207-238, 2011. [ bib ]
[20] I. Düntsch and G. Gediga. A Fast Randomisation Test for Rule Significance. In Marcin Szczuka, Marzena Kryszkiewicz, Sheela Ramanna, Richard Jensen, and Qinghua Hu, editors, Rough Sets and Current Trends in Computing, 7th International Conference, RSCTC 2010, volume 6086 of Lecture Notes in Computer Science, pages 386-391. Springer Verlag, 2010. [ bib ]
[21] I. Düntsch, E. Orlowska, and I. Rewitzky. Structures with multirelations, their discrete dualities and applications. Fundam. Inform., 100:77-98, 2010. MR2741937. [ bib ]
[22] X. Yin, I. Düntsch, and G. Gediga. Choosing the root node of a quadtree. In T.Y. Lin, editor, 2009 IEEE International Conference on Granular Computing (GrC 2009), pages 721-726, 2009. [ bib ]
[23] I. Düntsch, G. Gediga, and A. Lenarcic. Affordance relations. In Hiroshi Sakai, Mihir K. Chakraborty, Aboul Ella Hassanien, Dominik Slezak, and William Zhu, editors, Proceedings of the Twelfth International Conference on Rough Sets, Fuzzy Sets, Data Mining & Granular Computing, volume 5908 of Lecture Notes in Computer Science, pages 1-11. Springer Verlag, 2009. [ bib ]
[24] I. Düntsch and I. Pratt-Hartmann. Complex Algebras of Arithmetic. Fundam. Inform., 97(4):347-367, 2009. MR2583185. [ bib ]
[25] I. Düntsch and M. Winter. Timed contact algebras. In Carsten Lutz and Jean-Francois Raskin, editors, Proceedings of the 16th International Symposium on Temporal representation and Reasoning (TIME 2009), pages 133-138, Los Alamitos, 2009. IEEE Computer Society. [ bib ]
[26] I. Pratt-Hartmann and I. Düntsch. Functions Definable by Arithmetic Circuits. In K. Ambos-Spies, B. Löwe, and W. Merkle, editors, Mathematical Theory and Computational Practice: 5th Conference on Computability in Europe, CiE 2009, volume 5635 of Lecture Notes in Computer Science, pages 409-418, Heidelberg, 2009. Springer Verlag. MR2545915. [ bib ]
[27] I. Düntsch and G. Gediga. Probabilistic granule analysis. In Chien-Chung Chan, Jerzy W. Grzymala-Busse, and Wojciech P. Ziarko, editors, Proceedings of the Sixth International Conference on Rough Sets and Current Trends in Computing (RSCTC 2008), volume 5306 of Lecture Notes in Computer Science, pages 223-231. Springer Verlag, 2008. [ bib ]
[28] I. Düntsch, W. McCaull, D. Vakarelov, and M. Winter. Distributive contact lattices: Topological representations. The Journal of Logic and Algebraic Programming, 76:18-34, 2008. MR2423465. [ bib ]
[29] I. Düntsch and E. Orlowska. A discrete duality between apartness algebras and apartness frames. Journal of Applied Non-Classical Logics, 18:213-227, 2008. MR2462235. [ bib ]
[30] I. Düntsch and M. Winter. The lattice of contact relations on a Boolean algebra. In Rudolf Berghammer, Bernhard Möller, and Georg Struth, editors, Proceedings of the 10th International Conference on Relational Methods in Computer Science and the 5th International Workshop on Applications of Kleene Algebra, volume 4988 of Lecture Notes in Computer Science, pages 99-109. Springer Verlag, Heidelberg, 2008. MR2497622. [ bib ]
[31] I. Düntsch and M. Winter. Moving spaces. In Stéphane Demri and Christian S. Jensen, editors, Proceedings of the 15th International Symposium on Temporal representation and Reasoning (TIME 2008), pages 59-63. IEEE Computer Society, 2008. [ bib ]
[32] B. Bennett and I. Düntsch. Algebras, axioms, and topology. In Marco Aiello, Johan van Benthem, and Ian Pratt-Hartmann, editors, Handbook of Spatial Logics, pages 99-159. Kluwer, Dordrecht, 2007. MR2393887. [ bib | .pdf ]
[33] I. Düntsch, G. Gediga, and E. Orlowska. Relational attribute systems II. Transactions on Rough Sets, 7:16-35, 2007. MR2397127. [ bib | .pdf ]
[34] I. Düntsch and B. Konikowska. A multimodal logic for disagreement and exhaustiveness. Fundamenta Informaticae, 75:215-238, 2007. MR2293697. [ bib | .pdf ]
[35] I. Düntsch and D. Vakarelov. Region-based theory of discrete spaces: A proximity approach. Annals of Mathematics and Artificial Intelligence, 49:5-14, 2007. MR2348380. [ bib | .pdf ]
[36] James F. Peters, Andrzej Skworon, Ivo Düntsch, Jerzy Grzymala-Busse, Ewa Orlowska, and Lech Polkowski, editors. Transactions on Rough Sets VI - Commemorating the Life and Work of Zdislaw Pawlak, Part I, volume 4374 of Lecture Notes in Computer Science, Heidelberg, 2007. Springer Verlag. [ bib ]
[37] I. Düntsch, W. McCaull, D. Vakarelov, and M. Winter. Topological representation of contact lattices. In Renate Schmidt, editor, Proceedings of the 9th International Conference on Relational Methods in Computer Science and the 4th International Workshop on Applications of Kleene Algebra, volume 4136 of Lecture Notes in Computer Science, pages 135-147. Springer-Verlag, Heidelberg, 2006. MR2293697. [ bib | .pdf ]
[38] I. Düntsch and A. Urquhart. Betweenness and comparability obtained from binary relations. In Renate Schmidt, editor, Proceedings of the 9th International Conference on Relational Methods in Computer Science and the 4th International Workshop on Applications of Kleene Algebra, volume 4136 of Lecture Notes in Computer Science, pages 148-161. Springer-Verlag, Heidelberg, 2006. MR2293697. [ bib | .pdf ]
[39] I. Düntsch and M. Winter. Rough relation algebras revisited. Fundamenta Informaticae, 74:283-300, 2006. MR2293697. [ bib | .pdf ]
[40] I. Düntsch, E. Orlowska, and A. Radzikowska. Lattice-based relation algebras and their representability II. In Harri de Swart, Ewa Or}owska, Gunther Schmidt, and Marc Roubens, editors, Theory and Application of Relational Structures as Knowledge Instruments II, volume 4342 of Lecture Notes in Artificial Intelligence, pages 267-289. Springer-Verlag, Heidelberg, 2006. [ bib | .pdf ]
[41] H. Wang, I. Düntsch, G. Gediga, and G. Guo. Nearest Neighbours without k. In Barbara Dunin-Keplicz, Andrzej Jankowski, Andrzej Skowron, and Marcin Szczuka, editors, Monitoring, Security, and Rescue Techniques in Multiagent Systems, Advances in Soft Computing, chapter 12, pages 179-189. Springer Verlag, Heidelberg, 2006. [ bib ]
[42] I. Düntsch and M. Winter. A Representation Theorem for Boolean Contact Algebras. Theoretical Computer Science (B), 347:498-512, 2005. MR2187916. [ bib | .pdf ]
[43] I. Düntsch and M. Winter. Weak Contact Structures. In Wendy MacCaull, Michael Winter, and Ivo Düntsch, editors, Proceedings of the 8th International Conference on Relational Methods in Computer Science and the 3rd International Workshop on Applications of Kleene Algebra and Workshop of COST Action 274, volume 3929 of Lecture Notes in Computer Science, pages 73-82, Heidelberg, 2005. Springer-Verlag. MR2251975. [ bib | .pdf ]
[44] I. Düntsch. Relation algebras and their application in temporal and spatial reasoning. Artificial Intelligence Review, 23:315 - 357, 2005. [ bib | .pdf ]
[45] Dominik Slezak, Guoyin Wang, Marcin Szczuka, Ivo Düntsch, and Yiyu Yao, editors. Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005), volume 3641 of Lecture Notes in Artificial Intelligence, Heidelberg, 2005. Springer Verlag. [ bib ]
[46] E. Orlowska, I. Rewitzky, and I. Düntsch. Relational semantics through duality. In Wendy MacCaull, Michael Winter, and Ivo Düntsch, editors, Proceedings of the 8th International Conference on Relational Methods in Computer Science and the 3rd International Workshop on Applications of Kleene Algebra and Workshop of COST Action 274, volume 3929 of Lecture Notes in Computer Science, pages 17-32, Heidelberg, 2005. Springer-Verlag. MR2251971. [ bib | http | .pdf ]
[47] Wendy MacCaull, Michael Winter, and Ivo Düntsch, editors. Proceedings of the 8th International Conference on Relational Methods in Computer Science and the 4th International Workshop on Applications of Kleene Algebra and Workshop of COST Action 274, volume 3929 of Lecture Notes in Computer Science, Heidelberg, 2005. Springer Verlag. [ bib ]
[48] I. Düntsch and E. Orlowska. Boolean algebras arising from information systems. Annals of Pure and Applied Logic, 127:77-98, 2004. MR2071169. [ bib | .pdf ]
[49] I. Düntsch and M. Winter. Construction of Boolean contact algebras. AI Communications, 13:235-246, 2004. MR2120219. [ bib | .pdf ]
[50] G. Gediga, I. Düntsch, and J. Adams-Webber. On the direct scaling approach of eliciting aggregated fuzzy information: The psychophysical view. In Scott Dick, Lukasz Kurgan, Petr Musilek, Witold Pedrycz, and Marek Reformat, editors, Proceedings the 2004 Annual Meeting of the North American Fuzzy Information Processing Society, pages 948-953, 2004. [ bib | .pdf ]
[51] H. Wang, I. Düntsch, G. Gediga, and A. Skowron. Hyperrelations in version space. International Journal of Approximate Reasoning, 36:223-241, 2004. MR2062628. [ bib | .html | .pdf ]
[52] I. Düntsch, E. Orlowska, A. Radzikowska, and D. Vakarelov. Relational Representation Theorems for Some Lattice-Based Structures. Journal of Relational Methods in Computer Science, 1:132-160, 2004. [ bib | .pdf ]
[53] I. Düntsch and M. Winter. Algebraization and representation of mereotopological structures. Journal of Relational Methods in Computer Science, 1:161-180, 2004. [ bib | .pdf | Abstract ]
[54] A. Muir, I. Düntsch, and G. Gediga. Rough set data representation using binary decision diagrams. Revista Real Academia de Ciencias, Serie A, 98:197-213, 2004. MR2136167. [ bib | .pdf ]
[55] I. Düntsch and G. Gediga. Approximation operators in qualitative data analysis. In Harri de Swart, Ewa Orlowska, Gunther Schmidt, and Marc Roubens, editors, Theory and Application of Relational Structures as Knowledge Instruments, volume 2929 of Lecture Notes in Computer Science, pages 214-230. Springer-Verlag, Heidelberg, 2003. [ bib ]
[56] I. Düntsch and G. Gediga. On model evaluation, indices of importance, and interaction values in rough set analysis. In S.K.Pal, L.Polkowski, and A.Skowron, editors, Rough-Neural Computing: Techniques for computing with words, pages 251-276. Physica Verlag, Heidelberg, 2003. [ bib | .pdf ]
[57] I. Düntsch and G. Gediga. Maximum consistency of incomplete data via non-invasive imputation. Artificial Intelligence Review, 19:93-107, 2003. [ bib | .pdf ]
[58] I. Düntsch, E. Orlowska, and A. Radzikowska. Lattice-based relation algebras and their representability. In Harri de Swart, Ewa Or}owska, Gunther Schmidt, and Marc Roubens, editors, Theory and Application of Relational Structures as Knowledge Instruments, volume 2929 of Lecture Notes in Computer Science, pages 231-255. Springer-Verlag, Heidelberg, 2003. [ bib | .pdf ]
[59] H. Wang, D. Bell, and I. Düntsch. A density based aapproach to classification. In SAC '03: Proceedings of the 2003 ACM symposium on Applied computing, pages 470-474, New York, 2003. ACM Press. [ bib | DOI ]
[60] I. Düntsch and G. Gediga. Modal-style Operators in Qualitative Data Analysis. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), pages 155-162, 2002. [ bib | .html | .pdf ]
[61] I. Düntsch and M. Roubens. Tangent circle algebras. In Harri de Swart, editor, Proceedings of the 6th Seminar on Relational Methods in Computer Science, number 2561 in Lecture Notes in Computer Science, pages 300-314, Heidelberg, 2002. Springer-Verlag. MR2052069. [ bib ]
[62] G. Gediga and I. Düntsch. Skill set analysis in knowledge structures. British Journal of Mathematical and Statistical Psychology, 55:361-384, 2002. MR1949262. [ bib | .html | .pdf ]
[63] G. Gediga and I. Düntsch. Approximation quality for sorting rules. Computational Statistics and Data Analysis, 40:499-526, 2002. MR1926613. [ bib | .html | .pdf ]
[64] G. Gediga, K.-Ch. Hamborg, and I. Düntsch. Evaluation of software systems. In Encyclopedia of Computer Science and Technology, volume 45, pages 127 - 153. Marcel Dekker, 2002. Also appeared in volume 72 of the Encyclopedia of Library and Information Science (2002), 166-192. [ bib | .html | .pdf ]
[65] D. Vakarelov, G. Dimov, I. Düntsch, and B. Bennett. A proximity approach to some region-based theories of space. J. Appl. Non-Classical Logics, 12:527-529, 2002. [ bib | .html | .pdf ]
[66] H. Wang, I. Düntsch, G. Gediga, and A. Skowron. Hyperrelations in version space (Extended abstract). In SAC '02: Proceedings of the 2002 ACM symposium on Applied computing, pages 514-518, New York, 2002. ACM Press. [ bib | DOI ]
[67] G. Gediga and I. Düntsch. Rough approximation quality revisited. Artificial Intelligence, 132:219-234, 2001. [ bib | .pdf ]
[68] I. Düntsch and G. Gediga. A note on the correspondences among entail relations, rough set dependencies, and logical consequence. Journal of Mathematical Psychology, 45:393 - 401, 2001. MR1836895. [ bib | .html | .pdf ]
[69] I. Düntsch and G. Gediga. Roughian - Rough Information Analysis. International Journal of Intelligent Systems, 46:121-147, 2001. [ bib | .html | .pdf ]
[70] I. Düntsch, G. Gediga, and E. Orlowska. Relational attribute systems. International Journal of Human Computer Studies, 55(3):293-309, 2001. [ bib | DOI | .pdf ]
[71] I. Düntsch and S. Mikulás. Cylindric structures and dependencies in relational databases. Theoretical Computer Science, 269:451-468, 2001. MR1862420. [ bib | DOI | .html | .pdf ]
[72] I. Düntsch and E. Orlowska. Beyond modalities: Sufficiency and mixed algebras. In Ewa Orlowska and Andrzej Szalas, editors, Relational Methods in Algebra, Logic, and Computer Science, pages 277-299, Heidelberg, 2001. Physica-Verlag. MR1858531. [ bib | .html | .pdf ]
[73] I. Düntsch, E. Orlowska, and H. Wang. Algebras of approximating regions. Fundamenta Informaticae, 46:71-82, 2001. MR2009801. [ bib | .html | .pdf ]
[74] I. Düntsch, G. Schmidt, and M. Winter. A necessary relation algebra for mereotopology. Studia Logica, 69:381-409, 2001. MR1874421. [ bib | .html | .pdf ]
[75] I. Düntsch, H. Wang, and S. McCloskey. A relation algebraic approach to the Region Connection Calculus. Theoretical Computer Science, 255:63-83, 2001. MR1819067. [ bib | DOI | .pdf ]
[76] I. Düntsch. Contact relation algebras. In Ewa Orlowska and Andrzej Szalas, editors, Relational Methods in Algebra, Logic, and Computer Science, pages 113-134, Heidelberg, 2001. Physica-Verlag. MR1858522. [ bib | .html | .pdf ]
[77] D. Vakarelov, I. Düntsch, and B. Bennett. A note on proximity spaces and connection based mereology. In C. Welty and B. Smith, editors, FOIS '01: Proceedings of the international conference on Formal Ontology in Information Systems, pages 139-150, New York, NY, USA, 2001. ACM Press. MR1973631. [ bib | .html | .pdf ]
[78] H. Wang, I. Düntsch, D. Bell, and D. Liu. Classification through Maximizing Density. In First IEEE International Conference on Data Mining (ICDM'01), pages 655-656, Los Alamitos, CA, USA, 2001. IEEE Computer Society. [ bib | DOI ]
[79] I. Düntsch and G. Gediga. Logical and algebraic techniques for rough set data analysis. In Lech Polkowski, Shusaku Tsumoto, and Tsau Young Lin, editors, Rough set methods and applications: New developments in knowledge discovery in information systems, pages 521-544. Physica Verlag, Heidelberg, 2000. MR1858667. [ bib ]
[80] I. Düntsch and G. Gediga. Rough set data analysis: A road to non-invasive knowledge discovery. Methodos Publishers (UK), Bangor, 2000. [ bib | .pdf ]
[81] I. Düntsch and G. Gediga. Rough set data analysis. In Encyclopedia of Computer Science and Technology, volume 43, pages 281-301. Marcel Dekker, 2000. [ bib | .html | .pdf ]
[82] I. Düntsch and G. Gediga. Sets, relations, functions. Methodos Publishers (UK), Bangor, 2000. [ bib | http | .pdf ]
[83] I. Düntsch, G. Gediga, and S. Nguyen. Rough sets in the KDD process. In Proc. of IPMU 2000, pages 220-226, 2000. [ bib | .html | .pdf ]
[84] I. Düntsch and B. Konikowska. A multimodal logic for reasoning about complementarity. J. Appl. Non-Classical Logics, 10(3):273-301, 2000. MR1915687. [ bib | .html | .pdf ]
[85] I. Düntsch, W. McCaull, and E. Orlowska. Structures with many-valued information and their relational proof theory. In Proc. of 30th IEEE International Symposium on Multiple-Valued Logic, pages 293-301, 2000. MR1896570. [ bib | .html | .pdf ]
[86] Ivo Düntsch and Ewa Orlowska. Logics of complementarity in information systems. Mathematical Logic Quarterly, 46(4):267-288, 2000. MR1755816. [ bib ]
[87] I. Düntsch and E. Orlowska. A proof system for contact relation algebras. Journal of Philosophical Logic, 29:241-262, 2000. MR1773955. [ bib | .html | .pdf ]
[88] I. Düntsch, E. Orlowska, and H. Wang. An algebraic and logical approach to the approximation of regions. In Participants Copies of the Fifth International Seminar on Relational Methods in Computer Science, January 9-14, 2000, Valcartier (Quebec), Canada, pages 65-74, 2000. [ bib ]
[89] I. Düntsch, H. Wang, and S. McCloskey. Relation algebras in qualitative spatial reasoning. Fundamenta Informaticae, pages 229-248, 2000. MR1735458. [ bib | .html | .pdf ]
[90] G. Gediga and I. Düntsch. Statistical techniques for rough set data analysis. In Lech Polkowski, Shusaku Tsumoto, and Tsau Young Lin, editors, Rough set methods and applications: New developments in knowledge discovery in information systems, pages 545-565. Physica Verlag, Heidelberg, 2000. MR1858668. [ bib | .html | .pdf ]
[91] G. Gediga, K.-Ch. Hamborg, and I. Düntsch. The IsoMetrics usability inventory: An operationalisation of ISO 9241/10. Behaviour and Information Technology, 18:151-164, 2000. [ bib | .html | .pdf ]
[92] H. Wang, I. Düntsch, and G. Gediga. Classificatory Filtering in Decision Systems. International Journal of Approximate Reasoning, 23:111-136, 2000. MR1745005. [ bib | DOI | .html | .pdf ]
[93] I. Düntsch and E. Orlowska. Mixing modal and sufficiency operators. Bulletin of the Section of Logic, Polish Academy of Sciences, 28(2):99-106, 1999. MR1740612. [ bib ]
[94] H. Wang, W. Dubitzky, I. Düntsch, and D. Bell. A Lattice Machine Approach to Automated Casebase Design: Marrying Lazy and Eager Learning. In Dean Thomas, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol1), pages 254-263, S.F., 1999. Morgan Kaufmann Publishers. [ bib | .pdf ]
[95] C. Browne, I. Düntsch, and G. Gediga. IRIS revisited: A comparison of discriminant and enhanced rough set data analysis. In Lech Polkowski and Andrzej Skowron, editors, Rough sets in knowledge discovery, Vol. 2, pages 345-368. Physica-Verlag, 1998. [ bib | .html | .pdf ]
[96] I. Düntsch and G. Gediga. Simple Data Filtering in Rough Set Systems. International Journal of Approximate Reasoning, 18(1-2):93-106, 1998. MR1657478. [ bib | .html | .pdf ]
[97] I. Düntsch and G. Gediga. Grobian. In Lech Polkowski and Andrzej Skowron, editors, Rough sets in knowledge discovery, Vol. 2, pages 555-557. Physica-Verlag, 1998. [ bib ]
[98] I. Düntsch and G. Gediga. Knowledge structures and their applications in CALL systems. In S. Jager, J. Nerbonne, and A. van Essen, editors, Language teaching and language technology, pages 177-186. Swets & Zeitlinger, 1998. [ bib | .html | .pdf ]
[99] I. Düntsch and G. Gediga. Logical tools for rule based data analysis. In Jan Komorowski, Ivo Düntsch, and Andrzej Skowron, editors, Workshop on Synthesis of Intelligent Agent Systems from Experimental Data, ECAI'98. IOS Press, 1998. [ bib ]
[100] I. Düntsch and G. Gediga. Feature selection and data prediction by rough entropy. In Hans-Jürgen Zimmermann, editor, 6th European Congress on Intelligent Techniques and Soft Computing EUFIT'98, pages 81-85, Aachen, Germany, 1998. [ bib ]
[101] I. Düntsch and G. Gediga. Uncertainty measures of rough set prediction. Artificial Intelligence, 106:77-107, 1998. MR1670304. [ bib | .html | .pdf ]
[102] I. Düntsch, H. Wang, and S. McCloskey. Relation algebras in spatial reasoning. In Ewa Orlowska and Andrzej Szalas, editors, Extended Abstracts of the 4th Seminar on Relational Methods in Algebra, Logic, and Computer Science, pages 63-68, 1998. [ bib ]
[103] G. Gediga and I. Düntsch. Statistical tools for rule based data analysis. In Jan Komorowski, Ivo Düntsch, and Andrzej Skowron, editors, Workshop on Synthesis of Intelligent Agent Systems from Experimental Data, ECAI'98. IOS Press, 1998. [ bib ]
[104] H. Wang, I. Düntsch, and D. Bell. Data reduction based on hyper relations. In Rakesh Agrawal, Paul Stolorz, and Gregory Piatetsky-Shapiro, editors, Proceedings of KDD'98, pages 349-353, New York, 1998. [ bib | .pdf ]
[105] I. Düntsch and G. Gediga. Algebraic Aspects of Attribute Dependencies in Information Systems. Fundamenta Informaticae, 29:119-133, 1997. MR1475089. [ bib | .html | .pdf ]
[106] I. Düntsch and G. Gediga. The Rough Set Engine Grobian. In Achim Sydow, editor, Proc. 15th IMACS World Congress, Berlin, volume 4, pages 613-618, Berlin, 1997. Wissenschaft und Technik Verlag. [ bib | .html | .pdf ]
[107] I. Düntsch and G. Gediga. Non-invasive data analysis. In Proc. 8th Ireland Conference on Artificial Intelligence, Derry, (1997), pages 24-31, 1997. [ bib ]
[108] I. Düntsch and G. Gediga. Relation restricted prediction analysis. In Achim Sydow, editor, Proc. 15th IMACS World Congress, Berlin, volume 4, pages 619-624, Berlin, 1997. Wissenschaft und Technik Verlag. [ bib | .html | .pdf ]
[109] I. Düntsch and G. Gediga. Statistical Evaluation of Rough Set Dependency Analysis. International Journal of Human-Computer Studies, 46:589-604, 1997. [ bib | .html | .pdf ]
[110] I. Düntsch and G. Gediga. Roughian - Rough Information Analysis (Extended abstract). In Achim Sydow, editor, Proc. 15th IMACS World Congress, volume 4, pages 631-636, Berlin, 1997. Wissenschaft und Technik Verlag. [ bib ]
[111] I. Düntsch. Rough sets and algebras of relations. In Ewa Orlowska, editor, Incomplete Information - Rough Set Analysis, pages 95-108. Physica - Verlag, 1997. MR1647376. [ bib | .html | .pdf ]
[112] I. Düntsch. A logic for rough sets. Theoretical Computer Science, 179(1-2):427-436, 1997. MR1454599. [ bib | .html | .pdf ]
[113] I. Düntsch and G. Gediga. On query procedures to build knowledge structures. Journal of Mathematical Psychology, 40(2):160-168, 1996. MR1398596. [ bib | .html | .pdf ]
[114] H. Andréka, I. Düntsch, and I. Németi. Binary relations and permutation groups. Math. Logic Quarterly, 41:197-216, 1995. MR1330855. [ bib | DOI | .html | .pdf ]
[115] H. Andréka, I. Düntsch, and I. Németi. Expressibility of properties of relations. Journal of Symbolic Logic, 60(3):970-991, 1995. MR1349005. [ bib | .html | .pdf ]
[116] I. Düntsch and G. Gediga. Rough set dependency analysis in evaluation studies: An application in the study of repeated heart attacks. Informatics Research Reports, 10:25-30, 1995. [ bib | .html | .pdf ]
[117] I. Düntsch and G. Gediga. Skills and knowledge structures. British Journal of Mathematical and Statistical Psychology, 48:9-27, 1995. [ bib | .html | .pdf ]
[118] I. Düntsch. On the maximal number of non C-endorigid equivalence relations. J. Pure Appl. Algebra, 105:261-266, 1995. MR1367871. [ bib | .html | .pdf ]
[119] I. Düntsch. Rough relation algebras. Fundamenta Informaticae, 21:321-331, 1994. MR1322578. [ bib ]
[120] I. Düntsch. A microcomputer based system for small relation algebras. J. Symb. Comput., 18:83-86, 1994. MR1300797. [ bib ]
[121] I. Düntsch. A note on cylindric lattices. In Algebraic Methods in Logic and Computer Science, pages 231-238. Banach Center Publications 28, Warsaw, 1993. MR1446286. [ bib ]
[122] H. Andréka, I. Düntsch, and I. Németi. A non permutational integral relation algebra. Michigan Math. J., 39:371-384, 1992. MR1182493. [ bib ]
[123] I. Düntsch and K. P. S. Bh. Rao. Complementation in the lattice of regular topologies. Southeast Asian Bull. Math., 15:163-172, 1991. MR1145438. [ bib ]
[124] I. Düntsch. Small integral relation algebras generated by a partial order. Period. Math. Hungar., 23:129-138, 1991. MR1142514. [ bib ]
[125] K. P. S. Bh. Rao and I. Düntsch. Generalized inverses with respect to general norms. Linear Algebra Appl., 133:33-42, 1990. [ bib ]
[126] I. Düntsch. Covers and complements in the subalgebra lattice of a Boolean algebra. Bull. Austral. Math. Soc., 40:371-379, 1989. MR1037631. [ bib ]
[127] I. Düntsch. The subalgebra lattice of a Boolean algebra. Southeast Asian Bull. Math., 13:73-81, 1989. MR1042736. [ bib ]
[128] I. Düntsch. Injective and projective regular double Stone algebras. Algebra Universalis, 24:197-203, 1987. MR0931612. [ bib ]
[129] I. Düntsch. Über Inhaltsketten und die Dichte abundanter Zahlen. Math. Phys. Korr., 142:10-21, 1986. [ bib ]
[130] I. Düntsch. Some properties of the lattice of subalgebras of a Boolean algebra. Bull. Austral. Math. Soc., 32:177-193, 1985. [ bib ]
[131] I. Düntsch. Finite projective regular double Stone algebras. Proc. Roy. Soc. Edinburgh Sect. A, 96:65-67, 1984. [ bib ]
[132] I. Düntsch and S. Koppelberg. Complements and quasicomplements in the lattice of subalgebras of P(ω). Discrete Math., 45:62-77, 1984. [ bib ]
[133] I. Düntsch. A description of the projective Stone algebras. Glasgow Math. J., 24:455-463, 1983. [ bib ]
[134] I. Düntsch. A note on atomic Stone algebras. Algebra Universalis, 16:398-399, 1983. [ bib ]
[135] I. Düntsch. On free or projective Stone algebras. Houston J. Math., 9:455-463, 1983. [ bib ]
[136] I. Düntsch. On a problem of Chen and Grätzer. Algebra Universalis, 14:401, 1982. [ bib ]
[137] I. Düntsch. Projectivity, prime ideals and chain conditions of Stone algebras. Algebra Universalis, 14:167-180, 1982. [ bib ]
[138] I. Düntsch. A class of projective Stone algebras. Bull. Austral. Math. Soc., 24:133-157, 1981. [ bib ]

This file was generated by bibtex2html 1.95.