idpub

[1]	Ivo Düntsch. Cylindric algebras and relational databases. In Cylindric-like algebras and algebraic logic. 2012. To appear. [ bib ]
[2]	Ivo Düntsch and Ewa 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. [ bib ]
[3]	Ivo Düntsch and Ewa Orlowska. Discrete dualities for double Stone algebras. Studia Logica, 99:127-142, 2011. [ bib ]
[4]	Ian Pratt-Hartmann and Ivo Düntsch. Functions Definable by Numerical Set-Expressions. Journal of Logic and Computation, 2011. [ bib \| DOI \| http ]
[5]	Ivo Düntsch and Günther 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 ]
[6]	Ivo Düntsch, Ewa Orlowska, and Ingrid Rewitzky. Structures with multirelations, their discrete dualities and applications. Fundam. Inform., 100:77-98, 2010. [ bib ]
[7]	Xian Yin, Ivo Düntsch, and Günther Gediga. Quadtree Representation and Compression of Spatial Data. Transactions on Rough Sets, 13:207-238, 2010. [ bib ]
[8]	Ivo Düntsch, Günther Gediga, and Adam 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 ]
[9]	Ivo Düntsch and Ian Pratt-Hartmann. Complex Algebras of Arithmetic. Fundam. Inform., 97(4):347-367, 2009. [ bib ]
[10]	Ivo Düntsch and Michael 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 ]
[11]	Ian Pratt-Hartmann and Ivo 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. [ bib ]
[12]	Xiang Yin, Ivo Düntsch, and Günther 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 ]
[13]	Ivo Düntsch and Günther 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 ]
[14]	Ivo Düntsch, Wendy McCaull, Dimiter Vakarelov, and Michael Winter. Distributive contact lattices: Topological representations. The Journal of Logic and Algebraic Programming, 76:18-34, 2008. [ bib ]
[15]	Ivo Düntsch and Ewa Orlowska. A discrete duality between apartness algebras and apartness frames. Journal of Applied Non-Classical Logics, 18:213-227, 2008. [ bib ]
[16]	Ivo Düntsch and Michael Winter. The lattice of contact relations on a Boolean algebra. In Rudolf Berghammer, Bernhard Möller, and Georg Struth, editors, Proceedings of the 10^th International Conference on Relational Methods in Computer Science and the 5^th International Workshop on Applications of Kleene Algebra, volume 4988 of Lecture Notes in Computer Science, pages 99-109. Springer Verlag, Heidelberg, 2008. [ bib ]
[17]	Ivo Düntsch and Michael 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 ]
[18]	Brandon Bennett and Ivo 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. [ bib \| .pdf ]
[19]	Ivo Düntsch, Günther Gediga, and Ewa Orlowska. Relational attribute systems II. Transactions on Rough Sets, 7:16-35, 2007. [ bib \| .pdf ]
[20]	Ivo Düntsch and Beata Konikowska. A multimodal logic for disagreement and exhaustiveness. Fundamenta Informaticae, 75:215-238, 2007. [ bib \| .pdf ]
[21]	Ivo Düntsch and Dimiter Vakarelov. Region-based theory of discrete spaces: A proximity approach. Annals of Mathematics and Artificial Intelligence, 49:5-14, 2007. [ bib \| .html \| .pdf ]
[22]	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 ]
[23]	Ivo Düntsch, Wendy McCaull, Dimiter Vakarelov, and Michael Winter. Topological representation of contact lattices. In Renate Schmidt, editor, Proceedings of the 9^th International Conference on Relational Methods in Computer Science and the 4^th International Workshop on Applications of Kleene Algebra, volume 4136 of Lecture Notes in Computer Science, pages 135-147. Springer-Verlag, Heidelberg, 2006. [ bib \| .pdf ]
[24]	Ivo Düntsch, Ewa Orlowska, and Anna 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 ]
[25]	Ivo Düntsch and Alasdair Urquhart. Betweenness and comparability obtained from binary relations. In Renate Schmidt, editor, Proceedings of the 9^th International Conference on Relational Methods in Computer Science and the 4^th International Workshop on Applications of Kleene Algebra, volume 4136 of Lecture Notes in Computer Science, pages 148-161. Springer-Verlag, Heidelberg, 2006. [ bib \| .html \| .pdf ]
[26]	Ivo Düntsch and Michael Winter. Rough relation algebras revisited. Fundamenta Informaticae, 74:283-300, 2006. [ bib \| .html \| .pdf ]
[27]	Hui Wang, Ivo Düntsch, Günther Gediga, and Gongde 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 ]
[28]	Ivo Düntsch. Relation algebras and their application in temporal and spatial reasoning. Artificial Intelligence Review, 23:315 - 357, 2005. [ bib \| .html \| .pdf ]
[29]	Ivo Düntsch and Michael Winter. Weak Contact Structures. In Wendy MacCaull, Michael Winter, and Ivo Düntsch, editors, Proceedings of the 8^th International Conference on Relational Methods in Computer Science and the 3^rd 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. [ bib \| .html \| .pdf ]
[30]	Ivo Düntsch and Michael Winter. A Representation Theorem for Boolean Contact Algebras. Theoretical Computer Science (B), 347:498-512, 2005. [ bib \| .html \| .pdf ]
[31]	Ewa Orlowska, Ingrid Rewitzky, and Ivo Düntsch. Relational semantics through duality. In Wendy MacCaull, Michael Winter, and Ivo Düntsch, editors, Proceedings of the 8^th International Conference on Relational Methods in Computer Science and the 3^rd 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. [ bib \| http \| .pdf ]
[32]	Wendy MacCaull, Michael Winter, and Ivo Düntsch, editors. Proceedings of the 8^th International Conference on Relational Methods in Computer Science and the 4^th 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 ]
[33]	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 ]
[34]	Ivo Düntsch and Ewa Orlowska. Boolean algebras arising from information systems. Annals of Pure and Applied Logic, 127:77-98, 2004. [ bib \| .pdf ]
[35]	Ivo Düntsch, Ewa Orlowska, Anna Radzikowska, and Dimiter Vakarelov. Relational Representation Theorems for Some Lattice-Based Structures. Journa of Relational Methods in Computer Science, 1:132-160, 2004. [ bib \| .pdf ]
[36]	Ivo Düntsch and Michael Winter. Construction of Boolean contact algebras. AI Communications, 13:235-246, 2004. [ bib \| .html \| .pdf ]
[37]	Ivo Düntsch and Michael Winter. Algebraization and representation of mereotopological structures. Journal of Relational Methods in Computer Science, 1:161-180, 2004. [ bib \| .pdf \| Abstract ]
[38]	Günther Gediga, Ivo Düntsch, and Jack 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 \| .html \| .pdf ]
[39]	Alex Muir, Ivo Düntsch, and Günther Gediga. Rough set data representation using binary decision diagrams. Revista Real Academia de Ciencias, Serie A, 98:197-213, 2004. [ bib \| .pdf \| Abstract ]
[40]	Hui Wang, Ivo Düntsch, Günther Gediga, and Andrzej Skowron. Hyperrelations in version space. International Journal of Approximate Reasoning, 36:223-241, 2004. [ bib \| .html \| .pdf ]
[41]	Ivo Düntsch and Günther 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 \| .html \| .pdf ]
[42]	Ivo Düntsch and Günther 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 ]
[43]	Ivo Düntsch and Günther Gediga. Maximum consistency of incomplete data via non-invasive imputation. Artificial Intelligence Review, 19:93-107, 2003. [ bib \| .html \| .pdf ]
[44]	Ivo Düntsch, Ewa Orlowska, and Anna 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 ]
[45]	Hui Wang, David Bell, and Ivo 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 ]
[46]	Ivo Düntsch and Günther 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 ]
[47]	Ivo Düntsch and Günther Gediga. Approximation quality for sorting rules. Computational Statistics and Data Analysis, 40:499-526, 2002. [ bib \| .html \| .pdf ]
[48]	Ivo Düntsch and Marc 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. [ bib ]
[49]	Günther Gediga and Ivo Düntsch. Skill set analysis in knowledge structures. British Journal of Mathematical and Statistical Psychology, 55:361-384, 2002. [ bib \| .html \| .pdf ]
[50]	Günther Gediga, Kai-Christoph Hamborg, and Ivo 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 ]
[51]	Dimiter Vakarelov, Georgi Dimov, Ivo Düntsch, and Brandon Bennett. A proximity approach to some region-based theories of space. J. Appl. Non-Classical Logics, 12:527-529, 2002. [ bib \| .html \| .pdf ]
[52]	Hui Wang, Ivo Düntsch, Günther Gediga, and Andrzej 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 ]
[53]	Ivo 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. [ bib \| .html \| .pdf ]
[54]	Ivo Düntsch and Günther Gediga. A note on the correspondences among entail relations, rough set dependencies, and logical consequence. Journal of Mathematical Psychology, 45:393 - 401, 2001. [ bib \| .html \| .pdf ]
[55]	Ivo Düntsch and Günther Gediga. Roughian - Rough Information Analysis. International Journal of Intelligent Systems, 46:121-147, 2001. [ bib \| .html \| .pdf ]
[56]	Ivo Düntsch, Günther Gediga, and Ewa Orlowska. Relational attribute systems. International Journal of Human Computer Studies, 55(3):293-309, 2001. [ bib \| .pdf ]
[57]	Ivo Düntsch and Szabolcs Mikulás. Cylindric structures and dependencies in relational databases. Theoretical Computer Science, 269:451-468, 2001. [ bib \| .html \| .pdf ]
[58]	Ivo Düntsch and Ewa 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. [ bib \| .html \| .pdf ]
[59]	Ivo Düntsch, Ewa Orlowska, and Hui Wang. Algebras of approximating regions. Fundamenta Informaticae, 46:71-82, 2001. [ bib \| .html \| .pdf ]
[60]	Ivo Düntsch, Gunther Schmidt, and Michael Winter. A necessary relation algebra for mereotopology. Studia Logica, 69:381-409, 2001. [ bib \| .html \| .pdf ]
[61]	Ivo Düntsch, Hui Wang, and Steve McCloskey. A relation algebraic approach to the Region Connection Calculus. Theoretical Computer Science, 255:63-83, 2001. [ bib \| .pdf ]
[62]	Günther Gediga and Ivo Düntsch. Rough approximation quality revisited. Artificial Intelligence, 132:219-234, 2001. [ bib \| .pdf ]
[63]	Dimiter Vakarelov, Ivo Düntsch, and Brandon 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. [ bib \| .html \| .pdf ]
[64]	Hui Wang, Ivo Düntsch, David Bell, and Dayou 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 ]
[65]	Ivo Düntsch and Günther 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. [ bib ]
[66]	Ivo Düntsch and Günther Gediga. Rough set data analysis: A road to non-invasive knowledge discovery. Methodos Publishers (UK), Bangor, 2000. [ bib \| .pdf ]
[67]	Ivo Düntsch and Günther Gediga. Rough set data analysis. In Encyclopedia of Computer Science and Technology, volume 43, pages 281-301. Marcel Dekker, 2000. [ bib \| .html \| .pdf ]
[68]	Ivo Düntsch and Günther Gediga. Sets, relations, functions. Methodos Publishers (UK), Bangor, 2000. [ bib \| http \| .pdf ]
[69]	Ivo Düntsch, Günther Gediga, and Son Nguyen. Rough sets in the KDD process. In Proc. of IPMU 2000, pages 220-226, 2000. [ bib \| .html \| .pdf ]
[70]	Ivo Düntsch and Beata Konikowska. A multimodal logic for reasoning about complementarity. J. Appl. Non-Classical Logics, 10(3):273-301, 2000. [ bib \| .html \| .pdf ]
[71]	Ivo Düntsch, Wendy McCaull, and Ewa 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. [ bib \| .html \| .pdf ]
[72]	Ivo Düntsch and Ewa Orlowska. A proof system for contact relation algebras. Journal of Philosophical Logic, 29:241-262, 2000. [ bib \| .html \| .pdf ]
[73]	Ivo Düntsch and Ewa Orlowska. Logics of complementarity in information systems. Mathematical Logic Quarterly, 46(4):267-288, 2000. [ bib \| .html \| .pdf ]
[74]	Ivo Düntsch, Hui Wang, and Steve McCloskey. Relation algebras in qualitative spatial reasoning. Fundamenta Informaticae, pages 229-248, 2000. [ bib \| .html \| .pdf ]
[75]	Günther Gediga and Ivo 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. [ bib \| .html \| .pdf ]
[76]	Günther Gediga, Kai-Christoph Hamborg, and Ivo Düntsch. The IsoMetrics usability inventory: An operationalisation of ISO 9241/10. Behaviour and Information Technology, 18:151-164, 2000. [ bib \| .html \| .pdf ]
[77]	Hui Wang, Ivo Düntsch, and Günther Gediga. Classificatory Filtering in Decision Systems. International Journal of Approximate Reasoning, 23:111-136, 2000. [ bib \| .html \| .pdf ]
[78]	Ivo Düntsch and Ewa Orlowska. Mixing modal and sufficiency operators. Bulletin of the Section of Logic, Polish Academy of Sciences, 28(2):99-106, 1999. [ bib ]
[79]	Hui Wang, Werner Dubitzky, Ivo Düntsch, and David 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 ]
[80]	Ciarán Browne, Ivo Düntsch, and Günther 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 ]
[81]	Ivo Düntsch and Günther 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 ]
[82]	Ivo Düntsch and Günther 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. 1998. [ bib ]
[83]	Ivo Düntsch and Günther Gediga. Grobian. In Lech Polkowski and Andrzej Skowron, editors, Rough sets in knowledge discovery, Vol. 2, pages 555-557. Physica-Verlag, 1998. [ bib ]
[84]	Ivo Düntsch and Günther 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 ]
[85]	Ivo Düntsch and Günther Gediga. Simple Data Filtering in Rough Set Systems. International Journal of Approximate Reasoning, 18(1-2):93-106, 1998. [ bib \| .html \| .pdf ]
[86]	Ivo Düntsch and Günther Gediga. Uncertainty measures of rough set prediction. Artificial Intelligence, 106:77-107, 1998. [ bib \| .html \| .pdf ]
[87]	Ivo Düntsch, Hui Wang, and Steve 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 ]
[88]	Günther Gediga and Ivo 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. 1998. [ bib ]
[89]	Hui Wang, Ivo Düntsch, and David 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 ]
[90]	Ivo Düntsch. Rough sets and algebras of relations. In Ewa Orlowska, editor, Incomplete Information - Rough Set Analysis, pages 95-108. Physica - Verlag, 1997. [ bib \| .html \| .pdf ]
[91]	Ivo Düntsch. A logic for rough sets. Theoretical Computer Science, 179(1-2):427-436, 1997. [ bib \| .html \| .pdf ]
[92]	Ivo Düntsch and Günther 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 ]
[93]	Ivo Düntsch and Günther 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 ]
[94]	Ivo Düntsch and Günther Gediga. Algebraic Aspects of Attribute Dependencies in Information Systems. Fundamenta Informaticae, 29:119-133, 1997. [ bib \| .html \| .pdf ]
[95]	Ivo Düntsch and Günther Gediga. Non-invasive data analysis. In Proc. 8^th Ireland Conference on Artificial Intelligence, Derry, (1997), pages 24-31, 1997. [ bib ]
[96]	Ivo Düntsch and Günther Gediga. Statistical Evaluation of Rough Set Dependency Analysis. International Journal of Human-Computer Studies, 46:589-604, 1997. [ bib \| .html \| .pdf ]
[97]	Ivo Düntsch and Günther Gediga. On query procedures to build knowledge structures. Journal of Mathematical Psychology, 40(2):160-168, 1996. [ bib \| .html \| .pdf ]
[98]	Hajnal Andréka, Ivo Düntsch, and István Németi. Binary relations and permutation groups. Math. Logic Quarterly, 41:197-216, 1995. [ bib \| .html \| .pdf ]
[99]	Hajnal Andréka, Ivo Düntsch, and István Németi. Expressibility of properties of relations. Journal of Symbolic Logic, 60(3):970-991, 1995. [ bib \| .html \| .pdf ]
[100]	Ivo Düntsch. On the maximal number of non C-endorigid equivalence relations. J. Pure Appl. Algebra, 105:261-266, 1995. [ bib \| .html \| .pdf ]
[101]	Ivo Düntsch and Günther 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 ]
[102]	Ivo Düntsch and Günther Gediga. Skills and knowledge structures. British Journal of Mathematical and Statistical Psychology, 48:9-27, 1995. [ bib \| .html \| .pdf ]
[103]	Ivo Düntsch. A microcomputer based system for small relation algebras. J. Symb. Comput., 18:83-86, 1994. [ bib ]
[104]	Ivo Düntsch. Rough relation algebras. Fundamenta Informaticae, 21:321-331, 1994. [ bib ]
[105]	Ivo Düntsch. A note on cylindric lattices. In Algebraic Methods in Logic and Computer Science, pages 231-238. Banach Center Publications 28, Warsaw, 1993. [ bib ]
[106]	Hajnal Andréka, Ivo Düntsch, and István Németi. A non permutational integral relation algebra. Michigan Math. J., 39:371-384, 1992. [ bib ]
[107]	Ivo Düntsch. Small integral relation algebras generated by a partial order. Period. Math. Hungar., 23:129-138, 1991. [ bib ]
[108]	Ivo Düntsch and K. P. S. Bhaskara Rao. Complementation in the lattice of regular topologies. Southeast Asian Bull. Math., 15:163-172, 1991. [ bib ]
[109]	Ivo Düntsch and K. P. S. Bhaskara Rao. Minimum norm inverses of generalized norms. Linear Algebra Appl., 133:33-42, 1990. [ bib ]
[110]	Ivo Düntsch. Covers and complements in the subalgebra lattice of a Boolean algebra. Bull. Austral. Math. Soc., 40:371-379, 1989. [ bib ]
[111]	Ivo Düntsch. The subalgebra lattice of a Boolean algebra. Southeast Asian Bull. Math., 13:73-81, 1989. [ bib ]
[112]	Ivo Düntsch. Injective and projective regular double Stone algebras. Algebra Universalis, 24:197-203, 1987. [ bib ]
[113]	Ivo Düntsch. Über Inhaltsketten und die Dichte abundanter Zahlen. Math. Phys. Korr., 142:10-21, 1986. [ bib ]
[114]	Ivo Düntsch. Some properties of the lattice of subalgebras of a Boolean algebra. Bull. Austral. Math. Soc., 32:177-193, 1985. [ bib ]
[115]	Ivo Düntsch. Finite projective regular double Stone algebras. Proc. Roy. Soc. Edinburgh Sect. A, 96:65-67, 1984. [ bib ]
[116]	Ivo Düntsch and Sabine Koppelberg. Complements and quasicomplements in the lattice of subalgebras of P(ω). Discrete Math., 45:62-77, 1984. [ bib ]
[117]	Ivo Düntsch. A description of the projective Stone algebras. Glasgow Math. J., 24:455-463, 1983. [ bib ]
[118]	Ivo Düntsch. A note on atomic Stone algebras. Algebra Universalis, 16:398-399, 1983. [ bib ]
[119]	Ivo Düntsch. On free or projective Stone algebras. Houston J. Math., 9:455-463, 1983. [ bib ]
[120]	Ivo Düntsch. On a problem of Chen and Grätzer. Algebra Universalis, 14:401, 1982. [ bib ]
[121]	Ivo Düntsch. Projective, prime ideals and chain conditions of Stone algebras. Algebra Universalis, 14:167-180, 1982. [ bib ]
[122]	Ivo 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.