Folgen
Barbara Morawska
Barbara Morawska
Bestätigte E-Mail-Adresse bei wmii.uni.lodz.pl
Titel
Zitiert von
Zitiert von
Jahr
Unification in the Description Logic EL.
F Baader, B Morawska
RTA, 350-364, 2009
1262009
Extending unification in EL towards general TBoxes
F Baader, S Borgwardt, B Morawska
Thirteenth International Conference on the Principles of Knowledge …, 2012
472012
Automatic decidability
C Lynch, B Morawska
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 7-16, 2002
442002
Basic syntactic mutation
C Lynch, B Morawska
Automated Deduction—CADE-18: 18th International Conference on Automated …, 2002
322002
SAT Encoding of Unification in
F Baader, B Morawska
Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010
272010
Matching with Respect to General Concept Inclusions in the Description Logic
F Baader, B Morawska
KI 2014: Advances in Artificial Intelligence: 37th Annual German Conference …, 2014
112014
SAT Encoding of Unification in w.r.t. Cycle-Restricted Ontologies
F Baader, S Borgwardt, B Morawska
Automated Reasoning: 6th International Joint Conference, IJCAR 2012 …, 2012
112012
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
102012
A Goal-Oriented Algorithm for Unification in ELH_R+ wrt Cycle-Restricted Ontologies.
F Baader, S Borgwardt, B Morawska
Australasian Conference on Artificial Intelligence, 493-504, 2012
92012
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
92012
Goal-Directed E-Unification
C Lynch, B Morawska
Rewriting Techniques and Applications: 12th International Conference, RTA …, 2001
92001
General E-unification with eager variable elimination and a nice cycle rule
B Morawska
Journal of Automated Reasoning 39 (1), 77, 2007
72007
Approximating E-unification
C Lynch, B Morawska
15th Annual Workshop on Unification Theory, Siena, Italy, 2001
72001
Computing minimal EL-unifiers is hard
F Baader, S Borgwardt, B Morawska
62012
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
62011
Faster Basic Syntactic Mutation with sorts for some separable equational theories
C Lynch, B Morawska
RTA 3467, 90-104, 2005
62005
UEL: Unification Solver for the Description Logic – System Description
F Baader, J Mendez, B Morawska
Automated Reasoning: 6th International Joint Conference, IJCAR 2012 …, 2012
52012
Unification in the description logic EL wrt cycle-restricted TBoxes
F Baader, S Borgwardt, B Morawska
52011
Extending unification in towards general TBoxes
F Baader, S Borgwardt, B Morawska
Proceedings of the 13th International Conference on Principles of Knowledge …, 0
5
Constructing SNOMED CT concepts via disunification. LTCS-Report 17–07, Chair for Automata Theory
F Baader, S Borgwardt, B Morawska
Institute for Theoretical Computer Science, Technische Universität Dresden …, 2017
42017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20