Conference and Workshop Publications
| Show abstracts (where available) BibTeX entries | ||
| 2012 | ||
| [47] |
.
2012. Concept Learning for Description Logic-based Information Systems. In KSE 2012 - International Conference on Knowledge and Systems Engineering, pages 65–73. IEEE Computer Society. DOI: 10.1109/KSE.2012.23. |
|
| [46] |
.
2012. A Bisimulation-based Method of Concept Learning for Knowledge Bases in Description Logics. In SoICT 2012 - 3rd International Symposium on Information and Communication Technology, pages 241–249. ACM Press. DOI: 10.1145/2350716.2350753. |
|
| [45] |  |
.
2012. Temporal Composite Actions with Constraints. In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 478–488. |
| 2011 | ||
| [44] |
.
2011. Living with Inconsistency and Taming Nonmonotonicity. In O. de Moor, G. Gottlob, T. Furche, A. Sellers, editors, Datalog Reloaded, pages 334–398. In series: Lecture Notes in Computer Science #6702. Springer Berlin/Heidelberg. ISBN: 978-3-642-24205-2. DOI: 10.1007/978-3-642-24206-9_22. |
|
| [43] |
.
2011. WORL: A Web Ontology Rule Language. In Proceedings of the 3rd International Conference on Knowledge and Systems Engineering (KSE), pages 32–39. IEEE. ISBN: 978-1-4577-1848-9. DOI: 10.1109/KSE.2011.14. |
|
| [42] |
.
2011. Tractable model checking for fragments of higher-order coalition logic. In Liz Sonenberg, Peter Stone, Kagan Tumer, Pinar Yolum, editors, Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, pages 743–750. AAAI Press. ISBN: 978-0-9826571-6-4. |
|
| [41] |
.
2011. On the Web Ontology Rule Language OWL 2 RL. In Piotr Jedrzejowicz, Ngoc Thanh Nguyen and Kiem Hoang, editors, Proceedings of the 3rd International Conference on Computational Collective Intelligence, Technologies and Applications (ICCCI), pages 254–264. In series: Lecture Notes in Computer Science #6922. Springer Berlin/Heidelberg. ISBN: 978-3-642-23934-2. DOI: 10.1007/978-3-642-23935-9_25. |
|
| [40] | |
.
2011. Contextual Coalitional Games. In Mohua Banerjee, Anil Seth, editors, Proceedings of the 4th Indian Conference on Logic and its Applications (ICLA), pages 65–78. In series: Lecture Notes in Artificial Intelligence #6521. Springer Berlin/Heidelberg. DOI: 10.1007/978-3-642-18026-2_7. |
| 2010 | ||
| [39] |
.
2010. Graded Beliefs, Goals and Intentions. In Proceedings of the 3rd Workshop on Logical Aspects of Multi-Agent Systems (LAMAS), pages 1–15. AAAI Press. |
|
| [38] |
.
2010. Three-Valued Paraconsistent Reasoning for Semantic Web Agents. In Proceedings of the 4th International KES Symposium on Agents and Multi-agent Systems – Technologies and Applications (KES-AMSTA), pages 152–162. In series: Lecture Notes in Artificial Intelligence #6070. Springer. ISBN: 978-3-642-13479-1. DOI: 10.1007/978-3-642-13480-7_17. |
|
| [37] |
.
2010. On the Correctness of Rough-Set Based Approximate Reasoning. In M. Szczuka, M. Kryszkiewicz, S. Ramanna, R. Jensen, Q. Hu, editors, Proceedings of the 7th International Conference on Rough Sets and Current Trends in Computing (RSCTC), pages 327–336. In series: Lecture Notes in Computer Science #6086. Springer. ISBN: 978-3-642-13528-6. DOI: 10.1007/978-3-642-13529-3_35. |
|
| 2009 | ||
| [36] |
.
2009. Fusing Approximate Knowledge from Distributed Sources. In Proceedings of the 3rd International Symposium on Intelligent Distributed Computing (IDC), pages 75–86. In series: Studies in Computational Intelligence #237. Springer Berlin/Heidelberg. ISBN: 978-3-642-26930-1. DOI: 10.1007/978-3-642-03214-1_8. |
|
| [35] |
.
2009. Checking Consistency of an ABox w.r.t. Global Assumptions in PDL*. In Proceedings of the 18th Concurrency, Specification and Programming Workshop (CS&P), pages 431–442. |
|
| [34] |
.
2009. An Optimal Tableau Decision Procedure for Converse-PDL. In Proceedings of the 1st International Conference on Knowlegde and Systems Engineering (KSE), pages 207–214. IEEE Computer Society. ISBN: 978-1-4244-5086-2. DOI: 10.1109/KSE.2009.12. |
|
| [33] |
.
2009. EXPTIME Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC. In Ngoc Thanh; Kowalczyk, Ryszard; Chen, Shyi-Ming, editors, Proceedings of the 1st International Conference on Computational Collective Intelligence - Semantic Web, Social Networks & Multiagent Systems (ICCCI), pages 437–448. In series: Lecture Notes in Artificial Intelligence #5796. Springer. ISBN: 978-3-642-04440-3. DOI: 10.1007/978-3-642-04441-0_38. |
|
| [32] |
.
2009. A tableau calculus for regular grammar logics with converse. In Proceedings of the 22nd International Conference on Automated Deduction (CADE), pages 421–436. In series: Lecture Notes in Artificial Intelligence #5663. Springer. ISBN: 978-364202958-5. DOI: 10.1007/978-3-642-02959-2_31. |
|
| 2008 | ||
| [31] |
.
2008. Reasoning with Qualitative Preferences and Cardinalities Using Generalized Circumscription. In Gerhard Brewka, Jérôme Lang, editors, Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 560–570. AAAI Press. ISBN: 978-1-57735-384-3. |
|
| [30] | |
.
2008. Four-valued Extension of Rough Sets. In Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT), pages 106–114. In series: Lecture Notes in Computer Science #5009. Springer. ISBN: 978-3-540-79720-3. DOI: 10.1007/978-3-540-79721-0_19. |
| [29] | |
.
2008. Paraconsistent Logic Programs with Four-valued Rough Sets. In Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing (RSCTC). In series: Lecture Notes in Computer Science #5306. Springer. ISBN: 978-3-540-88423-1. DOI: 10.1007/978-3-540-88425-5_5. |
| 2007 | ||
| [28] |
.
2007. Towards Approximate BGI Systems. In Proceedings of the 5th International Central and Eastern European Conference on Multi-Agent Systems (CEEMAS), pages 277–287. In series: Lecture Notes in Artificial Intelligence #4696. Springer Berlin/Heidelberg. ISBN: 9783540752530. DOI: 10.1007/978-3-540-75254-7_28. |
|
| [27] |
.
2007. Dynamics of approximate information fusion. In Proceedings of the International Conference on Rough Sets and Emerging Intelligent Systems Paradigms (RSEISP), pages 668–677. In series: Lecture Notes in Artificial Intelligence #4585. Springer Berlin/Heidelberg. ISBN: 978-3-540-73450-5. DOI: 10.1007/978-3-540-73451-2_70. |
|
| 2006 | ||
| [26] | |
.
2006. On the fixpoint theory of equality and its applications. In Proceedings of the 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra (RelMiCS/AKA), pages 388–401. In series: Lecture Notes in Computer Science #4136. Springer. DOI: 10.1007/11828563_26. |
| [25] |
.
2006. Quantifier Elimination in Elementary Set Theory. In W. MacCaull, I. Duentsch, M. Winter, editors, Proceedings of the 8th International Conference on Relational Methods in Computer Science (RelMiCS), pages 237–248. In series: Lecture Notes in Computer Science #3929. Springer Berlin/Heidelberg. DOI: 10.1007/11734673_19. |
|
| 2005 | ||
| [24] | |
.
2005. Similarity, approximations and vagueness. In Dominik Slezak, Guoyin Wang, Marcin S. Szczuka, Ivo Düntsch, Yiyu Yao, editors, Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC), pages 541–550. In series: Lecture Notes in Artificial Intelligence #3641. Springer. ISBN: 3-540-28653-5. DOI: 10.1007/11548669_56. |
| [23] |
.
2005. A Technique for Learning Similarities on Complex Structures with Applications to Extracting Ontologies. In Proceedings of the 3rd Atlantic Web Intelligence Conference (AWIC), pages 991–995. In series: Lecture Notes in Computer Science #3528. Springer. DOI: 10.1007/11495772_29. |
|
| [22] | |
.
2005. An Experimental Platform for Approximate Databases. In 3rd joint SAIS-SSL event on Artificial Intelligence and Learning Systems,2005. |
| 2004 | ||
| [21] | |
.
2004. Towards a logical analysis of biochemical pathways. In José Júlio Alferes and João Alexandre Leite, editors, Proceedings of the 9th European Conference on Logics in Artificial Intelligence (JELIA), pages 667–679. In series: Lecture Notes in Computer Science #3229. Springer. ISBN: 978-3-540-23242-1. DOI: 10.1007/978-3-540-30227-8_55. |
| [20] | |
.
2004. Towards a Logical Analysis of Biochemical Reactions (Extended abstract). In Ramon López de Mántaras, Lorenza Saitta, editors, Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), pages 997–998. IOS Press. ISBN: 1-58603-452-9. |
| [19] | |
.
2004. Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities. In Proceedings of the 7th International Conference on Information Fusion, pages 175–182. ISIF. ISBN: 91-7056-115-X. |
| [18] | |
.
2004. On the Correspondence between Approximations and Similarity. In Shusaku Tsumoto, Roman Slowinski, Jan Komorowski and Jerzy W. Grzymala-Busse, editors, Proceedings of the International Conference on Rough Sets and Current Trends in Computing (RSCTC), pages 143–152. In series: Lecture Notes in Computer Science #3066. Springer. DOI: 10.1007/978-3-540-25929-9_16. |
| [17] | |
.
2004. Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. In Didier Dubois, Christopher A. Welty, Mary-Anne Williams, editors, Proceedings of the 9th International Conference on the Principles of Knowledge Representation and Reasoning, pages 459–468. AAAI Press. ISBN: 978-1-57735-199-3. |
| 2003 | ||
| [16] |
.
2003. On a logical approach to estimating computational complexity of potentially intractable problems. In G. Goos, J. Hartmanis, and J. van Leeuwen, editors, Proceedings of the 14th International Symposium on Fundamentals of Computation Theory (FCT), pages 423–431. In series: Lecture Notes in Computer Science #2751. Springer. DOI: 10.1007/978-3-540-45077-1_39. |
|
| [15] | |
.
2003. On mutual understanding among communicating agents. In B. Dunin-Keplicz and R. Verbrugge, editors, Proceedings of the International Workshop on Formal Approaches to Multi-Agent Systems (FAMAS), pages 83–97. |
| [14] | |
.
2003. Tolerance Spaces and Approximative Representational Structures. In Proceedings of the 26th German Conference on Artificial Intelligence (KI), pages 475–489. In series: Lecture Notes in Computer Science #2821. Springer. DOI: 10.1007/978-3-540-39451-8_35. |
| [13] |
.
2003. Information Granules for Intelligent Knowledge Structures. In Guoyin Wang, Qing Liu, Yiyu Yao, Andrzej Skowron, editors, Proceedings of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC), pages 405–412. In series: Lecture Notes in Computer Science #2639. Springer. ISBN: 978-3-540-14040-5. DOI: 10.1007/3-540-39205-X_68. |
|
| 2002 | ||
| [12] |
.
2002. Second-order quantifier elimination in modal contexts. In Sergio Flesca, Sergio Greco, Nicola Leone, Giovambattista Ianni, editors, Proceedings of the 8th European Conference on Logics in Artificial Intelligence (JELIA), pages 223–232. In series: Lecture Notes in Computer Science #2424. Springer. ISBN: 978-354044190-8. DOI: 10.1007/3-540-45757-7_19. |
|
| [11] | |
.
2002. CAKE: A computer aided knowledge engineering technique. In Frank van Harmelen, editor, Proceedings of the 15th European Conference on Artificial Intelligence,2002, pages 220–224. IOS Press. |
| 2001 | ||
| [10] | |
.
2001. Computing strongest necessary and weakest sufficient conditions of first-order formulas. In 17th International Joint Conference on Artificial Intelligence,2001. Morgan Kaufmann. |
| 2000 | ||
| [9] |
.
2000. Algorithms based on Symbolic Transformations of Logical Formulas in the RDL Language. In Proceedings of the 2nd Conference on Applications of Computer Science in Mathematics and Economy, pages 101–115. WSIiE, Olsztyn, Poland. |
|
| [8] |
.
2000. On Rule-Based Approach to the Construction of Logical Transformers. In Proceedings of the 1st International Workshop on Rule-Based Programming (RULE), pages 57–71. Springer Physica-Verlag. |
|
| [7] | |
.
2000. Efficient reasoning using the local closed-world assumption. In Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems and Applications (AIMSA), pages 49–58. In series: Lecture Notes in Computer Science #1904. Springer. ISBN: 3-540-41044-9. DOI: 10.1007/3-540-45331-8_5. |
| 1999 | ||
| [6] |
.
1999. Elimination of Predicate Quantifiers. In Logic, Language and Reasoning. Essays in Honor of Dov Gabbay, Part I, pages 159–181. Kluwer Academic Publishers. |
|
| 1996 | ||
| [5] | |
.
1996. Explaining explanation closure. In Zbigniew W. Ras, Maciek Michalewicz, editors, Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems,1996, pages 521–530. In series: Lecture Notes in Computer Science #1079. Springer Berlin/Heidelberg. ISBN: 3-540-61286-6. DOI: 10.1007/3-540-61286-6_176. |
| [4] | |
.
1996. General domain circumscription and its first-order reduction. In Dov Gabbay, Hans Olbach, editors, Proceedings of the 1st International Conference on Formal and Applied Practical Reasoning (FAPR), pages 93–109. In series: Lecture Notes in Computer Science #1085. Springer Berlin/Heidelberg. ISBN: 978-3-540-61313-8. DOI: 10.1007/3-540-61313-7_65. |
| 1995 | ||
| [3] | |
.
1995. Computing circumscription revisited. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), pages 1502–1508. ISBN: 978-1558603639. Note: Volume 2. Preliminary report |
| 1994 | ||
| [2] |
.
1994. Genetic Algorithms for Decision Problems. In Proceedings of the 6th International Conference on Artificial Intelligence and Information-Control Systems of Robots (AIICSR), pages 383–390. World Scientific. ISBN: 981-02-1877-X. |
|
| 1987 | ||
| [1] |
.
1987. A Compositional Method for the Design and Proof of Asynchronous Processes. In Proceedings of the 4th Annual ESPRIT Conference (ESPRIT), pages 566–580. North-Holland. ISBN: 0-444-70333-0. |
|
