Search the dblp DataBase
Barbara Morawska :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Christopher Lynch , Barbara Morawska Decidability and Complexity of Finitely Closable Linear Equational Theories. [Citation Graph (0, 0)][DBLP ] IJCAR, 2001, pp:499-513 [Conf ] Christopher Lynch , Barbara Morawska Basic Syntactic Mutation. [Citation Graph (0, 0)][DBLP ] CADE, 2002, pp:471-485 [Conf ] Christopher Lynch , Barbara Morawska Automatic Decidability. [Citation Graph (0, 0)][DBLP ] LICS, 2002, pp:7-0 [Conf ] Christopher Lynch , Barbara Morawska Complexity of Linear Standard Theories. [Citation Graph (0, 0)][DBLP ] LPAR, 2001, pp:186-200 [Conf ] Barbara Morawska Completeness of E-Unification with Eager Variable Elimination. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:198-212 [Conf ] Christopher Lynch , Barbara Morawska Goal-Directed E-Unification. [Citation Graph (0, 0)][DBLP ] RTA, 2001, pp:231-245 [Conf ] Christopher Lynch , Barbara Morawska Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories. [Citation Graph (0, 0)][DBLP ] RTA, 2005, pp:90-104 [Conf ] Barbara Morawska General E -unification with Eager Variable Elimination and a Nice Cycle Rule. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2007, v:39, n:1, pp:77-106 [Journal ] Unification in the Description Logic EL. [Citation Graph (, )][DBLP ] Unification in the Description Logic EL. [Citation Graph (, )][DBLP ] Unification in the Description Logic EL [Citation Graph (, )][DBLP ] Search in 0.001secs, Finished in 0.002secs