A5024774718- Semantic Web and Ontologies
- Logic, Reasoning, and Knowledge
- Advanced Database Systems and Queries
- Service-Oriented Architecture and Web Services
- Natural Language Processing Techniques
- Rough Sets and Fuzzy Logic
- Data Management and Algorithms
- Biomedical Text Mining and Ontologies
- Multi-Agent Systems and Negotiation
- Logic, programming, and type systems
- Topic Modeling
- Bayesian Modeling and Causal Inference
- Business Process Modeling and Analysis
- Constraint Satisfaction and Optimization
- Auction Theory and Applications
- Data Quality and Management
- Advanced Algebra and Logic
- semigroups and automata theory
- Formal Methods in Verification
- Complexity and Algorithms in Graphs
- Data Mining Algorithms and Applications
- Digital Transformation in Industry
- Distributed systems and fault tolerance
- Graph Theory and Algorithms
- Advanced Graph Neural Networks
German Research Centre for Artificial Intelligence
2024
TU Dresden
2015-2024
Center for Scalable Data Analytics and Artificial Intelligence
2024
University of Oxford
2010-2014
Karlsruhe Institute of Technology
2006-2013
FZI Research Center for Information Technology
2011
With more substantial funding from research organizations and industry, numerous large-scale applications, recently developed technologies, the Semantic Web is quickly emerging as a well-recognized important area of computer science. While technologies are still rapidly evolving, Foundations Technologies focuses on established foundations in this that have become relatively stable over time. It thoroughly covers basic introductions intuitions, technical details, formal foundations.The book...
Streams of events appear increasingly today in various Web applications such as blogs, feeds, sensor data streams, geospatial information, on-line financial data, etc. Event Processing (EP) is concerned with timely detection compound within streams simple events. State-of-the-art EP provides on-the-fly analysis event but cannot combine background knowledge and perform reasoning tasks. On the other hand, semantic tools can effectively handle thereon, deal rapidly changing provided by streams.
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword on graph-structured data has emerged important research topic. The prevalent approaches build dedicated indexing techniques well search algorithms aiming at finding substructures that connect the elements matching keywords. In this paper, we introduce a novel paradigm for data, focusing in particular RDF model. Instead computing answers directly previous...
Addressing dynamics and notifications in the Semantic Web realm has recently become an important area of research. Run time data is continuously generated by multiple social networks, sensor various on-line services so forth. How to get
We establish complexities of the conjunctive query entailment problem for classes existential rules (i.e. Tuple-Generating Dependencies or Datalog+/- rules). Our contribution is twofold. First, we introduce class greedy bounded treewidth sets (gbts), which covers guarded rules, and their known generalizations, namely (weakly) frontier-guarded rules. provide a generic algorithm with gbts, worst-case optimal combined complexity predicate arity, as well data complexity. Second, classify several...
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-)...
The high computational complexity of the expressive Description Logics (DLs) that underlie OWL standard has motivated study their Horn fragments, which are usually tractable in data and can also have lower combined complexity, particularly for query answering. In this paper we provide algorithms answering conjunctive 2-way regular path queries (2CRPQs), a non-trivial generalization plain queries, fragments DLs SHOIQ SROIQ underlying 1 2. We show problem is ExpTime-complete Horn-SHOIQ...
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...
Description Logics are knowledge representation formalisms that provide, for example, the logical underpinning of W3C OWL standards. Conjunctive queries, standard query language in databases, have recently gained significant attention as an expressive formalism querying Logic bases. Several different techniques deciding conjunctive entailment available a wide range DLs. Nevertheless, combination nominals, inverse roles, and number restrictions 1 2 DL causes unsolvable problems hitherto...
The International Semantic Web Research School (ISWS) is a week-long intensive program designed to immerse participants in the field. This document reports collaborative effort performed by ten teams of students, each guided senior researcher as their mentor, attending ISWS 2023. Each team provided different perspective topic creative AI, substantiated set research questions main subject investigation. 2023 edition focuses on intersection technologies and Creative AI. explored various...