@article{kohlhase2026_115195,
  title = {Project VoLL-KI : Learning from Learners},
  author = {Kohlhase, Michael and Berges, Marc and Grubert, Jens and Landes, Dieter and Leidner, Jochen L. and Henrich, Andreas and Mittag, Florian and Nicklas, Daniela and Schmid, Ute Maria and Sedlmaier, Yvonne and Ulbrich-vom Ende, Achim and Wolter, Diedrich},
  year = {2026},
  volume = {39},
  pages = {299–309},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115195x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115195},
  language = {eng},
  abstract = {“Learning from Learners” (“Von Lernenden Lernen”, “VoLL-KI ” for short) is a is collaborative research project with the goal of creating a practical toolbox of instruments at diferent levels of abstraction to improve the learning experience and outcomes for students of artifcial intelligence. Learning and teaching at tertiary education institutions are currently ITbased but not AI-supported. The VoLL-KI project aims to go this crucial next step. Using AI approaches (e.g., ML, symbolic AI, statistical AI), several educational technologies are developed on the diferent granularity of the study programs (e.g., course, semester, program). So, dashboards for study planning, recommender systems improving student advisory services
and learning material selection, VR-based learning experiences, educational chatbots, and adaptive learning environments
are developed. The systems are mostly deployed as prototypes},
  keywords = {Computer-aided education, Intelligent tutoring systems, Teaching support for artifcial intelligence education, Computer-aided learning (CAL), Data-driven learning quality management, Study course monitoring, Learning analytics}
}

@techreport{haase2026_114349,
  title = {Behind The Corner : Using Qualitative Reasoning for Solving Angry Birds},
  author = {Haase, Felix and Wolter, Diedrich},
  year = {2026},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-114349x},
  url = {https://fis.uni-bamberg.de/handle/uniba/114349},
  language = {eng},
  abstract = {Physics-based logic puzzle games present diverse challenges for AI, primarily related to coping with uncertainty in complex continuous environments. As these challenges tie in with the goals of qualitative reasoning (QR), in particular to plan, predict and diagnose physical mechanisms, these games pose a natural benchmark for QR. In this paper we consider the projectile collision games Angry Birds by Rovio Entertainment on which the AI bench- mark AIBirds is based. We investigate whether a qualitative approach to action planning under uncertainty proposed by Ge et al. (2016) can be adapted to the domain of Angry Birds in order to identify targets hittable by multiple rebounds. It turns out that the search space for solving Angry Birds is complexly structured and a fine-grained decomposition is required, leading to high computational costs. This paper presents an analysis of the problem and discusses means to overcome the problems faced. We propose an improved qualitative prediction method that is able to solve hard levels, yet it also suggests the need of complementary methods.},
  keywords = {physical reasoning, qualitative simulation, action planning}
}

@article{lutfuozcep2025_112045,
  title = {Embedding Ontologies in the Description Logic ALC by Axis-Aligned Cones},
  author = {Lütfü Özçep, Özgür and Leemhuis, Mena and Wolter, Diedrich},
  year = {2025},
  pages = {217-267},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-112045x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112045},
  language = {eng},
  abstract = {This paper is concerned with knowledge graph embedding with background knowledge, taking the formal perspective of logics. In knowledge graph embedding, knowledge— expressed as a set of triples of the form (a R b) (“a is R-related to b”)—is embedded into a real-valued vector space. The embedding helps exploiting geometrical regularities of the space in order to tackle typical inductive tasks of machine learning such as link prediction. Recent embedding approaches also consider incorporating background knowledge, in which the intended meanings of the symbols a, R, b are further constrained via axioms of a theory. Of particular interest are theories expressed in a formal language with a neat semantics and a good balance between expressivity and feasibility. In that case, the knowledge graph together with the background can be considered to be an ontology. This paper develops a cone-based theory for embedding in order to advance the expressivity of the ontology: it works (at least) with ontologies expressed in the description logic ALC, which comprises restricted existential and universal quantifers, as well as concept negation and concept disjunction. In order to align the classical Tarskian Style semantics for ALC with the sub-symbolic representation of triples, we use the notion of a geometric model of an ALC ontology and show, as one of our main results, that an ALC ontology is satisfable in the classical sense if it is satisfable by a geometric model based on cones. The geometric model, if treated as a partial model, can even be chosen to be faithful, i.e., to refect all and only the knowledge captured by the ontology. We introduce the class of axis-aligned cones and show that modulo simple geometric operations any distributive logic (such as ALC) interpreted over cones employs this class of cones. Cones are also attractive from a machine learning perspective on knowledge graph embeddings since they give rise to applying conic optimization techniques.},
  keywords = {-}
}

@article{schwartz2025_111383,
  title = {On domain generators for the evaluation of action reversibility in STRIPS},
  author = {Schwartz, Tobias and Boockmann, Jan H. and Martin, Leon},
  year = {2025},
  pages = {699-726},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-111383x},
  url = {https://fis.uni-bamberg.de/handle/uniba/111383},
  language = {eng},
  abstract = {Robustness is a crucial requirement for the deployment of AI systems in real-world scenarios. In the context of AI planning, the concept of action reversibility, i.e., the ability to undo the effects of an action using a reverse plan, is a promising direction for achieving robust plans. Plans composed exclusively of reversible actions exhibit resilience against goal changes during the execution of the plan. However, the evaluation of action reversibility systems in STRIPS planning presents a challenge, given that standard planning benchmarks are often not suitable. Early experiments using a naive implementation of an action reversibility algorithm show that the available domain generation approach is susceptible to bias. Building on this existing domain generator, we introduce two slight variations that exhibit entirely different search space characteristics. We assess these domain generators using the naive action reversibility implementation and existing ASP implementations, and demonstrate that different generators indeed favor different implementations. As a follow-up to this line of research, we present a generalized domain generator facilitating the creation of domains with diverse search space characteristics. To finally reduce the utilization of contrived generation patterns, we propose another domain generator based on the Barabási-Albert model yielding less rigid domains. Our experiments demonstrate that these new domain generators can produce a variety of domains with diverse search space characteristics, enabling a less biased evaluation of action reversibility systems.},
  keywords = {STRIPS planning, Action reversibility, Benchmark, PDDL domain generation}
}

