[1] I. Düntsch and W. Dzik. Closure algebras of depth two with extremal relations: Their frames, logics, and structural completeness. Journal of Multiple-Valued Logic and Soft Computing, 2024. Special Issue dedicated to Ivo G. Rosenberg, to appear. [ bib ]
[2] I. Düntsch and W. Dzik. The fork and its role in unification of closure algebras. Fundamenta Informaticae, 2024. To appear. [ bib | DOI ]
[3] I. Düntsch, R. Gruszczyński, and P. Menchón. A mixed logic with binary operators. Submitted for publication, 2024. [ bib ]
[4] I. Düntsch, G. Gediga, R. Gruszczyński, and P. Menchón. An operationalization of Gibson's affordances. Preprint, 2024. [ bib ]
[5] I. Düntsch, R. Gruszczyński, and P. Menchón. Betweenness algebras. Journal of Symbolic Logic, pages 1-25, 2023. Published online by Cambridge University Press, 15 November 2023. [ bib | DOI | http ]
[6] H. Wang, I. Düntsch, G. Guo, and S. A. & Khan. Special issue on small data analytics. Int. J. Mach. Learn. & Cyber., 2022. [ bib | DOI ]
[7] I. Düntsch, G. Gediga, and H. Wang. Measures and approximations using empirical structures. Granular Computing, 6:47-58, 2021. [ bib | DOI ]
[8] I. Düntsch and E. Mares, editors. Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, volume 22 of Outst. Contrib. Log. Springer Nature, 2021. MR4400965. [ bib ]
[9] I. Düntsch and W. Dzik. Ideal algebras: A generalization of monadic algebras. In Wedrówki poświecie symboli. Jezyk, matematyka, logika, chapter 1, pages 3-12. Wydawnictwo Rys, Poznań, 2021. A volume dedicated to Jerzy Pogonowski on the occasion of his seventieth birthday. [ bib ]
[10] I. Düntsch and E. Orlowska. Application of Urquhart's representation of lattices to some non-classical logics. In I. Düntsch and E. Mares, editors, Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, volume 22 of Outst. Contrib. Log., chapter 13, pages 347- 366. Springer Nature, 2021. MR4400978. [ bib ]
[11] I. Düntsch and W. Dzik. Ideal related algebras and their logics. J. Logic Comput., 31(8):2159-2188, 2021. MR4353474 . [ bib ]
[12] I. Düntsch, W. Dzik, and E. Orl owska. On the semilattice of modal operators and decompositions of the discriminator. In H. Andréka and I. Németi on unity of science-from computing to relativity theory through algebraic logic, volume 19 of Outst. Contrib. Log., pages 207-231. Springer Nature, Cham, 2021. MR4352975. [ bib | DOI | http ]
[13] I. Düntsch and E. Orl owska. Discrete dualities for groupoids. Rend. Istit. Mat. Univ. Trieste, 53:Art. No. 20, 19, 2021. MR4442776. [ bib | DOI | http ]
[14] I. Düntsch and W. Dzik. Ideal related algebras and their logics (Extended abstract). In M. Dastani, H. Dong, and L. van der Torre, editors, Proceedings of the 3rd International Conference on Logic and Argumentation (CLAR 2020), Lecture Notes in ComputerScience, pages 96-103, 2020. [ bib ]
[15] I. Düntsch and G. Gediga. Indices for rough set approximation and the application to confusion matrices. Internat. J. Approx. Reason., 118:155-172, 2020. MR4050815. [ bib | DOI | http ]
[16] I. Düntsch and G. Gediga. Confusion matrices and rough set data analysis. CoRR, abs/1902.01487, 2019. [ bib | arXiv ]
[17] T. Mihálydeák, F. Min, G. Wang, M. Banerjee, I. Düntsch, Z. Suraj, and D. Ciucci, editors. Rough Sets - International Joint Conference, IJCRS 2019, Debrecen, Hungary, June 17-21, 2019, Proceedings, volume 11499 of Lecture Notes in ComputerScience. Springer, 2019. [ bib ]
[18] I. Düntsch and E. Orl owska. A discrete representation of lattice frames. In Logic, rationality, and interaction, volume 11813 of Lecture Notes in Comput. Sci., pages 86-97. Springer, Berlin, 2019. MR4019594. [ bib | DOI | http ]
[19] I. Düntsch, G. Gediga, and H. Wang. Approximation by filter functions. In H.S. Nguyen, Q. Ha, T. Li, and M. Przybyla-Kasperek, editors, Rough Sets: International Joint Conference, IJCRS 2018, volume 11103 of LNAI, pages 243-256. Springer Verlag, 2018. [ bib ]
[20] I. Düntsch and G. Gediga. Guttman algebras and a model checking procedure for Guttman scales. In Ewa Orlowska on relational methods in logic and computer science, volume 17 of Outst. Contrib. Log., pages 355-370. Springer, Cham, 2018. MR3929609. [ bib ]
[21] A. Mani, G. Cattaneo, and I. Düntsch, editors. Algebraic Methods in General Rough Sets. Trends in Mathematics. Birkhäuser, Cham, 2018. MR3973494 . [ bib ]
[22] G. Dimov, E. Ivanova-Dimova, and I. Düntsch. On dimension and weight of a local contact algebra. Filomat, 32(15):5481-5500, 2018. MR3898590. [ bib | DOI | http ]
[23] I. Düntsch, E. Orl owska, and T. Tinchev. Mixed algebras and their logics. J. Appl. Non-Class. Log., 27(3-4):304-320, 2017. MR3779213. [ bib | DOI | http ]
[24] I. Düntsch, L. Kwuida, and E. Orl owska. A discrete representation for dicomplemented lattices. Fund. Inform., 156(3-4):281-295, 2017. MR3746012. [ bib | DOI | http ]
[25] I. Düntsch, E. Orl owska, and H. Wang. A relational logic for spatial contact based on rough set approximation. Fund. Inform., 148(1-2):191-206, 2016. MR3594999. [ bib | DOI | http ]
[26] 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, Chapman & Hall/CRC Handb. Mod. Stat. Methods, pages 575-591. CRC Press, Boca Raton, FL, 2016. MR3644728. [ bib ]
[27] I. Düntsch, E. Orl owska, and C. van Alten. Discrete dualities for n-potent MTL-algebras and 2-potent BL-algebras. Fuzzy Sets and Systems, 292:203-214, 2016. MR3471217. [ bib | DOI | http ]
[28] I. Düntsch and G. Gediga. PRE and variable precision models in rough set data analysis. Transactions in Rough Sets, 19:17-37, 2015. MR3618228. [ bib ]
[29] I. Düntsch and G. Gediga. Simplifying contextual structures. In Proceedings of the 6th International Conference on Pattern Recognition and Machine Intelligence, volume 9124 of Lecture Notes in ComputerScience, pages 23-32, Heidelberg, 2015. Springer Verlag. [ bib ]
[30] 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 ComputerScience, pages 33-47. Springer Verlag, Heidelberg, 2014. [ bib ]
[31] I. Düntsch and E. Orl owska. Discrete dualities for some algebras with relations. J. Log. Algebr. Methods Program., 83(2):169-179, 2014. MR3292915. [ bib | DOI | http ]
[32] I. Düntsch and E. Orlowska. Discrete duality for rough relation algebras. Fund. Inform., 127(1-4):35-47, 2013. [ bib ]
[33] I. Pratt-Hartmann and I. Düntsch. Functions definable by numerical set-expressions. J. Logic Comput., 23(4):873-895, 2013. [ bib ]
[34] H. Wang, I. Düntsch, and L. Trindade. Lattice machine classification based on contextual probability. Fund. Inform., 127(1-4):241-256, 2013. MR3134957. [ bib ]
[35] I. Düntsch and S. Li. On the homogeneous countable Boolean contact algebra. Log. Log. Philos., 22(2):213-251, 2013. MR3432639. [ bib | DOI | http ]
[36] I. Düntsch and G. Gediga. Weighted λ precision models in rough set data analysis. In Proceedings of the Federated Conference on ComputerScience and Information Systems, Wroclaw, Poland, pages 309-316. IEEE, 2012. [ bib ]
[37] 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 ]
[38] I. Düntsch and S. Li. Extension properties of Boolean contact algebras. In Relational and algebraic methods in computer science, volume 7560 of Lecture Notes in Comput.Sci., pages 342-356. Springer, Heidelberg, 2012. MR3040176. [ bib ]
[39] 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 Bolyai Soc. Math. Stud., pages 321-331. János Bolyai Math. Soc., Budapest, 2012. MR3156406 . [ bib ]
[40] S. Koppelberg, I. Düntsch, and M. Winter. Remarks on contact relations on Boolean algebras. Algebra Universalis, 68(3-4):353-366, 2012. MR3029961. [ bib ]
[41] X. Yin, I. Düntsch, and G. Gediga. Quadtree Representation and Compression of Spatial Data. Transactions on Rough Sets, 13:207-238, 2011. [ bib ]
[42] I. Düntsch and E. Orl owska. Discrete dualities for double Stone algebras. Studia Logica, 99(1-3):127-142, 2011. MR2836437. [ bib ]
[43] I. Düntsch and E. Orl owska. An algebraic approach to preference relations. In Relational and algebraic methods in computer science, volume 6663 of Lecture Notes in Comput. Sci., pages 141-147. Springer, Heidelberg, 2011. MR2913845. [ bib | DOI | http ]
[44] I. Düntsch and G. Gediga. A Fast Randomisation Test for Rule Significance. In M. Szczuka, M. Kryszkiewicz, S. Ramanna, R. Jensen, and Q. Hu, editors, Rough Sets and Current Trends in Computing, 7th International Conference, RSCTC 2010, volume 6086 of Lecture Notes in ComputerScience, pages 386-391. Springer Verlag, 2010. [ bib ]
[45] I. Düntsch, E. Orl owska, and I. Rewitzky. Structures with multirelations, their discrete dualities and applications. Fund. Inform., 100(1-4):77-98, 2010. MR2741937. [ bib ]
[46] 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 ]
[47] I. Düntsch, G. Gediga, and A. Lenarcic. Affordance relations. In H. Sakai, M. K. Chakraborty, A. E. Hassanien, D. Ślezak, and W. 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 ]
[48] I. Düntsch and I. Pratt-Hartmann. Complex algebras of arithmetic. Fund. Inform., 97(4):347-367, 2009. [ bib ]
[49] I. Düntsch and M. Winter. Timed contact algebras. In C. Lutz and J. 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 ]
[50] I. Pratt-Hartmann and I. Düntsch. Functions definable by arithmetic circuits. In Mathematical theory and computational practice, volume 5635 of Lecture Notes in Comput. Sci., pages 409-418. Springer, Berlin, 2009. MR2545915. [ bib | DOI | http ]
[51] I. Düntsch and G. Gediga. Probabilistic granule analysis. In C. Chan, J.W. Grzymala-Busse, and W.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 ComputerScience, pages 223-231, Heidelberg, 2008. Springer Verlag. [ bib ]
[52] I. Düntsch, W. MacCaull, D. Vakarelov, and M. Winter. Distributive contact lattices: topological representations. J. Log. Algebr. Program., 76(1):18-34, 2008. [ bib ]
[53] I. Düntsch and E. Orlowska. A discrete duality between apartness algebras and apartness frames. J. Appl. Non-Classical Logics, 18(2-3):213-227, 2008. [ bib ]
[54] I. Düntsch and M. Winter. Moving spaces. In S. Demri and C.S. Jensen, editors, Proceedings of the 15th International Symposium on Temporal representation and Reasoning (TIME 2008), pages 59-63. IEEE Computer Society, 2008. [ bib ]
[55] I. Düntsch and M. Winter. The lattice of contact relations on a Boolean algebra. In Relations and Kleene algebra in computer science, volume 4988 of Lecture Notes in Comput. Sci., pages 99-109. Springer, Berlin, 2008. MR2497622. [ bib | DOI | http ]
[56] B. Bennett and I. Düntsch. Axioms, algebras and topology. In March Aiello, Johan van Benthem, and Ian Pratt-Hartmann, editors, Handbook of spatial logics, pages 99-159. Springer, Dordrecht, 2007. MR2393887. [ bib ]
[57] I. Düntsch, G. Gediga, and E. Orlowska. Relational attribute systems II. Transactions on Rough Sets, 7:16-35, 2007. MR2397127. [ bib ]
[58] I. Düntsch and B. Konikowska. A multi-modal logic for disagreement and exhaustiveness. Fund. Inform., 75(1-4):215-238, 2007. MR2293697. [ bib ]
[59] I. Düntsch and D. Vakarelov. Region-based theory of discrete spaces: A proximity approach. Ann. Math. Artif. Intell., 49(1-4):5-14, 2007. MR2348380. [ bib ]
[60] J.F. Peters, A. Skworon, I. Düntsch, J. Grzymala-Busse, E. Orlowska, and L. Polkowski, editors. Transactions on Rough Sets VI - Commemorating the Life and Work of Zdislaw Pawlak, Part I, volume 4374 of Lecture Notes in ComputerScience, Heidelberg, 2007. Springer Verlag. [ bib ]
[61] I. Düntsch and M. Winter. Rough relation algebras revisited. Fund. Inform., 74(2-3):283-300, 2006. MR2284196. [ bib ]
[62] I. Düntsch, E. Orlowska, and A. Radzikowska. Lattice-based relation algebras and their representability II. In H. de Swart, E. Orlowska, G. Schmidt, and M. 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 ]
[63] W. MacCaull, M. Winter, and I. Düntsch, editors. Relational methods in computer science, volume 3929 of Lecture Notes in ComputerScience. Springer-Verlag, Berlin, 2006. Selected revised papers from the 8th International Seminar on Relational Methods in ComputerScience, the 3rd International Workshop on Applications of Kleene Algebra and the Workshop of COST Action 274: TARSKI, held in St. Catharines, ON, February 22-26, 2005. [ bib ]
[64] H. Wang, I. Düntsch, G. Gediga, and G. Guo. Nearest Neighbours without k. In B. Dunin-Keplicz, A. Jankowski, A. Skowron, and M. Szczuka, editors, Monitoring, Security, and Rescue Techniques in Multiagent Systems, Advances in Soft Computing, chapter 12, pages 179-189. Springer Verlag, Heidelberg, 2006. [ bib ]
[65] I. Düntsch and A. Urquhart. Betweenness and comparability obtained from binary relations. In Relations and Kleene algebra in computer science, volume 4136 of Lecture Notes in Comput. Sci., pages 148-161. Springer, Berlin, 2006. MR2281598. [ bib | DOI | http ]
[66] I. Düntsch and M. Winter. A representation theorem for Boolean contact algebras. Theoret. Comput.Sci., 347(3):498-512, 2005. MR2187916. [ bib ]
[67] I. Düntsch and M. Winter. Weak Contact Structures. In W. MacCaull, M. Winter, and I. 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 ComputerScience, pages 73-82, Heidelberg, 2005. Springer-Verlag. MR2251975. [ bib ]
[68] I. Düntsch. Relation algebras and their application in temporal and spatial reasoning. Artificial Intelligence Review, 23:315-357, 2005. [ bib ]
[69] D. Ślezak, M. Wang, G.and Szczuka, I. Düntsch, and Y. 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 ]
[70] E. Orlowska, I. Rewitzky, and I. Düntsch. Relational semantics through duality. In W. MacCaull, M. Winter, and I. 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 ComputerScience, pages 17-32, Heidelberg, 2005. Springer-Verlag. MR2251971. [ bib | http ]
[71] I. Düntsch and E. Orlowska. Boolean algebras arising from information systems. Ann. Pure Appl. Logic, 127(1-3):77-98, 2004. MR2071169. [ bib ]
[72] I. Düntsch and M. Winter. Construction of Boolean contact algebras. AI Commun., 17(4):235-246, 2004. MR2120219. [ bib ]
[73] G. Gediga, I. Düntsch, and J. Adams-Webber. On the direct scaling approach of eliciting aggregated fuzzy information: The psychophysical view. In S. Dick, L. Kurgan, P. Musilek, W. Pedrycz, and M. Reformat, editors, Proceedings the 2004 Annual Meeting of the North American Fuzzy Information Processing Society, pages 948-953, 2004. [ bib ]
[74] H. Wang, I. Düntsch, G. Gediga, and A. Skowron. Hyperrelations in version space. Internat. J. Approx. Reason., 36(3):223-241, 2004. MR2062628. [ bib ]
[75] A. Muir, I. Düntsch, and G. Gediga. Rough set data representation using binary decision diagrams. RACSAM. Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat., 98(1-2):197-211, 2004. MR2136167. [ bib ]
[76] I. Düntsch, E. Orlowska, A. Radzikowska, and D. Vakarelov. Relational representation theorems for some lattice-based structures. Journal of Relational Methods in ComputerScience, 1:132-160, 2004. [ bib ]
[77] I. Düntsch and M. Winter. Algebraization and representation of mereotopological structures. Journal of Relational Methods in ComputerScience, 1:161-180, 2004. [ bib | Abstract ]
[78] 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 ComputerScience, pages 214-230. Springer-Verlag, Heidelberg, 2003. [ bib ]
[79] G. Gediga and I. Düntsch. 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 ]
[80] G. Gediga and I. Düntsch. Maximum consistency of incomplete data via non-invasive imputation. Artificial Intelligence Review, 19:93-107, 2003. [ bib ]
[81] I. Düntsch, E. Orlowska, and A. Radzikowska. Lattice-based relation algebras and their representability. In H. de Swart, E. Orlowska, G. Schmidt, and M. Roubens, editors, Theory and Application of Relational Structures as Knowledge Instruments, volume 2929 of Lecture Notes in ComputerScience, pages 231-255. Springer-Verlag, Heidelberg, 2003. [ bib ]
[82] 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 ]
[83] 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 ]
[84] I. Düntsch and M. Roubens. Tangent circle algebras. In Relational methods in computer science, volume 2561 of Lecture Notes in Comput.Sci., pages 300-313. Springer, Berlin, 2002. [ bib ]
[85] G. Gediga and I. Düntsch. Skill set analysis in knowledge structures. British J. Math. Statist. Psych., 55(2):361-384, 2002. MR1949262. [ bib ]
[86] G. Gediga and I. Düntsch. Approximation quality for sorting rules. Comput. Statist. Data Anal., 40(3):499-526, 2002. MR1926613. [ bib ]
[87] 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 InformationScience (2002), 166-192. [ bib | .html ]
[88] 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(3-4):527-559, 2002. Spatial logics. [ bib ]
[89] 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 ]
[90] G. Gediga, K.-Ch. Hamborg, and I. Düntsch. Evaluation of software systems. In A. Kent, editor, Encyclopedia of Library and InformationScience, volume 72, pages 166-192. Marcel Dekker, New York, 2002. Also appeared in volume 72 of the Encyclopedia of Library and InformationScience (2002), 166-192. [ bib | .html ]
[91] I. Düntsch and G. Gediga. A note on the correspondence among entail relations, rough set dependencies, and logical consequence. J. Math. Psych., 45(2):393-401, 2001. [ bib ]
[92] I. Düntsch and G. Gediga. Roughian - Rough Information Analysis. International Journal of Intelligent Systems, 46:121-147, 2001. [ bib | .html ]
[93] I. Düntsch, G. Gediga, and E. Orlowska. Relational attribute systems. International Journal of Human Computer Studies, 55(3):293-309, 2001. [ bib ]
[94] I. Düntsch and S. Mikulás. Cylindric structures and dependencies in relational databases. Theoret. Comput.Sci., 269(1-2):451-468, 2001. [ bib ]
[95] I. Düntsch, E. Orlowska, and H. Wang. Algebras of approximating regions. Fund. Inform., 46(1-2):71-82, 2001. Special issue on qualitative spatial reasoning. [ bib ]
[96] I. Düntsch, G. Schmidt, and M. Winter. A necessary relation algebra for mereotopology. Studia Logica, 69(3):381-409, 2001. [ bib ]
[97] I. Düntsch, H. Wang, and S. McCloskey. A relation-algebraic approach to the region connection calculus. Theoret. Comput.Sci., 255(1-2):63-83, 2001. [ bib ]
[98] G. Gediga and I. Düntsch. Rough approximation quality revisited. Artificial Intelligence, 132:219-234, 2001. [ bib ]
[99] I. Düntsch. Contact relation algebras. In Relational methods for computer science applications, volume 65 of Stud. Fuzziness Soft Comput., pages 113-133. Physica, Heidelberg, 2001. [ bib ]
[100] 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 ]
[101] 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 ]
[102] I. Düntsch and E. Orl owska. Beyond modalities: Sufficiency and mixed algebras. In Relational methods for computer science applications, volume 65 of Stud. Fuzziness Soft Comput., pages 263-285. Physica, Heidelberg, 2001. MR1858531. [ bib | DOI | http ]
[103] I. Düntsch and B. Konikowska. A multimodal logic for reasoning about complementarity. J. Appl. Non-Classical Logics, 10(3-4):273-301, 2000. [ bib ]
[104] I. Düntsch and G. Gediga. Logical and algebraic techniques for rough set data analysis. In L. Polkowski, S. Tsumoto, and T.Y Lin, editors, Rough set methods and applications, volume 56 of Stud. Fuzziness Soft Comput., pages 521-544. Physica, Heidelberg, 2000. MR1858667. [ bib ]
[105] I. Düntsch and G. Gediga. Rough set data analysis: A road to non-invasive knowledge discovery. Methoδos (UK), Bangor, 2000. [ bib ]
[106] 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 ]
[107] I. Düntsch and G. Gediga. Sets, relations, functions. Methodos Publishers (UK), Bangor, 2000. [ bib | .pdf ]
[108] 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 ]
[109] I. Düntsch, W. MacCaull, and E. Orlowska. Structures with many-valued information and their relational proof theory. In 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000) (Portland, OR), pages 293-301. IEEE Computer Soc., Los Alamitos, CA, 2000. [ bib ]
[110] I. Düntsch and E. Orlowska. Logics of complementarity in information systems. MLQ Math. Log. Q., 46(2):267-288, 2000. [ bib ]
[111] I. Düntsch and E. Orlowska. A proof system for contact relation algebras. J. Philos. Logic, 29(3):241-262, 2000. [ bib ]
[112] 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 ComputerScience, January 9-14, 2000, Valcartier (Quebec), Canada, pages 65-74, 2000. [ bib ]
[113] G. Gediga and I. Düntsch. Statistical techniques for rough set data analysis. In Rough set methods and applications, volume 56 of Stud. Fuzziness Soft Comput., pages 545-565. Physica, Heidelberg, 2000. MR1858668. [ bib ]
[114] 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 ]
[115] H. Wang, I. Düntsch, and G. Gediga. Classificatory filtering in decision systems. Internat. J. Approx. Reason., 23(2):111-136, 2000. [ bib ]
[116] I. Düntsch and E. Orlowska. Mixing modal and sufficiency operators. Bull. Sect. Logic Univ. LódŹ, 28(2):99-106, 1999. MR1740612. [ bib ]
[117] I. Düntsch, H. Wang, and S. McCloskey. Relations algebras in qualitative spatial reasoning. Fund. Inform., 39(3):229-248, 1999. [ bib ]
[118] H. Wang, W. Dubitzky, I. Düntsch, and D. Bell. A Lattice Machine Approach to Automated Casebase Design: Marrying Lazy and Eager Learning. In D. 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 ]
[119] 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 ]
[120] I. Düntsch and G. Gediga. Simple data filtering in rough set systems. Internat. J. Approx. Reason., 18(1-2):93-106, 1998. MR1657478. [ bib ]
[121] 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 ]
[122] 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 ]
[123] I. Düntsch and G. Gediga. Logical tools for rule based data analysis. In Jan Komorowski, I. Düntsch, and Andrzej Skowron, editors, Workshop on Synthesis of Intelligent Agent Systems from Experimental Data, ECAI'98. IOS Press, 1998. [ bib ]
[124] 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 ]
[125] I. Düntsch and G. Gediga. Uncertainty measures of rough set prediction. Artificial Intelligence, 106(1):109-137, 1998. MR1670304. [ bib ]
[126] I. Düntsch, H. Wang, and S. McCloskey. Relation algebras in spatial reasoning. In E. Orlowska and A. Szalas, editors, Extended Abstracts of the 4th Seminar on Relational Methods in Algebra, Logic, and Computer Science, pages 63-68, 1998. [ bib ]
[127] G. Gediga and I. Düntsch. Statistical tools for rule based data analysis. In J. Komorowski, I. Düntsch, and A. Skowron, editors, Workshop on Synthesis of Intelligent Agent Systems from Experimental Data, ECAI'98. IOS Press, 1998. [ bib ]
[128] H. Wang, I. Düntsch, and D. Bell. Data reduction based on hyper relations. In R. Agrawal, P. Stolorz, and G. Piatetsky-Shapiro, editors, Proceedings of KDD'98, pages 349-353, New York, 1998. [ bib ]
[129] I. Düntsch and G. Gediga. Algebraic aspects of attribute dependencies in information systems. Fund. Inform., 29(1-2):119-133, 1997. MR1475089. [ bib ]
[130] 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 ]
[131] 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 ]
[132] 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 ]
[133] 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 ]
[134] I. Düntsch and G. Gediga. Roughian - Rough Information Analysis (Extended abstract). In A. Sydow, editor, Proc. 15th IMACS World Congress, volume 4, pages 631-636, Berlin, 1997. Wissenschaft und Technik Verlag. [ bib ]
[135] I. Düntsch. Rough sets and algebras of relations. In E. Orlowska, editor, Incomplete Information - Rough Set Analysis, pages 95-108. Physica - Verlag, 1997. MR1647376. [ bib | .html ]
[136] I. Düntsch. A logic for rough sets. Theoret. Comput.Sci., 179(1-2):427-436, 1997. MR1454599. [ bib ]
[137] I. Düntsch and G. Gediga. On query procedures to build knowledge structures. J. Math. Psych., 40(2):160-168, 1996. MR1398596. [ bib ]
[138] H. Andréka, I. Düntsch, and I. Németi. Binary relations and permutation groups. Math. Logic Quart., 41(2):197-216, 1995. MR1330855. [ bib ]
[139] H. Andréka, I. Düntsch, and I. Németi. Expressibility of properties of relations. J. Symbolic Logic, 60(3):970-991, 1995. MR1349005. [ bib ]
[140] 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 ]
[141] I. Düntsch and G. Gediga. Skills and knowledge structures. British Journal of Mathematical and Statistical Psychology, 48:9-27, 1995. [ bib | .html ]
[142] I. Düntsch. On the maximal number of non-C-endorigid equivalence relations. J. Pure Appl. Algebra, 105(3):261-266, 1995. MR1367871. [ bib ]
[143] I. Düntsch. Rough relation algebras. Fund. Inform., 21(4):321-331, 1994. MR1322578. [ bib ]
[144] I. Düntsch. A microcomputer based system for small relation algebras. J. Symbolic Comput., 18(1):83-86, 1994. MR1300797. [ bib ]
[145] I. Düntsch. A note on cylindric lattices. In Algebraic methods in logic and in computer science (Warsaw, 1991), volume 28 of Banach Center Publ., pages 231-238. Polish Acad.Sci. Inst. Math., Warsaw, 1993. MR1446286. [ bib ]
[146] H. Andréka, I. Düntsch, and I. Németi. A nonpermutational integral relation algebra. Michigan Math. J., 39(3):371-384, 1992. MR1182493. [ bib ]
[147] K. P. S. Bhaskara Rao and I. Düntsch. Complementation in the lattice of regular topologies. Southeast Asian Bull. Math., 15(2):163-172, 1991. MR1145438. [ bib ]
[148] I. Düntsch. Small integral relation algebras generated by a partial order. Period. Math. Hungar., 23(2):129-138, 1991. MR1142514. [ bib ]
[149] K. P. S. Bh. Rao and I. Düntsch. Generalized inverses with respect to general norms. Linear Algebra Appl., 133:33-42, 1990. MR1058104. [ bib ]
[150] I. Düntsch. Covers and complements in the subalgebra lattice of a Boolean algebra. Bull. Austral. Math. Soc., 40(3):371-379, 1989. MR1037631. [ bib ]
[151] I. Düntsch. The subalgebra lattice of a Boolean algebra. Southeast Asian Bull. Math., 13(2):73-81, 1989. MR1042736. [ bib ]
[152] I. Düntsch. Injective and projective regular double Stone algebras. Algebra Universalis, 24(3):197-203, 1987. MR931612. [ bib ]
[153] I. Düntsch. Über Inhaltsketten und die Dichte abundanter Zahlen. Math. Phys. Korr., 142:10-21, 1986. [ bib ]
[154] I. Düntsch. Some properties of the lattice of subalgebras of a Boolean algebra. Bull. Austral. Math. Soc., 32(2):177-193, 1985. MR815362. [ bib ]
[155] I. Düntsch and S. Koppelberg. Complements and quasicomplements in the lattice of subalgebras of P(ω). Discrete Math., 53:63-78, 1985. Special volume on ordered sets and their applications (L'Arbresle, 1982), MR786478. [ bib ]
[156] I. Düntsch. Finite projective double Stone algebras. Proc. Roy. Soc. Edinburgh Sect. A, 96(1-2):65-67, 1984. MR741646. [ bib ]
[157] I. Düntsch. A description of the projective Stone algebras. Glasgow Math. J., 24(1):75-82, 1983. MR685486. [ bib ]
[158] I. Düntsch. A note on atomic Stone algebras. Algebra Universalis, 16(3):398-399, 1983. [ bib ]
[159] I. Düntsch. On free or projective regular double Stone algebras. Houston J. Math., 9(4):455-463, 1983. MR732237. [ bib ]
[160] I. Düntsch. Projectivity, prime ideals, and chain conditions of Stone algebras. Algebra Universalis, 14(2):167-180, 1982. MR634996. [ bib ]
[161] I. Düntsch. On a problem of Chen and Grätzer. Algebra Universalis, 14(3):401, 1982. MR654407. [ bib ]
[162] I. Düntsch. A class of projective Stone algebras. Bull. Austral. Math. Soc., 24(1):133-147, 1981. MR630790. [ bib ]

This file was generated by bibtex2html 1.95.