Thomas Lukasiewicz

Professor Thomas Lukasiewicz

Professor of Computer Science

Yahoo! Research Fellow

E: firstname.lastname at cs.ox.ac.uk

T: +44 (0)1865 522566

Room 366, Wolfson Building, Parks Road, Oxford OX1 3QD

Themes:

• Artificial Intelligence and Machine Learning
• Information Systems
• Algorithms and Complexity Theory

See also

• Google Scholar Profile
• 
  DBLP Profile
• 
  List of Projects
• 
  Invited Talks and Courses
• 
  Other Activities
• 
  Biography
• 
  
  Oana Tifrea-Marciuska awarded the EPSRC Doctoral Prize 2017
• 
  Turing Fellow
• 
  Gerardo Simari in "AI's 10 to Watch" list for 2016
• 
  RuleML 2015 Best Paper Award
• 
  Top Cited Papers III
• 
  Top Cited Papers II
• 
  AIJ Prominent Paper Award 2013
• 
  Oana Tifrea-Marciuska awarded Google European Doctoral Fellowship 2013
• 
  Top Cited Papers I
• 
  Google Research Award
• 
  Sponsored by Yahoo!

Selected Publications

View AllManage publications

• Complexity of Approximate Query Answering under Inconsistency in Datalog+⁄−

  Thomas Lukasiewicz‚ Enrico Malizia and Cristian Molinaro

  In Jérôme Lang, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence‚ IJCAI−ECAI 2018‚ Stockholm‚ Sweden‚ July 13−19‚ 2018. IJCAI/AAAI Press. July, 2018.

  Details about Complexity of Approximate Query Answering under Inconsistency in Datalog+⁄− | BibTeX data for Complexity of Approximate Query Answering under Inconsistency in Datalog+⁄−

• Ontological Query Answering under Many−Valued Group Preferences in Datalog+⁄−

  Bettina Fazzinga‚ Thomas Lukasiewicz‚ Maria Vanina Martinez‚ Gerardo I. Simari and Oana Tifrea−Marciuska

  In International Journal of Approximate Reasoning. Vol. 93. Pages 354–371. February, 2018.

  Details about Ontological Query Answering under Many−Valued Group Preferences in Datalog+⁄− | BibTeX data for Ontological Query Answering under Many−Valued Group Preferences in Datalog+⁄− | Link to Ontological Query Answering under Many−Valued Group Preferences in Datalog+⁄−

• A Novel Characterization of the Complexity Class Θ^P_k Based on Counting and Comparison

  Thomas Lukasiewicz and Enrico Malizia

  In Theoretical Computer Science. Vol. 694. Pages 21–33. September, 2017.

  Details about A Novel Characterization of the Complexity Class Θ^P_k Based on Counting and Comparison | BibTeX data for A Novel Characterization of the Complexity Class Θ^P_k Based on Counting and Comparison | Link to A Novel Characterization of the Complexity Class Θ^P_k Based on Counting and Comparison

Activities

• Deep Learning
• Knowledge Representation and Reasoning
• Databases

Projects

• DBOnto
• VADA
• RealPDBs

Completed Projects

• ExODA
• Probabilistic Semantic Query Answering on the Web
• PrOQAW
• PRODIMA
• Personalized Search on the Social Web
• PrefMPS

Current Students

Oana-Maria Camburu

Patrick Hohenecker