Volume
OASIcs, Volume 138
Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025)
-
Part of:
Series:
Open Access Series in Informatics (OASIcs)
Conference: International Reasoning Web Summer School (RW)
Events
Editors
Publication Details
- published at: 2025-11-28
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-405-5
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 138, RW 2024 & RW 2025, Complete Volume
Abstract
OASIcs, Volume 138, RW 2024 & RW 2025, Complete Volume
Cite as
Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 1-298, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@Proceedings{artale_et_al:OASIcs.RW.2024/2025,
title = {{OASIcs, Volume 138, RW 2024 \& RW 2025, Complete Volume}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {1--298},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025},
URN = {urn:nbn:de:0030-drops-250781},
doi = {10.4230/OASIcs.RW.2024/2025},
annote = {Keywords: OASIcs, Volume 138, RW 2024 \& RW 2025, Complete Volume}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 0:i-0:viii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{artale_et_al:OASIcs.RW.2024/2025.0,
author = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {0:i--0:viii},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.0},
URN = {urn:nbn:de:0030-drops-250759},
doi = {10.4230/OASIcs.RW.2024/2025.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Invited Paper
Rule-Based Knowledge Graph Completion (Invited Paper)
Abstract
The field of knowledge graph completion is concerned with augmenting knowledge graphs with missing information. Symbolic rule-based approaches are not only efficient and interpretable but also competitive with embedding-based methods in regard to predictive quality. Rule-based knowledge graph completion can be separated into two stages, the learning stage and the application stage, which are both individually challenging. In the learning stage, horn rules are mined from a given knowledge graph. Given the vast size of the space of all possible rules, the mining approach must select relevant rules effectively. In the application stage, the mined rules are used to make new predictions which are assigned with plausibility scores. These scores need to be set by aggregating individual confidence values of rules that have the same consequence. This tutorial covers the fundamental aspects required to build a symbolic rule-based approach for knowledge graph completion. It will discuss the different rule types, mining strategies, and how to effectively apply the rules in different scenarios. Finally, we discuss practical examples for rule application by using the Python-based PyClause library.
Cite as
Patrick Betz, Christian Meilicke, and Heiner Stuckenschmidt. Rule-Based Knowledge Graph Completion (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 1:1-1:45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{betz_et_al:OASIcs.RW.2024/2025.1,
author = {Betz, Patrick and Meilicke, Christian and Stuckenschmidt, Heiner},
title = {{Rule-Based Knowledge Graph Completion}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {1:1--1:45},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.1},
URN = {urn:nbn:de:0030-drops-250461},
doi = {10.4230/OASIcs.RW.2024/2025.1},
annote = {Keywords: Knowledge Graph Completion, Rule Learning, Symbolic AI}
}
Document
Invited Paper
Fine-Grained Complexity of Ontology Mediated Queries (Invited Paper)
Abstract
This article surveys some approaches for establishing fine-grained complexity results for evaluation of ontology mediated queries (OMQs). It accompanies a related talk given at the Reasoning Web Summer School 2024. It zooms into some characterizations of efficiency in a parameterized complexity framework for OMQs based on various description logics and guarded tgds. As such results were established using results from query evaluation on databases, it also discusses the relevant results from the database world. After surveying some successive results on OMQs which all leverage database results in custom ways, it describes an approach which provides a general fpt reduction from query evaluation in the database world to query evaluation in the OMQ world. The reduction enables porting hardness results from the DB world to the OMQ world in a black-box fashion. Along these mentioned approaches, it also provides a brief survey of other approaches which are concerned with fine-grained complexity of OMQs and are based on rewriting techniques.
Cite as
Cristina Feier. Fine-Grained Complexity of Ontology Mediated Queries (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 2:1-2:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{feier:OASIcs.RW.2024/2025.2,
author = {Feier, Cristina},
title = {{Fine-Grained Complexity of Ontology Mediated Queries}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {2:1--2:23},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.2},
URN = {urn:nbn:de:0030-drops-250476},
doi = {10.4230/OASIcs.RW.2024/2025.2},
annote = {Keywords: complexity analysis, guarded logics, guarded tgds, database theory, ontology mediated queries}
}
Document
Invited Paper
Foundations of Graph Neural Networks (A Logician’s View) (Invited Paper)
Abstract
Graph Neural Networks (GNNs) are a family of neural architectures that are naturally suited to learning functions on graphs. They are now used in a wide range of applications. It has been observed that GNNs share many similarities with classical computer science (CS) formalisms, such as the Weisfeiler-Leman graph isomorphism test, bisimulation, and logic. Most notably, both GNNs and these formalisms deal with functions on graphs and graph-like structures. This observation opens up an opportunity to compare GNN architectures with these formalisms in terms of different kinds of expressibility, thus positioning these architectures within the well-established landscape of theoretical CS. This, in turn, helps us better understand the fundamental capabilities and limitations of various GNN architectures, enabling more informed choices about which architecture to use - if any at all. In these lecture notes, I give an introduction to the state-of-the-art foundations of GNNs - specifically, our current understanding of their expressibility in terms of the classical formalisms, considering several notions of expressive power.
Cite as
Egor V. Kostylev. Foundations of Graph Neural Networks (A Logician’s View) (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{kostylev:OASIcs.RW.2024/2025.3,
author = {Kostylev, Egor V.},
title = {{Foundations of Graph Neural Networks (A Logician’s View)}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {3:1--3:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.3},
URN = {urn:nbn:de:0030-drops-250486},
doi = {10.4230/OASIcs.RW.2024/2025.3},
annote = {Keywords: Graph Neural Networks, Expressivity, Logic}
}
Document
Invited Paper
Human-Centered ASP Applications: Representation & Reasoning (Invited Paper)
Abstract
As the objective of Artificial Intelligence (AI) changes towards building rational agents that are provably beneficial for humans, Knowledge Representation and Reasoning (KRR) plays an important role in addressing the user-oriented challenges in applications, such as generality, flexibility, provability, hybridity, bi-directional interactions, robustness, and explainability. In this tutorial, we will introduce participants to modeling and solving problems in human-centered real-world applications, using KRR methods and tools of Answer Set Programming (ASP), while addressing such challenges for AI.
Cite as
Aysu Boğatarkan, Müge Fidan, and Esra Erdem. Human-Centered ASP Applications: Representation & Reasoning (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{bogatarkan_et_al:OASIcs.RW.2024/2025.4,
author = {Bo\u{g}atarkan, Aysu and Fidan, M\"{u}ge and Erdem, Esra},
title = {{Human-Centered ASP Applications: Representation \& Reasoning}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {4:1--4:14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.4},
URN = {urn:nbn:de:0030-drops-250491},
doi = {10.4230/OASIcs.RW.2024/2025.4},
annote = {Keywords: Answer set programming, human-centered applications, multi robot planning in warehouses, explainability, stable roommates problem, usefulness evaluations}
}
Document
Invited Paper
Inconsistency-Tolerant Semantics Based on (Preferred) Repairs (Invited Paper)
Abstract
Real-world datasets are plagued by data quality issues which may render the data inconsistent w.r.t. a set of constraints, be they given by database integrity constraints or ontologies. A prominent way to handle such inconsistent data is to use inconsistency-tolerant semantics to obtain meaningful answers to queries. Most of these semantics are based on some notion of repairs, which represent ways of restoring the data consistency. The most basic kind of repairs is that of subset repairs, which are maximal consistent subsets of the dataset. However, in many scenarios, one can define preferred repairs based on some preference information. These lecture notes present inconsistency-tolerant semantics, focusing on the repair-based ones, then review different kinds of preferred repairs that have been considered in the literature. We present in particular the relationships between different kinds of preferred repairs and other notions related to inconsistency handling, the computational complexity of reasoning with (preferred) repairs, and some implementations.
Cite as
Camille Bourgaux. Inconsistency-Tolerant Semantics Based on (Preferred) Repairs (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 5:1-5:67, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{bourgaux:OASIcs.RW.2024/2025.5,
author = {Bourgaux, Camille},
title = {{Inconsistency-Tolerant Semantics Based on (Preferred) Repairs}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {5:1--5:67},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.5},
URN = {urn:nbn:de:0030-drops-250504},
doi = {10.4230/OASIcs.RW.2024/2025.5},
annote = {Keywords: Knowledge bases, databases, inconsistency handling, repairs, preferences}
}
Document
Invited Paper
Explaining Reasoning Results for Description Logic Ontologies (Invited Paper)
Abstract
The Web Ontology Language (OWL), grounded in description logics, enables reasoning systems to infer implicit knowledge in a transparent manner. However, the expressivity of description logics and the complexity of large ontologies often results in reasoning outcomes that are hard to understand without additional tool support. Explanations of these outcomes are essential for users to understand ontology content, communicate its structure and behavior effectively, and debug undesired or missing inferences. This chapter provides an overview of the central explanation techniques that have been developed for explaining reasoning with description logic ontologies. Here, we consider both explanations for positive entailments (explaining why something can be deduced), as well as negative entailments (why something cannot be deduced). More specifically, we discuss justifications, proofs and interpolation as a means to explain positive entailments, and abduction for explaining negative entailments, where we also have a closer look at practical algorithms as well as practical and theoretical challenges.
Cite as
Patrick Koopmann. Explaining Reasoning Results for Description Logic Ontologies (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 6:1-6:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{koopmann:OASIcs.RW.2024/2025.6,
author = {Koopmann, Patrick},
title = {{Explaining Reasoning Results for Description Logic Ontologies}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {6:1--6:29},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.6},
URN = {urn:nbn:de:0030-drops-250514},
doi = {10.4230/OASIcs.RW.2024/2025.6},
annote = {Keywords: Explanations, Justifications, Proofs, Craig Interpolation, Contrastive Explanations}
}
Document
Invited Paper
Modern Datalog: Concepts, Methods, Applications (Invited Paper)
Abstract
Pure Datalog is arguably the most fundamental rule language, elegant and simple, but also often too limited to be useful in practice. This has motivated the introduction of many new expressive features, ranging from datatypes and related functions, over aggregates and semi-ring generalisations, to existential quantifiers and complex terms. In spite of their variety, all these approaches remain true to the nature of Datalog as a direct, pattern-based way of computing on structured data. We therefore find that a modern notion of Datalog is emerging, distinctly different from other approaches of logic programming and with its own set of related methods and applications.
In this course, we introduce Datalog and its most common extensions, and explain when and how these features can be used together (which is often, but not always, safe to do). We further look at modern Datalog systems and some of their primary use cases. Hands-on work with Datalog and its extensions is done with the free Datalog engine https://knowsys.github.io/nemo-doc/. The course is accessible to all audiences and does not assume specific prior knowledge.
Cite as
Markus Krötzsch. Modern Datalog: Concepts, Methods, Applications (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 7:1-7:41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{krotzsch:OASIcs.RW.2024/2025.7,
author = {Kr\"{o}tzsch, Markus},
title = {{Modern Datalog: Concepts, Methods, Applications}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {7:1--7:41},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.7},
URN = {urn:nbn:de:0030-drops-250524},
doi = {10.4230/OASIcs.RW.2024/2025.7},
annote = {Keywords: Datalog, query language, knowlegde representation and reasoning, logic programming, Horn logic, SPARQL, datatypes and aggregation, lecture notes, tutorial}
}
Document
Invited Paper
ASP Essentials: Modelling and Efficient Solving (Invited Paper)
Abstract
Answer Set Programming (ASP) is a logic-based Knowledge Representation and Reasoning (KRR) paradigm that facilitates rapid prototyping of solutions for complex problems. It is particularly effective for tackling Deep Reasoning tasks involving exponentially large search spaces, such as combinatorial search and optimization. While getting started with ASP is relatively easy, mastering its advanced constructs and scaling solutions to real-world problem sizes can be challenging. This paper provides an introduction to ASP, guiding the reader from the fundamentals of the language to the application of programming methodologies and the computation of answer sets. Beyond the core framework, the paper also examines selected extensions of ASP that enable the modeling of complex problems, as well as compilation techniques designed to enhance solving efficiency. Furthermore, it mentions some recent tools that combine ASP with LLMs.
Cite as
Giuseppe Mazzotta and Francesco Ricca. ASP Essentials: Modelling and Efficient Solving (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 8:1-8:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{mazzotta_et_al:OASIcs.RW.2024/2025.8,
author = {Mazzotta, Giuseppe and Ricca, Francesco},
title = {{ASP Essentials: Modelling and Efficient Solving}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {8:1--8:21},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.8},
URN = {urn:nbn:de:0030-drops-250539},
doi = {10.4230/OASIcs.RW.2024/2025.8},
annote = {Keywords: Answer Set Programming, ASP with Quantifiers, Grounding Bottleneck, Compilation-based ASP solving, Neurosymbolic AI, LLMs}
}
Document
Invited Paper
Reasoning About Time in DatalogMTL: Course Notes (Invited Paper)
Abstract
Many real-world applications, such as those in healthcare, finance, and logistics, require reasoning over temporal data. Standard rule-based languages like Datalog, however, lack explicit mechanisms for handling time and temporal dependencies. In this chapter, we discussDatalogMTL, an extension of Datalog with operators frommetric temporal logic that allow to express complex temporal properties. We focus on reasoning algorithms for DatalogMTL, discussing bothmaterialisation, based on fixpoint applications of the immediate consequence operator, and anovel saturation-based extensionthat detects and halts infinite derivations, ensuring both completeness and termination of reasoning.
Cite as
Przemysław Andrzej Wałęga. Reasoning About Time in DatalogMTL: Course Notes (Invited Paper). In Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 & RW 2025). Open Access Series in Informatics (OASIcs), Volume 138, pp. 9:1-9:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
Copy BibTex To Clipboard
@InProceedings{walega:OASIcs.RW.2024/2025.9,
author = {Wa{\l}\k{e}ga, Przemys{\l}aw Andrzej},
title = {{Reasoning About Time in DatalogMTL: Course Notes}},
booktitle = {Joint Proceedings of the 20th and 21st Reasoning Web Summer Schools (RW 2024 \& RW 2025)},
pages = {9:1--9:23},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-405-5},
ISSN = {2190-6807},
year = {2025},
volume = {138},
editor = {Artale, Alessandro and Bienvenu, Meghyn and Garc{\'\i}a, Yazm{\'\i}n Ib\'{a}\~{n}ez and Murlak, Filip},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.RW.2024/2025.9},
URN = {urn:nbn:de:0030-drops-250546},
doi = {10.4230/OASIcs.RW.2024/2025.9},
annote = {Keywords: DatalogMTL, Logic Programming, Temporal Reasoning}
}