6.4 List of Possible Research Projects

  • Automata techniques for hybrid reasoning (FUB, TUD, TUW)
  • Causal reasoning and planning (TUW, TUD, SFU, NICTA)
  • Combining description logics with quantitative temporal logics (TUD, FUB)
  • Complexity and algorithms for web update policies (UNL, TUW)
  • Configuration management using description logics and other knowledge representation formalisms (FUB, TUD, TUW, NICTA)
  • Efficient data access in expressive ontology languages (FUB, TUD, LIXTO)
  • Efficiently determination of RNA structure with constraint reasoning (UNL, SFU, TUD)
  • Expressiveness of combinations of rules and ontologies (FUB, TUW)
  • Extracting ontologies with reasoning rules from dialogues and argumentation (UNL, SFU, TUW)
  • Formalizing Semantic Web standard languages (FUB, UNL, UCH, TUD)
  • Inconsistency management for rules plus ontologies (FUB, TUW)
  • Knowledge representation and databases (FUB, TUW, UCH, IBM)
  • Multi-valued and paraconsistent reasoning in modular logic programming (UNL, TUW)
  • Paraconsistent approaches to answer set programming and its extensions (UNL, TUW)
  • Proof-theoretic approaches for reasoning in light-weight description logics (TUD, TUW)
  • Relating fluent calculus and non-monotonic action languages (TUD, TUW)
  • Revision, update and merging of logic programs (UNL, TUW, SFU)
  • Transforming description logics into logic programming (and back) (FUB, TUW, NICTA)
  • Update and evolution of ontologies (FUB, TUD)
  • Using ontology reasoning for situation awareness (TUD, FUB, NICTA)