Barbara Morawska

Orcid: 0000-0003-4724-7206

Affiliations:
  • Ahmedabad University, SEAS, Gujarat, India
  • Dresden University of Technology, Germany (former)
  • Clarkson University, Department of Mathematics and Computer Science, Potsdam, NY, USA (former, PhD)


According to our database1, Barbara Morawska authored at least 34 papers between 2001 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Unification in the Description Logic FL⊥.
Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

2020
Unification in FL0 Modulo a Flat TBox.
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

2016
Deciding Unifiability and Computing Local Unifiers in the Description Logic EL without Top Constructor.
Notre Dame J. Formal Log., 2016

Extending Unification in EL to Disunification: The Case of Dismatching and Local Disunification.
Log. Methods Comput. Sci., 2016

2015
Dismatching and Local Disunification in EL.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

Dismatching and Local Disunification in EL (Extended Abstract).
Proceedings of the 28th International Workshop on Description Logics, 2015

2014
Matching with respect to general concept inclusions in the Description Logic EL.
Proceedings of the 28th International Workshop on Unification, 2014

Matching with Respect to General Concept Inclusions in the Description Logic <i>EL</i>.
Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

2013
Hybrid Unification in the Description Logic EL.
Proceedings of the 27th International Workshop on Unification, 2013

Hybrid Unification in the Description Logic.
Proceedings of the Frontiers of Combining Systems, 2013

Hybrid EL-Unification is NP-complete.
Proceedings of the Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23, 2013

2012
Finding Finite Herbrand Models.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2012

Extending Unification in EL Towards General TBoxes.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

UEL: Unification Solver for EL.
Proceedings of the 2012 International Workshop on Description Logics, 2012

A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes.
Proceedings of the 2012 International Workshop on Description Logics, 2012

UEL: Unification Solver for the Description Logic ℇℒ - System Description.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

Recent Advances in Unification for the EL Family.
Proceedings of the UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, 2012

SAT Encoding of Unification in ℇℒℋ<sub>R<sup>+</sup></sub> w.r.t. Cycle-Restricted Ontologies.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

A Goal-Oriented Algorithm for Unification in ℇℒℋ<sub>R+</sub> w.r.t. Cycle-Restricted Ontologies.
Proceedings of the AI 2012: Advances in Artificial Intelligence, 2012

Computing Minimal EL-unifiers is Hard.
Proceedings of the Advances in Modal Logic 9, 2012

2011
Computing Local Unifiers in the Description Logic EL without the Top Concept.
Proceedings of the 25th International Workshop on Unification, 2011

Unification in the Description Logic EL without the Top Concept.
Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

Unification in the Description Logic <i>EL</i> without the Top Concept.
Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2010
Unification in the Description Logic EL
Log. Methods Comput. Sci., 2010

SAT Encoding of Unification in <i>EL</i>.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

2008
Unification in the Description Logic EL is of Type Zero.
Proceedings of the 22nd International Workshop on Unification, 2008

2007
General <i>E</i> -unification with Eager Variable Elimination and a Nice Cycle Rule.
J. Autom. Reason., 2007

2005
Faster <i>Basic Syntactic Mutation</i> with Sorts for Some Separable Equational Theories.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2003
Completeness of E-Unification with Eager Variable Elimination.
Proceedings of the Logic for Programming, 2003

2002
Automatic Decidability.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

Basic Syntactic Mutation.
Proceedings of the Automated Deduction, 2002

2001
Goal-Directed E-Unification.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Complexity of Linear Standard Theories.
Proceedings of the Logic for Programming, 2001

Decidability and Complexity of Finitely Closable Linear Equational Theories.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001


  Loading...