| Unification in the Description Logic EL without the Top Concept. with Franz Baader, Nguyen Thanh Binh, Stefan Borgwardt. In Nikolaj Bjørner and Viorica Sofronie-Stokkermans, editors, Proceedings of the 23rd International Conference on Automated Deduction (CADE 2011), Lecture Notes in Computer Science, Wroclaw, Poland, 2011. Springer-Verlag. To appear. |
| SAT Encoding of Unification in EL, with Franz Baader. In Christian G. Fermüller and Andrei Voronkov, editors, Proceedings of the 17th International Conference on Logic for Programming, Artifical Intelligence, and Reasoning (LPAR-17), volume 6397 of Lecture Notes in Computer Science (subline Advanced Research in Computing and Software Science), pages 97–111, Yogyakarta, Indonesia, October 2010. Springer-Verlag. |
| Unification in the Description Logic EL, with Franz Baader. In Ralf Treinen, editor, Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA 2009), volume 5595 of Lecture Notes in Computer Science, pages 350–364. Springer-Verlag, 2009. |
| Unification in the Description Logic EL is of Type Zero, with Franz Baader. The International Workshop for Unification (UNIF), 2008. |
| Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories, with Christopher Lynch. Proceedings of 16th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, Volume 3467, pp.90-104, 2005.
(The original publication is available at
www.springerlink.com) |
| Completeness of E-Unification with Eager Variable Elimination. Proceedings of 10th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Lecture Notes in Computer Science, Volume 2950, pp.198-212, 2003.
(The original publication is available at
www.springerlink.com) |
| Automatic Decidability, with Christopher Lynch. Proceedings of IEEE Symposium on Logic in Computer Science (LICS), 2002. |
| Basic Syntactic Mutation, with Christopher Lynch. Proceedings of Conference on Automated Deduction (CADE), Lecture Notes in Computer Science, 2002.
(The original publication is available at
www.springerlink.com) |
| Approximating E-unification, with Christopher Lynch. 15th Annual Workshop on Unification Theory (UNIF), Siena, Italy, 2001. |
| Complexity of Linear Standard Theories, with Christopher Lynch. Proceedings of 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), Lecture Notes in Computer Science, Volume 2250, pp. 188-200, 2001.
(The original publication is available at
www.springerlink.com) |
| Decidability and Complexity of Finitely Closable Linear Equational Theories, with Christopher Lynch. Proceedings of 1st International Joint Conference on Automated Reasoning (IJCAR), Lecture Notes in Computer Science, Volume 2083, pp. 495-513, 2001.
(The original publication is available at
www.springerlink.com) |
| Goal Directed E-Unification, with Christopher Lynch. Proceedings of 12th International Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science, Volume 2051, pp. 231-245, 2001.
(The original publication is available at
www.springerlink.com) |
| Theory of Consequence for the relevant logic R. (in Polish) In Logika, ed. J. Hawranek, University of Wroclaw, 1999. |
Relevance as formal condition of correctness of reasoning. (in Polish) In Logiczne Podstawy Rozumowan, ed. W. Kustrzeba. University of Gdansk, 1995.
|