@inproceedings{wolter2025_106525,
  title = {Georeferencing River Networks Using Spatial Reasoning},
  author = {Wolter, Diedrich and Blank, Daniel and Henrich, Andreas},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1065257},
  url = {https://fis.uni-bamberg.de/handle/uniba/106525},
  language = {eng},
  abstract = {This paper is concerned with automatic georeferencing of river networks from raster images such as aerial photos or maps. Determining reasonable assignments between a given network of rivers derived from a textual description and an image is subject to high combinatorial complexity and uncertainty. We investigate the application of spatial reasoning in automatic georeferencing.},
  keywords = {georeferencing river networks, spatial reasoning, GIS}
}

@inproceedings{bayerkuhnlein2025_108887,
  title = {Diagnosing Algorithms by Abduction from Manual Simulation},
  author = {Bayerkuhnlein, Moritz and Wolter, Diedrich},
  year = {2025},
  booktitle = {Proceedings of the Second Work shop on Artificial Intelligence for Artificial Intelligence Education (AI4AI Learning 2024)},
  pages = {49-58},
  publisher = {University of Bamberg Press},
  address = {Bamberg},
  isbn = {978-3-98989-054-1},
  doi = {10.20378/irb-108887},
  url = {https://fis.uni-bamberg.de/handle/uniba/108887},
  language = {eng},
  abstract = {Taking a conceptual idea and turning it into a precise algorithm is at the heart of computational thinking. However, novice programmers often struggle when their code does not behave as they intended. This paper identifies problems in pseudocode algorithms based on deviations from observations that could be gathered during manual simulations by the programmer. By applying model-based diagnosis to the faulty pseudocode, informed by manual simulation, we locate errors and suggest fixes. The diagnosis results in the identification of a specific location in the algorithm and provides an output description for the faulty part that matches the programmer's intent during the manual simulation, thus aiding in debugging.},
  keywords = {-}
}

@inproceedings{singla2025_107661,
  title = {Proceedings of the Second Work shop on Artificial Intelligence for Artificial Intelligence Education (AI4AI Learning 2024)},
  author = {Singla, Adish and Hobert, Sebastian and Joachim, Silvia and Hennecke, Martin and Voelker, Adrian and Thaler, Anna Magdalena and Summerer, Maximilian T. and Schmid, Ute and Bayerkuhnlein, Moritz and Wolter, Diedrich and Bugert, Flemming and Bittner, Dominik and Ezer, Timur and Nadimpalli, Vamsi Krishna and Staufer, Susanne and Hauser, Florian and Maier, Robert and Grabinger, Lisa and Mottok, Jürgen and Niemann, Sonja},
  editor = {Schmid, Ute Maria and Leidner, Jochen L. and Kohlhase, Michael and Wolter, Diedrich},
  year = {2025},
  publisher = {University of Bamberg Press},
  address = {Bamberg},
  series = {Schriften aus der Fakultät Wirtschaftsinformatik und Angewandte Informatik der Otto-Friedrich-Universität Bamberg},
  isbn = {978-3-98989-054-1},
  doi = {10.20378/irb-107661},
  urn = {urn:nbn:de:bvb:473-irb-1076617},
  url = {https://fis.uni-bamberg.de/handle/uniba/107661},
  language = {eng},
  abstract = {Artificial Intelligence (AI) methods for education have been a topic of AI research since many decades with focus on Intelligent Tutoring Systems (ITS). ITS typically address a specific knowledge domain with a focus on individual learning support based on learning by problem solving, identification of misconceptions, and tailored feedback. Methods often are a combination of knowledge-based and machine learning approaches. Since the emergence of technologies based on Large Language Models (LLMs), the use of LLMs in educational contexts has received much attention, resulting in novel approaches.
The Second Workshop on Artificial Intelligence for Artificial Intelligence Education (AI4AILearning) has been held on September 24, 2024, in conjunction with the 47th German Conference on Artificial Intelligence in Würzburg, Germany. The workshop has a focus on research of AI methods for teaching AI competencies including programming skills. It provides a platform for exchange of ideas and experiences under the general theme of AI for education, specialising on university education in AI. The workshop includes interdisciplinary contributions from cognitive science and education technology.},
  keywords = {AI Education, Programming Education, Technology-Enhanced-Learning, Intelligent Tutoring Systems, Large Language Models}
}

@article{schwartz2025_107589,
  title = {On domain generators for the evaluation of action reversibility in STRIPS},
  author = {Schwartz, Tobias and Boockmann, Jan H. and Martin, Leon},
  year = {2025},
  journal = {Annals of Mathematics and Artificial Intelligence},
  volume = {93},
  number = {5},
  pages = {699-726},
  publisher = {Springer Science + Business Media B.V},
  address = {Dordrecht [u.a.]},
  issn = {1573-7470},
  doi = {10.1007/s10472-024-09960-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/107589},
  language = {eng},
  abstract = {Robustness is a crucial requirement for the deployment of AI systems in real-world scenarios. In the context of AI planning, the concept of action reversibility, i.e., the ability to undo the effects of an action using a reverse plan, is a promising direction for achieving robust plans. Plans composed exclusively of reversible actions exhibit resilience against goal changes during the execution of the plan. However, the evaluation of action reversibility systems in STRIPS planning presents a challenge, given that standard planning benchmarks are often not suitable. Early experiments using a naive implementation of an action reversibility algorithm show that the available domain generation approach is susceptible to bias. Building on this existing domain generator, we introduce two slight variations that exhibit entirely different search space characteristics. We assess these domain generators using the naive action reversibility implementation and existing ASP implementations, and demonstrate that different generators indeed favor different implementations. As a follow-up to this line of research, we present a generalized domain generator facilitating the creation of domains with diverse search space characteristics. To finally reduce the utilization of contrived generation patterns, we propose another domain generator based on the Barabási-Albert model yielding less rigid domains. Our experiments demonstrate that these new domain generators can produce a variety of domains with diverse search space characteristics, enabling a less biased evaluation of action reversibility systems.},
  keywords = {STRIPS planning, Action reversibility, Benchmark, PDDL domain generation}
}

@article{kohlhase2025_107128,
  title = {Project VoLL-KI : Learning from Learners},
  author = {Kohlhase, Michael and Berges, Marc and Grubert, Jens and Landes, Dieter and Leidner, Jochen L. and Henrich, Andreas and Mittag, Florian and Nicklas, Daniela and Schmid, Ute and Sedlmaier, Yvonne and Ulbrich-vom Ende, Achim and Wolter, Diedrich},
  year = {2025},
  journal = {Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen ; Organ des Fachbereichs 1 Künstliche Intelligenz der Gesellschaft für Informatik e.V., GI},
  volume = {39},
  pages = {299–309},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {0933-1875},
  doi = {10.1007/s13218-024-00846-9},
  url = {https://fis.uni-bamberg.de/handle/uniba/107128},
  language = {eng},
  abstract = {“Learning from Learners” (“Von Lernenden Lernen”, “VoLL-KI ” for short) is a is collaborative research project with the goal of creating a practical toolbox of instruments at diferent levels of abstraction to improve the learning experience and outcomes for students of artifcial intelligence. Learning and teaching at tertiary education institutions are currently ITbased but not AI-supported. The VoLL-KI project aims to go this crucial next step. Using AI approaches (e.g., ML, symbolic AI, statistical AI), several educational technologies are developed on the diferent granularity of the study programs (e.g., course, semester, program). So, dashboards for study planning, recommender systems improving student advisory services
and learning material selection, VR-based learning experiences, educational chatbots, and adaptive learning environments
are developed. The systems are mostly deployed as prototypes},
  keywords = {Computer-aided education, Intelligent tutoring systems, Teaching support for artifcial intelligence education, Computer-aided learning (CAL), Data-driven learning quality management, Study course monitoring, Learning analytics}
}

@incollection{bayerkuhnlein2024_112332,
  title = {Model-Based-Diagnosis for Assistance in Programming Exercises},
  author = {Bayerkuhnlein, Moritz and Wolter, Diedrich},
  year = {2024},
  booktitle = {Artificial Intelligence : ECAI 2023 International Workshops ; XAI^3, TACTIFUL, XI-ML, SEDAMI, RAAIT, AI4S, HYDRA, AI4AI ; Kraków, Poland, September 30 – October 4, 2023 ; Proceedings, Part 2},
  pages = {459-470},
  publisher = {Springer},
  address = {Cham, Switzerland},
  isbn = {978-3-031-50484-6},
  doi = {10.1007/978-3-031-50485-3\_44},
  url = {https://fis.uni-bamberg.de/handle/uniba/112332},
  language = {eng}
}

@inproceedings{bayerkuhnlein2024_112192,
  title = {From Resolving Inconsistencies in Qualitative Constraints Networks to Identifying Robust Solutions : A Universal Encoding in ASP},
  author = {Bayerkuhnlein, Moritz and Schwartz, Tobias and Wolter, Diedrich},
  year = {2024},
  booktitle = {KI 2024: Advances in Artificial Intelligence : 47th German Conference on AI Würzburg, Germany, September 25–27, 2024, Proceedings},
  pages = {3-16},
  publisher = {Springer},
  address = {Cham, Switzerland},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-70893-0},
  doi = {10.1007/978-3-031-70893-0\_1},
  url = {https://fis.uni-bamberg.de/handle/uniba/112192},
  language = {eng}
}

@inproceedings{bayerkuhnlein2024_108438,
  title = {Model-Based Diagnosis with ASP for Non-groundable Domains},
  author = {Bayerkuhnlein, Moritz and Wolter, Diedrich},
  year = {2024},
  booktitle = {Foundations of Information and Knowledge Systems : 13th International Symposium, FoIKS 2024, Sheffield, UK, April 8-11, 2024 ; Proceedings},
  pages = {363-380},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-56940-1},
  doi = {10.1007/978-3-031-56940-1\_20},
  url = {https://fis.uni-bamberg.de/handle/uniba/108438},
  language = {eng}
}

@article{wehner2023_112340,
  title = {On robust vs fast solving of qualitative constraints},
  author = {Wehner, Jan and Sioutis, Michael and Wolter, Diedrich},
  year = {2023},
  journal = {Journal of heuristics},
  volume = {29},
  number = {4-6},
  pages = {461-485},
  publisher = {Springer Science + Business Media B.V.},
  address = {Dordrecht [u.a.]},
  issn = {1572-9397},
  doi = {10.1007/s10732-023-09517-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/112340},
  language = {eng}
}

@article{lutfuozcep2023_109320,
  title = {Embedding Ontologies in the Description Logic ALC by Axis-Aligned Cones},
  author = {Lütfü Özçep, Özgür and Leemhuis, Mena and Wolter, Diedrich},
  year = {2023},
  journal = {Journal of artificial intelligence research : JAIR ; an international electronic and print journal},
  volume = {78},
  pages = {217-267},
  publisher = {AI Access Found.},
  issn = {1943-5037},
  doi = {10.1613/jair.1.13939},
  url = {https://fis.uni-bamberg.de/handle/uniba/109320},
  language = {eng},
  abstract = {This paper is concerned with knowledge graph embedding with background knowledge, taking the formal perspective of logics. In knowledge graph embedding, knowledge— expressed as a set of triples of the form (a R b) (“a is R-related to b”)—is embedded into a real-valued vector space. The embedding helps exploiting geometrical regularities of the space in order to tackle typical inductive tasks of machine learning such as link prediction. Recent embedding approaches also consider incorporating background knowledge, in which the intended meanings of the symbols a, R, b are further constrained via axioms of a theory. Of particular interest are theories expressed in a formal language with a neat semantics and a good balance between expressivity and feasibility. In that case, the knowledge graph together with the background can be considered to be an ontology. This paper develops a cone-based theory for embedding in order to advance the expressivity of the ontology: it works (at least) with ontologies expressed in the description logic ALC, which comprises restricted existential and universal quantifers, as well as concept negation and concept disjunction. In order to align the classical Tarskian Style semantics for ALC with the sub-symbolic representation of triples, we use the notion of a geometric model of an ALC ontology and show, as one of our main results, that an ALC ontology is satisfable in the classical sense if it is satisfable by a geometric model based on cones. The geometric model, if treated as a partial model, can even be chosen to be faithful, i.e., to refect all and only the knowledge captured by the ontology. We introduce the class of axis-aligned cones and show that modulo simple geometric operations any distributive logic (such as ALC) interpreted over cones employs this class of cones. Cones are also attractive from a machine learning perspective on knowledge graph embeddings since they give rise to applying conic optimization techniques.},
  keywords = {-}
}

@inproceedings{schwartz2023_91837,
  title = {Computing Most Likely Scenarios of Qualitative Constraint Networks},
  author = {Schwartz, Tobias and Wolter, Diedrich},
  year = {2023},
  booktitle = {KI 2023: Advances in Artificial Intelligence : 46th German Conference on AI, Berlin, Germany, September 26-29, 2023, Proceedings},
  pages = {184-197},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-42607-0},
  issn = {1611-3349},
  doi = {10.1007/978-3-031-42608-7\_15},
  url = {https://fis.uni-bamberg.de/handle/uniba/91837},
  language = {eng}
}

@article{leemhuis2023_91606,
  title = {Learning with cone-based geometric models and orthologics},
  author = {Leemhuis, Mena and Özgür, L. Özçep and Wolter, Diedrich},
  year = {2023},
  pages = {1159-1195},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-916066},
  url = {https://fis.uni-bamberg.de/handle/uniba/91606},
  language = {eng},
  abstract = {Recent approaches for knowledge-graph embeddings aim at connecting quantitative data structures used in machine learning to the qualitative structures of logics. Such embeddings are of a hybrid nature, they are data models that also exhibit conceptual structures inherent to logics. One motivation to investigate embeddings is to design conceptually adequate machine learning (ML) algorithms that learn or incorporate ontologies expressed in some logic. This paper investigates a new approach to embedding ontologies into geometric models that interpret concepts by geometrical structures based on convex cones. The ontologies are assumed to be represented in an orthologic, a logic with a full (ortho)negation. As a proof of concept this cone-based embedding was implemented within two ML algorithms for weak supervised multi-label learning. Both algorithms rely on cones but the first addresses ontologies expressed in classical propositional logic whereas the second addresses a weaker propositional logic, namely a weak orthologic that does not fulfil distributivity. The algorithms were evaluated and showed promising results that call for investigating other (sub)classes of cones and developing fine-tuned algorithms based on them.},
  keywords = {Concept learning, Knowledge graph embedding, Support-vector machine, Multi-label learning, Orthologic}
}

@article{yousaf2023_59712,
  title = {Automated Interpretation of Place Descriptions: Determining Entity Types for Querying OSM},
  author = {Yousaf, Madiha and Schwartz, Tobias and Wolter, Diedrich},
  year = {2023},
  pages = {69-81},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-597123},
  url = {https://fis.uni-bamberg.de/handle/uniba/59712},
  language = {eng},
  abstract = {This paper is concerned with interpretation of natural language place descriptions, as they are a rich source of geographic information. A place description is interpreted by matching geographic entities occurring in the text against the OpenStreetMap (OSM) database. This paper is mainly concerned with interpretation of paraphrased places, i.e., entities for which no name is given and which may only by described. Our objective is to determine suitable entity types that allow querying the OpenStreetMap database for the respective place. For example, if we wish to identify a place to eat, we have to check for entities of an a-priori unknown type (cafe, restaurant, etc.). Challenges arise from the open-endedness of language, its ambiguity, and context-sensitivity as well as from mismatches between human conceptualization of place and database ontologies. The contributions of this paper are, first, to present a hard problem that is key to geo-information retrieval beyond named entities. Second, we propose context-sensitive methods for identifying place types based on semantic word similarity. We evaluate the methods on text extracted from Wikipedia and travel blogs, revealing their contribution to advancing automated interpretation of place descriptions to paraphrased places.},
  keywords = {Geographic information retrieval, OSM Tags, Volunteered geographic information, Place descriptions, GIS}
}

@phdthesis{yousaf2023_59175,
  title = {Representing and Reasoning with Context-Sensitive Vague Place Descriptions},
  author = {Yousaf, Madiha},
  year = {2023},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-59175},
  urn = {urn:nbn:de:bvb:473-irb-591752},
  url = {https://fis.uni-bamberg.de/handle/uniba/59175},
  language = {eng},
  abstract = {This doctoral thesis aims to design a geographic information system based on locations to make the information about the human location interpretable for computers. This research employs natural language place descriptions as its primary research input and focuses on five research components as main goals towards understanding place descriptions: incorporating context-sensitive information, spatial information extraction, and modeling, reasoning, place geo-referencing, and querying.},
  keywords = {Artificial Intelligence, Künstliche Intelligenz, place description},
  school = {Otto-Friedrich-Universität Bamberg}
}

@article{schwartz2023_59676,
  title = {Automated Interpretation of Place Descriptions: Determining Entity Types for Querying OSM},
  author = {Schwartz, Tobias and Wolter, Diedrich and Yousaf, Madiha},
  year = {2023},
  journal = {KI - Künstliche Intelligenz},
  volume = {37},
  number = {1},
  pages = {69-81},
  publisher = {Springer},
  address = {Heidelberg},
  issn = {1610-1987},
  doi = {10.1007/s13218-022-00798-y},
  url = {https://fis.uni-bamberg.de/handle/uniba/59676},
  language = {eng},
  abstract = {This paper is concerned with interpretation of natural language place descriptions, as they are a rich source of geographic information. A place description is interpreted by matching geographic entities occurring in the text against the OpenStreetMap (OSM) database. This paper is mainly concerned with interpretation of paraphrased places, i.e., entities for which no name is given and which may only by described. Our objective is to determine suitable entity types that allow querying the OpenStreetMap database for the respective place. For example, if we wish to identify a place to eat, we have to check for entities of an a-priori unknown type (cafe, restaurant, etc.). Challenges arise from the open-endedness of language, its ambiguity, and context-sensitivity as well as from mismatches between human conceptualization of place and database ontologies. The contributions of this paper are, first, to present a hard problem that is key to geo-information retrieval beyond named entities. Second, we propose context-sensitive methods for identifying place types based on semantic word similarity. We evaluate the methods on text extracted from Wikipedia and travel blogs, revealing their contribution to advancing automated interpretation of place descriptions to paraphrased places.},
  keywords = {Geographic information retrieval, OSM Tags, Volunteered geographic information, Place descriptions, GIS}
}

@inproceedings{yao2022_115750,
  title = {A Dimensionality Reduction and Reconstruction Method for Data with Multiple Connected Components},
  author = {Yao, Yuqin and Gao, Yang and Long, Zhiguo and Meng, Hua and Sioutis, Michael},
  year = {2022},
  booktitle = {2022 IEEE 5th International Conference on Big Data and Artificial Intelligence (BDAI), proceedings},
  pages = {87-92},
  publisher = {IEEE},
  doi = {10.1109/bdai56143.2022.9862787},
  url = {https://fis.uni-bamberg.de/handle/uniba/115750},
  language = {eng}
}

@inproceedings{sioutis2022_115751,
  title = {Hybrid AI Systems Grounded on Qualitative Spatio-Temporal Reasoning},
  author = {Sioutis, Michael and Long, Zhiguo},
  year = {2022},
  booktitle = {Proceedings of the 12th Hellenic Conference on Artificial Intelligence},
  publisher = {ACM},
  address = {New York,NY, United States},
  isbn = {978-1-4503-9597-7},
  doi = {10.1145/3549737.3549807},
  url = {https://fis.uni-bamberg.de/handle/uniba/115751},
  language = {eng}
}

@inproceedings{leemhuis2022_112632,
  title = {Knowledge Graph Embeddings with Ontologies : Reification for Representing Arbitrary Relations},
  author = {Leemhuis, Mena and Özçep, Özgür L. and Wolter, Diedrich},
  year = {2022},
  booktitle = {KI 2022 : Advances in Artificial Intelligence ; 45th German Conference on AI, Trier, Germany, September 19–23, 2022, Proceedings},
  pages = {146-159},
  publisher = {Springer},
  address = {Cham, Switzerland},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-15790-5},
  doi = {10.1007/978-3-031-15791-2\_13},
  url = {https://fis.uni-bamberg.de/handle/uniba/112632},
  language = {eng}
}

@article{long2022_93443,
  title = {Approximating Region Boundaries Based on Qualitative and Quantitative Information},
  author = {Long, Zhiguo and Sioutis, Michael and Li, Qingqian and Meng, Hua and Li, Heng-Chao},
  year = {2022},
  journal = {IEEE intelligent systems},
  volume = {37},
  number = {6},
  pages = {38-47},
  publisher = {IEEE},
  address = {New York, NY [u.a.]},
  issn = {1541-1672},
  doi = {10.1109/mis.2022.3204561},
  url = {https://fis.uni-bamberg.de/handle/uniba/93443},
  language = {eng}
}

@article{leemhuis2022_91605,
  title = {Learning with cone-based geometric models and orthologics},
  author = {Leemhuis, Mena and Özgür, L. Özçep and Wolter, Diedrich},
  year = {2022},
  journal = {Annals of mathematics and artificial intelligence},
  volume = {90},
  number = {11-12},
  pages = {1159-1195},
  publisher = {Springer Science + Business Media B.V},
  address = {Dordrecht [u.a.]},
  issn = {1012-2443},
  doi = {10.1007/s10472-022-09806-1},
  url = {https://fis.uni-bamberg.de/handle/uniba/91605},
  language = {eng},
  abstract = {Recent approaches for knowledge-graph embeddings aim at connecting quantitative data structures used in machine learning to the qualitative structures of logics. Such embeddings are of a hybrid nature, they are data models that also exhibit conceptual structures inherent to logics. One motivation to investigate embeddings is to design conceptually adequate machine learning (ML) algorithms that learn or incorporate ontologies expressed in some logic. This paper investigates a new approach to embedding ontologies into geometric models that interpret concepts by geometrical structures based on convex cones. The ontologies are assumed to be represented in an orthologic, a logic with a full (ortho)negation. As a proof of concept this cone-based embedding was implemented within two ML algorithms for weak supervised multi-label learning. Both algorithms rely on cones but the first addresses ontologies expressed in classical propositional logic whereas the second addresses a weaker propositional logic, namely a weak orthologic that does not fulfil distributivity. The algorithms were evaluated and showed promising results that call for investigating other (sub)classes of cones and developing fine-tuned algorithms based on them.},
  keywords = {Concept learning, Knowledge graph embedding, Support-vector machine, Multi-label learning, Orthologic}
}

@article{sioutis2022_55184,
  title = {Just-In-Time Constraint-Based Inference for Qualitative Spatial and Temporal Reasoning},
  author = {Sioutis, Michael},
  year = {2022},
  pages = {259-270},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-551845},
  url = {https://fis.uni-bamberg.de/handle/uniba/55184},
  language = {eng},
  abstract = {We discuss a research roadmap for going beyond the state of the art in qualitative spatial and temporal reasoning (QSTR). Simply put, QSTR is a major field of study in Artificial Intelligence that abstracts from numerical quantities of space and time by using qualitative descriptions instead (e.g., precedes, contains, is left of); thus, it provides a concise framework that allows for rather inexpensive reasoning about entities located in space or time. Applications of QSTR can be found in a plethora of areas and domains such as smart environments, intelligent vehicles, and unmanned aircraft systems. Our discussion involves researching novel local consistencies in the aforementioned discipline, defining dynamic algorithms pertaining to these consistencies that can allow for efficient reasoning over changing spatio-temporal information, and leveraging the structures of the locally consistent related problems with regard to novel decomposability and theoretical tractability properties. Ultimately, we argue for pushing the envelope in QSTR via defining tools for tackling dynamic variants of the fundamental reasoning problems in this discipline, i.e., problems stated in terms of changing input data. Indeed, time is a continuous flow and spatial objects can change (e.g., in shape, size, or structure) as time passes; therefore, it is pertinent to be able to efficiently reason about dynamic spatio-temporal data. Finally, these tools are to be integrated into the larger context of highly active areas such as neuro-symbolic learning and reasoning, planning, data mining, and robotic applications. Our final goal is to inspire further discussion in the community about constraint-based QSTR in general, and the possible lines of future research that we outline here in particular.},
  keywords = {Qualitative constraints, Spatio-temporal reasoning, Just-in-time inference, Local consistencies, Singleton checks, Dynamic algorithms, Decomposability, Adaptivity, Parallelization}
}

@inproceedings{ro2022_55364,
  title = {Reinforcement Learning With Imperfect Safety Constraints},
  author = {Ro, Jin Woo and Lüttgen, Gerald and Wolter, Diedrich},
  year = {2022},
  booktitle = {Artificial Intelligence Safety 2022 : Proceedings of the Workshop on Artificial Intelligence Safety 2022 (SafeAI 2022) co-located with the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI2022) Virtual, February, 2022.},
  pages = {1-8},
  publisher = {RWTH Aachen},
  address = {Aachen, Germany},
  series = {CEUR workshop proceedings},
  url = {https://fis.uni-bamberg.de/handle/uniba/55364},
  language = {eng}
}

@article{long2022_53789,
  title = {Semi-Supervised Dimensionality Reduction by Linear Compression and Stretching},
  author = {Long, Zhiguo and Meng, Hua and Sioutis, Michael},
  year = {2022},
  pages = {27308-27317},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-537896},
  url = {https://fis.uni-bamberg.de/handle/uniba/53789},
  language = {eng},
  abstract = {Dimensionality reduction is a fundamental and important research topic in the field of machine learning. This paper focuses on a dimensionality reduction technique that exploits semi-supervising information in the form of pairwise constraints; specifically, these constraints specify whether two instances belong to the same class or not. We propose two dual linear methods to accomplish dimensionality reduction under that setting. These two methods overcome the difficulty of maximizing between-class difference and minimizing within-class difference at the same time, by transforming the original data into a new space in such a way that the bi-objective problem is (almost) equivalently reduced to a single objective problem. Empirical evaluations on a broad range of public datasets show that the two proposed methods are superior to several existing methods for semi-supervised dimensionality reduction.},
  keywords = {dimensionality reduction, principal component analysis, eigenvalues, eigenfunctions, task analysis, clustering algorithms, linear programming}
}

@techreport{haase2021_114328,
  title = {Behind The Corner : Using Qualitative Reasoning for Solving Angry Birds},
  author = {Haase, Felix and Wolter, Diedrich},
  year = {2021},
  url = {https://fis.uni-bamberg.de/handle/uniba/114328},
  language = {eng},
  abstract = {Physics-based logic puzzle games present diverse challenges for AI, primarily related to coping with uncertainty in complex continuous environments. As these challenges tie in with the goals of qualitative reasoning (QR), in particular to plan, predict and diagnose physical mechanisms, these games pose a natural benchmark for QR. In this paper we consider the projectile collision games Angry Birds by Rovio Entertainment on which the AI bench- mark AIBirds is based. We investigate whether a qualitative approach to action planning under uncertainty proposed by Ge et al. (2016) can be adapted to the domain of Angry Birds in order to identify targets hittable by multiple rebounds. It turns out that the search space for solving Angry Birds is complexly structured and a fine-grained decomposition is required, leading to high computational costs. This paper presents an analysis of the problem and discusses means to overcome the problems faced. We propose an improved qualitative prediction method that is able to solve hard levels, yet it also suggests the need of complementary methods.},
  keywords = {physical reasoning, qualitative simulation, action planning}
}

@article{sioutis2021_109605,
  title = {On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning},
  author = {Sioutis, Michael and Paparrizou, Anastasia and Janhunen, Tomi},
  year = {2021},
  journal = {Information and computation},
  volume = {280},
  number = {104638},
  publisher = {Elsevier},
  address = {Amsterdam},
  issn = {1090-2651},
  doi = {10.1016/j.ic.2020.104638},
  url = {https://fis.uni-bamberg.de/handle/uniba/109605},
  language = {eng}
}

@inproceedings{sioutis2021_56864,
  title = {Towards Robust Qualitative Spatio-Temporal Reasoning for Hybrid AI Systems},
  author = {Sioutis, Michael and Meng, Hua},
  year = {2021},
  pages = {426-430},
  publisher = {IEEE},
  doi = {10.1109/ISKE54062.2021.9755429},
  url = {https://fis.uni-bamberg.de/handle/uniba/56864},
  language = {eng}
}

@article{sioutis2021_55354,
  title = {Dynamic branching in qualitative constraint-based reasoning via counting local models},
  author = {Sioutis, Michail and Wolter, Diedrich},
  year = {2021},
  journal = {Information and Computation},
  volume = {281},
  number = {December 2021, 104787},
  publisher = {Elsevier},
  address = {Amsterdam},
  issn = {0890-5401},
  doi = {10.1016/j.ic.2021.104787},
  url = {https://fis.uni-bamberg.de/handle/uniba/55354},
  language = {eng}
}

@inproceedings{wehner2021_55353,
  title = {On Robust Vs Fast Solving of Qualitative Constraints},
  author = {Wehner, Jan and Sioutis, Michail and Wolter, Diedrich},
  year = {2021},
  booktitle = {2021 IEEE 33rd International Conference on Tools with Artificial Intelligence : ICTAI 2021 : virtual conference, 1-3 November 2021 : proceedings},
  pages = {801-805},
  publisher = {IEEE},
  address = {Piscataway, NJ},
  isbn = {978-1-6654-0898-1},
  doi = {10.1109/ICTAI52525.2021.00128},
  url = {https://fis.uni-bamberg.de/handle/uniba/55353},
  language = {eng}
}

@article{yousaf2021_55351,
  title = {A reasoning model for geo-referencing named and unnamed spatial entities in natural language place descriptions},
  author = {Yousaf, Madiha and Wolter, Diedrich},
  year = {2021},
  journal = {Spatial cognition and computation : an interdisciplinary journal},
  pages = {1-39},
  publisher = {Taylor \& Francis},
  address = {London [u.a.]},
  issn = {1542-7633},
  doi = {10.1080/13875868.2021.2002872},
  url = {https://fis.uni-bamberg.de/handle/uniba/55351},
  language = {eng}
}

@inproceedings{sioutis2021_53749,
  title = {Qualitative Spatial and Temporal Reasoning : Current Status and Future Challenges},
  author = {Sioutis, Michael and Wolter, Diedrich},
  year = {2021},
  pages = {4594-4601},
  isbn = {978-0-9992411-9-6},
  doi = {10.24963/ijcai.2021/624},
  url = {https://fis.uni-bamberg.de/handle/uniba/53749},
  language = {eng}
}

@incollection{wolter2020_55363,
  title = {Wissen über Raum und Zeit},
  author = {Wolter, Diedrich and Özgür, L. Özçep},
  year = {2020},
  booktitle = {Handbuch der Künstlichen Intelligenz},
  pages = {101-142},
  publisher = {De Gruyter},
  address = {Berlin/Boston},
  edition = {6},
  isbn = {9783110659948},
  doi = {10.1515/9783110659948-004},
  url = {https://fis.uni-bamberg.de/handle/uniba/55363},
  language = {deu}
}

@inproceedings{sioutis2020_55358,
  title = {Dynamic Branching in Qualitative Constraint Networks via Counting Local Models},
  author = {Sioutis, Michail and Wolter, Diedrich},
  year = {2020},
  booktitle = {27th International Symposium on Temporal Representation and Reasoning : TIME 2020, September 23–25, 2020, Bozen-Bolzano, Italy},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing},
  address = {Saarbrücken/Wadern},
  series = {LIPIcs - Leibniz International Proceedings in Informatics},
  isbn = {978-3-95977-167-2},
  doi = {10.4230/LIPICS.TIME.2020.12},
  url = {https://fis.uni-bamberg.de/handle/uniba/55358},
  language = {eng}
}

@inproceedings{lutfuozcep2020_55357,
  title = {Cones, Negation, and All That},
  author = {Lütfü Özçep, Özgür and Leemhuis, Mena and Wolter, Diedrich},
  year = {2020},
  booktitle = {KI 2020: Advances in Artificial Intelligence : 43rd German Conference on AI, Bamberg, Germany, September 21–25, 2020, Proceedings},
  pages = {235-239},
  publisher = {Springer International Publishing},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-030-58285-2},
  doi = {10.1007/978-3-030-58285-2\_17},
  url = {https://fis.uni-bamberg.de/handle/uniba/55357},
  language = {eng}
}

@inproceedings{leemhuis2020_55356,
  title = {Multi-label Learning with a Cone-Based Geometric Model},
  author = {Leemhuis, Mena and Lütfü Özçep, Özgür and Wolter, Diedrich},
  year = {2020},
  booktitle = {Ontologies and Concepts in Mind and Machine : 25th International Conference on Conceptual Structures, ICCS 2020, Bolzano, Italy, September 18–20, 2020, Proceedings},
  pages = {177-185},
  publisher = {Springer},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-030-57855-8},
  doi = {10.1007/978-3-030-57855-8\_13},
  url = {https://fis.uni-bamberg.de/handle/uniba/55356},
  language = {eng}
}

@inproceedings{schmid2020_55355,
  title = {KI 2020: advances in artificial intelligence : 43rd German Conference on AI, Bamberg, Germany, September 21–25, 2020, proceedings},
  editor = {Schmid, Ute and Klügl, Franziska and Wolter, Diedrich},
  year = {2020},
  publisher = {Springer},
  address = {Cham, Switzerland},
  series = {Lecture notes in computer science; Lecture notes in artificial intelligence},
  isbn = {9783030582845},
  doi = {10.1007/978-3-030-58285-2},
  url = {https://fis.uni-bamberg.de/handle/uniba/55355},
  language = {eng}
}

@inproceedings{lutfuozcep2020_55352,
  title = {Cone Semantics for Logics with Negation},
  author = {Lütfü Özçep, Özgür and Leemhuis, Mena and Wolter, Diedrich},
  year = {2020},
  booktitle = {Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence (IJCAI-20)},
  pages = {1820-1826},
  publisher = {AAAI},
  isbn = {978-0-9992411-6-5},
  doi = {10.24963/ijcai.2020/252},
  url = {https://fis.uni-bamberg.de/handle/uniba/55352},
  language = {eng}
}

@article{sioutis2020_55183,
  title = {Just-In-Time Constraint-Based Inference for Qualitative Spatial and Temporal Reasoning},
  author = {Sioutis, Michael},
  year = {2020},
  journal = {KI - Künstliche Intelligenz},
  volume = {34},
  number = {2},
  pages = {259-270},
  publisher = {Springer},
  address = {Berlin},
  issn = {1610-1987},
  doi = {10.1007/s13218-020-00652-z},
  url = {https://fis.uni-bamberg.de/handle/uniba/55183},
  language = {eng},
  abstract = {We discuss a research roadmap for going beyond the state of the art in qualitative spatial and temporal reasoning (QSTR). Simply put, QSTR is a major field of study in Artificial Intelligence that abstracts from numerical quantities of space and time by using qualitative descriptions instead (e.g., precedes, contains, is left of); thus, it provides a concise framework that allows for rather inexpensive reasoning about entities located in space or time. Applications of QSTR can be found in a plethora of areas and domains such as smart environments, intelligent vehicles, and unmanned aircraft systems. Our discussion involves researching novel local consistencies in the aforementioned discipline, defining dynamic algorithms pertaining to these consistencies that can allow for efficient reasoning over changing spatio-temporal information, and leveraging the structures of the locally consistent related problems with regard to novel decomposability and theoretical tractability properties. Ultimately, we argue for pushing the envelope in QSTR via defining tools for tackling dynamic variants of the fundamental reasoning problems in this discipline, i.e., problems stated in terms of changing input data. Indeed, time is a continuous flow and spatial objects can change (e.g., in shape, size, or structure) as time passes; therefore, it is pertinent to be able to efficiently reason about dynamic spatio-temporal data. Finally, these tools are to be integrated into the larger context of highly active areas such as neuro-symbolic learning and reasoning, planning, data mining, and robotic applications. Our final goal is to inspire further discussion in the community about constraint-based QSTR in general, and the possible lines of future research that we outline here in particular.},
  keywords = {Qualitative constraints, Spatio-temporal reasoning, Just-in-time inference, Local consistencies, Singleton checks, Dynamic algorithms, Decomposability, Adaptivity, Parallelization}
}

@article{long2020_53412,
  title = {Semi-Supervised Dimensionality Reduction by Linear Compression and Stretching},
  author = {Long, Zhiguo and Meng, Hua and Sioutis, Michael},
  year = {2020},
  journal = {IEEE access : practical research, open solutions},
  volume = {8},
  pages = {27308-27317},
  publisher = {IEEE},
  address = {New York, NY},
  issn = {2169-3536},
  doi = {10.1109/ACCESS.2020.2971562},
  url = {https://fis.uni-bamberg.de/handle/uniba/53412},
  language = {eng},
  abstract = {Dimensionality reduction is a fundamental and important research topic in the field of machine learning. This paper focuses on a dimensionality reduction technique that exploits semi-supervising information in the form of pairwise constraints; specifically, these constraints specify whether two instances belong to the same class or not. We propose two dual linear methods to accomplish dimensionality reduction under that setting. These two methods overcome the difficulty of maximizing between-class difference and minimizing within-class difference at the same time, by transforming the original data into a new space in such a way that the bi-objective problem is (almost) equivalently reduced to a single objective problem. Empirical evaluations on a broad range of public datasets show that the two proposed methods are superior to several existing methods for semi-supervised dimensionality reduction.},
  keywords = {dimensionality reduction, principal component analysis, eigenvalues, eigenfunctions, task analysis, clustering algorithms, linear programming}
}

@inproceedings{lichtenthaler2020_49185,
  title = {Requirements for a model-driven cloud-native migration of monolithic web-based applications},
  author = {Lichtenthäler, Robin and Prechtl, Mike and Schwille, Christoph and Schwartz, Tobias and Cezanne, Pascal and Wirtz, Guido},
  year = {2020},
  volume = {35},
  number = {1-2},
  pages = {89-100},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {2524-8510},
  doi = {10.1007/s00450-019-00414-9},
  url = {https://fis.uni-bamberg.de/handle/uniba/49185},
  language = {eng}
}

@article{freksa2018_55359,
  title = {Formal Representation of Qualitative Direction},
  author = {Freksa, Christian and van de Ven, Jasper and Wolter, Diedrich},
  year = {2018},
  journal = {International journal of geographical information science},
  volume = {32},
  number = {12},
  pages = {2514-2534},
  publisher = {Taylor \& Francis},
  address = {London},
  issn = {1362-3087},
  doi = {10.1080/13658816.2017.1420794},
  url = {https://fis.uni-bamberg.de/handle/uniba/55359},
  language = {eng}
}

@inproceedings{steuer2018_49612,
  title = {Feinstaub selbst messen: Datenqualität in einem Citizen-Science-Projekt},
  author = {Steuer, Simon and Beetz, Florian and Geißelbrecht, Martin and Kaiser, F. P. and Nicklas, Daniela and Nikol, G. M.},
  year = {2018},
  booktitle = {Sensoren und Messsysteme : Beiträge der 19. ITG/GMA-Fachtagung 26. - 27. Juni 2018 in Nürnberg},
  pages = {532-535},
  publisher = {VDE Verlag GmbH},
  address = {Berlin ; Offenbach},
  isbn = {978-3-8007-4683-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/49612},
  language = {deu}
}

@inproceedings{schwartz2018_49549,
  title = {A Variant of Monte-Carlo Tree Search for Referring Expression Generation},
  author = {Schwartz, Tobias and Wolter, Diedrich},
  year = {2018},
  booktitle = {KI 2018: Advances in Artificial Intelligence : 41st German Conference on AI, Berlin, Germany, September 24–28, 2018, Proceedings},
  pages = {315-326},
  publisher = {Springer International},
  address = {Cham},
  isbn = {978-3-030-00110-0},
  doi = {10.1007/978-3-030-00111-7\_27},
  url = {https://fis.uni-bamberg.de/handle/uniba/49549},
  language = {eng}
}

@article{wolter2017_55360,
  title = {Smart Environments : What is it and Why Should We Care?},
  author = {Wolter, Diedrich and Kirsch, Alexandra},
  year = {2017},
  journal = {Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen},
  volume = {31},
  number = {3},
  pages = {231-237},
  publisher = {Springer},
  address = {Berlin},
  issn = {1610-1987},
  doi = {10.1007/s13218-017-0498-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/55360},
  language = {eng}
}

@inproceedings{wolter2017_43007,
  title = {Georeferencing River Networks Using Spatial Reasoning},
  author = {Wolter, Diedrich and Blank, Daniel and Henrich, Andreas},
  year = {2017},
  booktitle = {GIR'17 : Proceedings of the 11th Workshop on Geographic Information Retrieval},
  publisher = {ACM},
  address = {New York, NY, USA},
  isbn = {978-1-4503-5338-0},
  doi = {10.1145/3155902.3155907},
  url = {https://fis.uni-bamberg.de/handle/uniba/43007},
  language = {eng},
  abstract = {This paper is concerned with automatic georeferencing of river networks from raster images such as aerial photos or maps. Determining reasonable assignments between a given network of rivers derived from a textual description and an image is subject to high combinatorial complexity and uncertainty. We investigate the application of spatial reasoning in automatic georeferencing.},
  keywords = {georeferencing river networks, spatial reasoning, GIS}
}

@article{mast2016_55361,
  title = {Probabilistic reference and grounding with PRAGR for dialogues with robots},
  author = {Mast, Vivien and Falomir, Zoe and Wolter, Diedrich},
  year = {2016},
  journal = {Journal of experimental \& theoretical artificial intelligence : JETAI},
  volume = {28},
  number = {5},
  pages = {889-911},
  publisher = {Taylor \& Francis},
  address = {London [u.a.]},
  issn = {1362-3079},
  doi = {10.1080/0952813X.2016.1154611},
  url = {https://fis.uni-bamberg.de/handle/uniba/55361},
  language = {eng}
}

@inproceedings{hopf2015_39645,
  title = {Identifying the Geographical Scope of Prohibition Signs},
  author = {Hopf, Konstantin and Dageförde, Florian and Wolter, Diedrich},
  year = {2015},
  booktitle = {Spatial Information Theory : 12th International Conference, COSIT 2015 Santa Fe, NM, USA, October 12–16, 2015, Proceedings},
  pages = {247-267},
  publisher = {Springer International Publishing},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-319-23374-1},
  doi = {10.1007/978-3-319-23374-1\_12},
  url = {https://fis.uni-bamberg.de/handle/uniba/39645},
  language = {eng}
}

@incollection{dylla2013_20957,
  title = {Algebraic Properties of Qualitative Spatio-Temporal Calculi},
  author = {Dylla, Frank and Mossakowski, Till and Schneider, Thomas and Wolter, Diedrich},
  year = {2013},
  booktitle = {Spatial Information Theory : 11th International Conference, COSIT 2013, Scarborough, UK, September 2-6, 2013 ; proceedings},
  pages = {516-536},
  publisher = {Springer},
  address = {Berlin [u.a.]},
  series = {Lecture notes in computer science},
  doi = {10.1007/978-3-319-01790-7\_28},
  url = {https://fis.uni-bamberg.de/handle/uniba/20957},
  language = {eng},
  abstract = {Qualitative spatial and temporal reasoning is based on so-called qualitative calculi. Algebraic properties of these calculi have several implications on reasoning algorithms. But what exactly is a qualitative calculus? And to which extent do the qualitative calculi proposed meet these demands? The literature provides various answers to the first question but only few facts about the second. In this paper we identify the minimal requirements to binary spatio-temporal calculi and we discuss the relevance of the according axioms for representation and reasoning. We also analyze existing qualitative calculi and provide a classification involving different notions of relation algebra.},
  keywords = {Qualitative Spatial Reasoning}
}

