A5087579719- Semantic Web and Ontologies
- Advanced Database Systems and Queries
- Logic, Reasoning, and Knowledge
- Natural Language Processing Techniques
- Service-Oriented Architecture and Web Services
- Data Management and Algorithms
- Biomedical Text Mining and Ontologies
- Logic, programming, and type systems
- Formal Methods in Verification
- Wikis in Education and Collaboration
- Scientific Computing and Data Management
- Digital Rights Management and Security
- Data Quality and Management
- semigroups and automata theory
- Topic Modeling
- Rough Sets and Fuzzy Logic
- Advanced Graph Neural Networks
- Software Testing and Debugging Techniques
- Advanced Algebra and Logic
- Business Process Modeling and Analysis
- Constraint Satisfaction and Optimization
- AI-based Problem Solving and Planning
- Algorithms and Data Compression
- Graph Theory and Algorithms
- Multi-Agent Systems and Negotiation
TU Dresden
2016-2025
Center for Systems Biology Dresden
2022
Knowledge Based Systems (United States)
2020-2022
Center for Advancing Health
2017
University of Oxford
2010-2015
Science Oxford
2012
Karlsruhe Institute of Technology
2004-2010
Karlsruhe University of Education
2006-2007
This collaboratively edited knowledgebase provides a common source of data for Wikipedia, and everyone else.
Wikipedia is the world's largest collaboratively edited source of encyclopaedic knowledge. But in spite its utility, contents are barely machine-interpretable. Structural knowledge, e.,g. about how concepts interrelated, can neither be formally stated nor automatically processed. Also wealth numerical data only available as plain text and thus not processed by actual meaning.We provide an extension to integrated Wikipedia, that allows typing links between articles specification typed inside...
This paper provides a self-contained first introduction to description logics (DLs). The main concepts and features are explained with examples before syntax semantics of the DL SROIQ defined in detail. Additional sections review light-weight languages, discuss relationship Web Ontology Language OWL give pointers further reading.
Existential rules, i.e. Datalog extended with existential quantifiers in rule heads, are currently studied under a variety of names such as Datalog+/-, ∀∃-rules, and tuple-generating dependencies. The renewed interest this formalism is fuelled by wealth recently discovered language fragments for which query answering decidable. This paper extends consolidates two the main approaches field - acyclicity guardedness providing (1) complexity-preserving generalisations weakly acyclic (frontier-)...
A common perception is that there are two competing visions for the future evolution of Web: Semantic Web and 2.0. closer look, though, reveals core technologies concerns these approaches complementary each field can must draw from other's strengths. We believe web applications will retain 2.0 focus on community usability, while drawing infrastructure to facilitate mashup-like information sharing. However, several open issues be addressed before such become commonplace. In this paper, we...
Answering conjunctive queries (CQs) over a set of facts extended with existential rules is prominent problem in knowledge representation and databases. This can be solved using the chase algorithm, which extends given fresh order to satisfy rules. If terminates, then CQs evaluated directly resulting facts. The chase, however, does not terminate necessarily, checking whether terminates on undecidable. Numerous acyclicity notions were proposed as sufficient conditions for termination. In this...
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like variable classes within axioms. This feature allows ontology languages to express arbitrary DL-safe rules (as expressible in SWRL or RIF) their native syntax. show that adding does not increase the worst-case reasoning complexity, and we identify novel tractable language SROELV3(∩, x) is versatile enough capture lightweight EL RL.
Description logics (DLs) have become a prominent paradigm for representing knowledge in variety of application areas, partly due to their ability achieve favourable balance between expressivity the logic and performance reasoning. Horn description are obtained, roughly speaking, by disallowing all forms disjunctions. They attracted attention since (worst-case) data complexities general lower than those non-Horn counterparts, which makes them attractive reasoning with large sets instance...
The evaluation of Datalog rules over large Knowledge Graphs (KGs) is essential for many applications. In this paper, we present a new method materializing inferences, which combines column-based memory layout with novel optimization methods that avoid redundant inferences at runtime. pro-active caching certain subqueries further increases efficiency. Our empirical shows approach can often match or even surpass the performance state-of-the-art systems, especially under restricted resources.