Unification in the description logic EL F Baader, B Morawska Logical Methods in Computer Science 6, 2010 | 137 | 2010 |
Extending unification in EL towards general TBoxes F Baader, S Borgwardt, B Morawska Thirteenth International Conference on the Principles of Knowledge …, 2012 | 52 | 2012 |
Automatic decidability C Lynch, B Morawska Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 7-16, 2002 | 46 | 2002 |
Basic syntactic mutation C Lynch, B Morawska International Conference on Automated Deduction, 471-485, 2002 | 33 | 2002 |
SAT Encoding of Unification in F Baader, B Morawska International Conference on Logic for Programming Artificial Intelligence …, 2010 | 26 | 2010 |
SAT Encoding of Unification in wrt Cycle-Restricted Ontologies F Baader, S Borgwardt, B Morawska International Joint Conference on Automated Reasoning, 30-44, 2012 | 12 | 2012 |
Matching with Respect to General Concept Inclusions in the Description Logic F Baader, B Morawska Joint German/Austrian Conference on Artificial Intelligence (Künstliche …, 2014 | 11 | 2014 |
Goal-Directed E-Unification C Lynch, B Morawska International Conference on Rewriting Techniques and Applications, 231-245, 2001 | 11 | 2001 |
A Goal-Oriented Algorithm for Unification in wrt Cycle-Restricted Ontologies F Baader, S Borgwardt, B Morawska Australasian Joint Conference on Artificial Intelligence, 493-504, 2012 | 9 | 2012 |
UEL: Unification solver for EL F Baader, S Borgwardt, JA Mendez, B Morawska Proc. of the 25th Int. Workshop on Description Logics (DL’12) 846, 26-36, 2012 | 9 | 2012 |
A goal-oriented algorithm for unification in EL wrt cycle-restricted TBoxes F Baader, S Borgwardt, B Morawska Proc. of the 25th Int. Workshop on Description Logics (DL’12) 846, 37-47, 2012 | 9 | 2012 |
General E-unification with Eager Variable Elimination and a Nice Cycle Rule B Morawska Journal of Automated Reasoning 39, 77-106, 2007 | 7 | 2007 |
Approximating E-unification C Lynch, B Morawska 15th Annual Workshop on Unification Theory, Siena, Italy, 2001 | 7 | 2001 |
Unification in the description logic EL wrt cycle-restricted TBoxes. LTCS-Report 11-05, Chair for Automata Theory F Baader, S Borgwardt, B Morawska Institute for Theoretical Computer Science, Technische Universität Dresden …, 2011 | 6 | 2011 |
Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories C Lynch, B Morawska International Conference on Rewriting Techniques and Applications, 90-104, 2005 | 6 | 2005 |
Decidability and Complexity of Finitely Closable Linear Equational Theories C Lynch, B Morawska Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena …, 2001 | 6 | 2001 |
Finding finite Herbrand models S Borgwardt, B Morawska International Conference on Logic for Programming Artificial Intelligence …, 2012 | 5 | 2012 |
Computing minimal EL-unifiers is hard F Baader Deutsche Nationalbibliothek, 2012 | 5 | 2012 |
Unification in the description logic EL wrt cycle-restricted TBoxes F Baader, S Borgwardt, B Morawska | 5 | 2011 |
Extending unification in towards general TBoxes F Baader, S Borgwardt, B Morawska Proceedings of the 13th International Conference on Principles of Knowledge …, 0 | 5 | |