Reasonable Ontology Templates (OTTR) is a recent template language for the modelling -and construction- of RDF knowledge graphs, which aims to tackle the issue that RDF itself is too low level for practical use. By emphasising useful design-principles, such as abstraction levels and the "Don't Repeat Yourself''-principle (DRY), OTTR is a promising solution, for which the industry has shown great interest. This thesis investigates the potential for the use of OTTR as a query language. OTTR templates model RDF graph patterns, and in the process known as expansion, constructs graphs from these patterns. Based on the idea that the reversal of the expansion process describes a query language for RDF graphs, this project formally defines Reverse OTTR, a query language for RDF with OTTR syntax. To this end, we first provide a formalization of the expansion process of OTTR and use this formalisation as the basis for the formalization of Reverse OTTR. Then, we formally show by structural induction how the input and output of the two languages relate, justifying the name of the language. Finally, we present a proof-of-concept implementation of Reverse OTTR and an experiment, which showcases the performance of the naive implementation for various language features.