Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a dynamical system. In model checking, the system’s behaviour is described by a transition system, and one needs to check whether all possible traces of this transition system satisfy the formula. In runtime verification, one observes the actual system behaviour, which at any point in time yields a finite prefix of a trace. The task is then to check whether all continuations of this prefix to a trace satisfy (violate) the formula. More precisely, one wants to construct a monitor, i.e., a finite automaton that receives the finite prefix as input and then gives the right answer based on the state currently reached. In this paper, we extend the known approaches to LTL runtime verification in two directions. First, instead of propositional LTL we use the more expressive temporal logic ALC-LTL, which can use axioms of the Description Logic (DL) ALC instead of propositional variables to describe properties of single states of the system. Second, instead of assuming that the observed system behaviour provides us with complete information about the states of the system, we assume that states are described in an incomplete way by ALC-knowledge bases. We show that also in this setting monitors can effectively be constructed. The (double-exponential) size of the constructed monitors is in fact optimal, and not higher than in the propositional case. As an auxiliary result, we show how to construct Büchi automata for ALC-LTL-formulae, which yields alternative proofs for the known upper bounds of deciding satisfiability in ALC-LTL.

In addition to the hydromorphological pressure on the ecological conditions of free-flowing river courses, increasing water temperature is affecting the water bodies, particularly by changing freshwater community compositions. The low discharge of numerous European rivers in the dry and hot hydrological year 2022 proves this relevance. Therefore, ecological assessment tools such as habitat modeling should take these factors into account when assessing the quantity and quality of habitats. In this paper, the habitat modeling tool “Transient River Habitat Modeling for Macrozoobenthos” (TRiMM) is improved by incorporating a fuzzy logic approach and adding water temperature to the set of parameters determining habitat suitability for macrozoobenthos. Habitat-relevant parameters, including hydromorphological factors (depth, velocity, mineral and organic substrate) and a water quality factor (temperature), are combined in the habitat model so that it can more broadly characterize river physical conditions and their interactions with biological indicators. Habitat modeling employed the mentioned parameters to simulate suitability for the macrozoobenthos in a small river in central Saxony, Germany. Due to its deteriorated condition, this river was selected as a representative for thousands of kilometers of small rivers across the region, which have been restored. The model simulated the status quo of river conditions from spring to summer for three macrozoobenthos species (Ancylus fluviatilis, Ephemera danica and Gammarus fossarum). The results showed that the natural flow resulted in dynamic habitat suitability both spatially and temporally, which differs for each species. Remarkably, the five-parameter model (depth, velocity, temperature, mineral, and organic substrate) generally performed better compared to a similar model without temperature.

No description available.

Die vorliegende Dissertation besteht aus zwei Teilen, deren gemeinsames Thema in der Frage besteht, wie mächtig Zufall als Berechnungsressource ist. Im ersten Teil beschäftigen wir uns mit zufälligen Strukturen, die -- mit hoher Wahrscheinlichkeit -- Eigenschaften haben können, die von Computeralgorithmen genutzt werden können. In zwei konkreten Fällen geben wir bis dahin unbekannte deterministische Konstruktionen solcher Strukturen: Wir derandomisieren eine randomisierte Reduktion von Alekhnovich und Razborov, indem wir bestimmte unbalancierte bipartite Expandergraphen konstruieren, und wir geben eine Reduktion von einem Problem über bipartite Graphen auf das Problem, den minmax-Wert in Dreipersonenspielen zu berechnen. Im zweiten Teil untersuchen wir die Ausdrucksstärke verschiedener Logiken, wenn sie durch zufällige Relationssymbole angereichert werden. Unser Ziel ist es, Techniken aus der deskriptiven Komplexitätstheorie für die Untersuchung randomisierter Komplexitätsklassen nutzbar zu machen, und tatsächlich können wir zeigen, dass unsere randomisierten Logiken randomisierte Komlexitätsklassen einfangen, die in der Komplexitätstheorie untersucht werden. Unter Benutzung starker Ergebnisse über die Logik erster Stufe und die Berechnungsstärke von Schaltkreisen beschränkter Tiefe geben wir sowohl positive als auch negative Derandomisierungsergebnisse für unsere Logiken. Auf der negativen Seite zeigen wir, dass randomisierte erststufige Logik gegenüber normaler erststufiger Logik an Ausdrucksstärke gewinnt, sogar auf Strukturen mit einer eingebauten Additionsrelation. Außerdem ist sie nicht auf geordneten Strukturen in monadischer zweitstufiger Logik enthalten, und auch nicht in infinitärer Zähllogik auf beliebigen Strukturen. Auf der positiven Seite zeigen wir, dass randomisierte erststufige Logik auf Strukturen mit einem unären Vokabular derandomisiert werden kann und auf additiven Strukturen in monadischer Logik zweiter Stufe enthalten ist. / This thesis is comprised of two main parts whose common theme is the question of how powerful randomness as a computational resource is. In the first part we deal with random structures which possess -- with high probability -- properties than can be exploited by computer algorithms. We then give two new deterministic constructions for such structures: We derandomise a randomised reduction due to Alekhnovich and Razborov by constructing certain unbalanced bipartite expander graphs, and we give a reduction from a problem concerning bipartite graphs to the problem of computing the minmax-value in three-player games. In the second part we study the expressive power of various logics when they are enriched by random relation symbols. Our goal is to bridge techniques from descriptive complexity with the study of randomised complexity classes, and indeed we show that our randomised logics do capture complexity classes under study in complexity theory. Using strong results on the expressive power of first-order logic and the computational power of bounded-depth circuits, we give both positive and negative derandomisation results for our logics. On the negative side, we show that randomised first-order logic gains expressive power over standard first-order logic even on structures with a built-in addition relation. Furthermore, it is not contained in monadic second-order logic on ordered structures, nor in infinitary counting logic on arbitrary structures. On the positive side, we show that randomised first-order logic can be derandomised on structures with a unary vocabulary and is contained in monadic second-order logic on additive structures.

Die vorliegende Arbeit beschäftigt sich mit der Entwicklung einer Methode zur Wertermittlung von bergbaubeeinflussten Immobilien, welche die wesentlichen Bergbaurisiken berücksichtigt. Die Untersuchungen ergaben, dass das Risiko von Investitionen in bergbaubeeinflusste Immobilien durchschnittlich dreimal größer ist als das Risiko von Investitionen in Immobilien ohne Bergbaueinflüsse. Für die Ermittlung des Risikos kamen eine immobilien- und eine bergbauspezifische Komponente zum Einsatz. Letztere umfasst Prognosen zu potentiellen Oberflächenvernässungen, zur Sickerwassergefahr und zu bergbaubedingten Wertminderungen von Gebäuden unter besonderer Berücksichtigung der Gebäudeempfindlichkeit gegenüber bergbauinduzierten Bodenbewegungen. Für die Wertermittlung von Immobilien kam das Discounted Cash Flow-Verfahren zur Anwendung. Der Diskontfaktor wurde mit Hilfe eines speziell entwickelten Fuzzy-Modells bestimmt. Die erstellte Bewertungsmethode kann als relevante Entscheidungshilfe für Investitionen in Bergbaugebiete dienen.

The original and still a major purpose of ontologies in computer and information sciences is to serve for the semantic integration of represented content, facilitating information system interoperability. Content can be data, information, and knowledge, and it can be distributed within or across these categories. A myriad of languages is available for representation. Ontologies themselves are artifacts which are expressed in various languages. Different such languages are utilized today, including, as well-known representatives, predicate logic, subsuming first-order (predicate) logic (FOL), in particular, and higher-order (predicate) logic (HOL); the Web Ontology Language (OWL) on the basis of description logics (DL); and the Unified Modeling Language (UML). We focus primarily on languages with formally defined syntax and semantics. This overall picture immediately suggests questions of the following kinds: What is the relationship between an ontology and the language in which it is formalized? Especially, what is the impact of the formal semantics of the language on the formalized ontology? How well understood is the role of ontologies in semantic integration? Can the same ontology be represented in multiple languages and/or in distinct ways within one language? Is there an adequate understanding of whether two expressions are intensionally/conceptually equivalent and whether two ontologies furnish the same ontological commitments? One may assume that these questions are resolved. Indeed, the development and adoption of ontologies is widespread today. Ontologies are authored in a broad range of different languages, including offering equally named ontologies in distinct languages. Much research is devoted to techniques and technologies that orbit ontologies, for example, ontology matching, modularization, learning, and evolution, to name a few. Ontologies have found numerous beneficial applications, and hundreds of ontologies have been created, considering solely the context of biomedical research. For us, these observations increase the relevance of the stated questions and close relatives thereof, and raise the desire for solid theoretical underpinnings. In the literature of computer and information sciences, we have found only few approaches that tackle the foundations of ontologies and their representation to allow for answering such questions or that actually answer them. We elaborate an analysis of the subject as the first item of central contributions within this thesis. It mainly results in the identification of a vicious circularity in (i) the intended use of ontologies to mediate between formal representations and (ii) solely exploiting formal semantic notions in representing ontologies and defining ontology-based equivalence as a form of intensional/conceptual equivalence. On this basis and in order to overcome its identified limitations, we contribute a general model-theoretic semantic account, named \\\"ontological semantics\\\". This kind of semantics takes the approach of assigning arbitrary entities as referents of atomic symbols and to link syntactic constructions with corresponding ontological claims and commitments. In particular, ontological semantics targets the avoidance of encoding effects in its definition. Therefore we argue that this semantic account is well suited for interpreting formalized ontologies and for defining languages for the representation of ontologies. It is further proposed as a fundament for envisioned novel definitions of the intensional equivalence of expressions, in potential deviation from only being formally equivalent under set-theoretic semantics. The thesis is defended that a particular usage of a formalism and its respective vocabulary should be accompanied by establishing an ontological semantics that is tailored to that use of the formalism, in parallel to the formal semantics of the language, in order to capture the ontological content of the formal representation for adequate reuse in other formalisms. Accordingly, we advocate ontological semantics as a useful framework for justifying translations on an intensional basis. Despite all deviations of ontological semantics from its set-theoretic blueprint, close relationships between the two can be shown, which allow for using established FOL and DL reasoners while assuming ontological semantics.

Recently, multi-priced timed automata have received much attention for real-time systems. These automata extend priced timed automata by featuring several price parameters. This permits to compute objectives like the optimal ratio between rewards and costs. Arising from the model of timed automata, the multi-weighted setting has also attracted much notice for classical nondeterministic automata. The present thesis develops multi-weighted MSO-logics on finite, infinite and timed words which are expressively equivalent to multi-weighted automata, and studies decision problems for them. In addition, a Nivat-like theorem for weighted timed automata is proved; this theorem establishes a connection between quantitative and qualitative behaviors of timed automata. Moreover, a logical characterization of timed pushdown automata is given.

The original and still a major purpose of ontologies in computer and information sciences is to serve for the semantic integration of represented content, facilitating information system interoperability. Content can be data, information, and knowledge, and it can be distributed within or across these categories. A myriad of languages is available for representation. Ontologies themselves are artifacts which are expressed in various languages. Different such languages are utilized today, including, as well-known representatives, predicate logic, subsuming first-order (predicate) logic (FOL), in particular, and higher-order (predicate) logic (HOL); the Web Ontology Language (OWL) on the basis of description logics (DL); and the Unified Modeling Language (UML). We focus primarily on languages with formally defined syntax and semantics. This overall picture immediately suggests questions of the following kinds: What is the relationship between an ontology and the language in which it is formalized? Especially, what is the impact of the formal semantics of the language on the formalized ontology? How well understood is the role of ontologies in semantic integration? Can the same ontology be represented in multiple languages and/or in distinct ways within one language? Is there an adequate understanding of whether two expressions are intensionally/conceptually equivalent and whether two ontologies furnish the same ontological commitments? One may assume that these questions are resolved. Indeed, the development and adoption of ontologies is widespread today. Ontologies are authored in a broad range of different languages, including offering equally named ontologies in distinct languages. Much research is devoted to techniques and technologies that orbit ontologies, for example, ontology matching, modularization, learning, and evolution, to name a few. Ontologies have found numerous beneficial applications, and hundreds of ontologies have been created, considering solely the context of biomedical research. For us, these observations increase the relevance of the stated questions and close relatives thereof, and raise the desire for solid theoretical underpinnings. In the literature of computer and information sciences, we have found only few approaches that tackle the foundations of ontologies and their representation to allow for answering such questions or that actually answer them. We elaborate an analysis of the subject as the first item of central contributions within this thesis. It mainly results in the identification of a vicious circularity in (i) the intended use of ontologies to mediate between formal representations and (ii) solely exploiting formal semantic notions in representing ontologies and defining ontology-based equivalence as a form of intensional/conceptual equivalence. On this basis and in order to overcome its identified limitations, we contribute a general model-theoretic semantic account, named \\\"ontological semantics\\\". This kind of semantics takes the approach of assigning arbitrary entities as referents of atomic symbols and to link syntactic constructions with corresponding ontological claims and commitments. In particular, ontological semantics targets the avoidance of encoding effects in its definition. Therefore we argue that this semantic account is well suited for interpreting formalized ontologies and for defining languages for the representation of ontologies. It is further proposed as a fundament for envisioned novel definitions of the intensional equivalence of expressions, in potential deviation from only being formally equivalent under set-theoretic semantics. The thesis is defended that a particular usage of a formalism and its respective vocabulary should be accompanied by establishing an ontological semantics that is tailored to that use of the formalism, in parallel to the formal semantics of the language, in order to capture the ontological content of the formal representation for adequate reuse in other formalisms. Accordingly, we advocate ontological semantics as a useful framework for justifying translations on an intensional basis. Despite all deviations of ontological semantics from its set-theoretic blueprint, close relationships between the two can be shown, which allow for using established FOL and DL reasoners while assuming ontological semantics.:* Preface ** Abstract ** Contents ** Acknowledgments ** Foreword 1 Introduction 1.1 Background 1.2 Motivations 1.3 Theses, Objectives and Scope 1.4 Outline and Contributions 1.5 Formal Preliminaries 2 Foundations on Languages, Semantics, and Ontology 2.1 Formal Syntax and Formal Semantics 2.2 The Role of Ontologies in Semantic Integration 2.3 Ontological Analysis and Meta-Ontological Architecture 2.4 Conceptualization of Categories and Relations - CR 2.5 Summary of the Analysis and Next Steps 3 Views on Set-Theoretic Semantics of Classical Predicate Logics 3.1 Tarskian Model Theory and Set-Theoretic Superstructure 3.2 Formal Semantics and Choices for Entity Postulation 3.3 Theory View of Semantics 3.4 Aims for an Ontologically Neutral Semantic Account 4 Ontological Semantics 4.1 Definition of Ontological Structures by Analogy to the Set-Theoretic Approach 4.2 Properties and Further Background for Ontological Structures in General 4.3 Ontological Models & Signature Aspects 4.4 Semantics of Predication 4.5 Semantics of Connectives and Quantifiers & Semantic Notions 4.6 Relations between Ontological and Set-Theoretic Semantics 4.7 Ontological Neutrality 5 Ontological Engineering and Applications 5.1 Formalization Method for Ontology Representation in FOL 5.2 Ontological Usage Schemes 5.3 Glimpse on Characterizing Modular Representation 5.4 Applications in the Biomedical Domain 6 Contributions to Ontologies 6.1 Formalizations of Categories and Relations - CR 6.2 Remarks on Further Contributions 6.3 Ontologies of Time 7 Conclusion and Continuation 7.1 Resume 7.2 Related Work 7.3 Conclusions 7.4 Beginnings of Future Work Appendix A Additional Preliminaries A.1 Logical Notions A.2 Axiomatic Systems of Set and Number Theory B Axioms of the CR Taxonomy in OWL B.1 Asserted OWL Class Axioms B.2 Asserted OWL Object Property Axioms C Lists of Figures and Tables C.1 List of Figures C.2 List of Tables D Abbreviations, Acronyms and Names D.1 Abbreviations D.2 Acronyms and Names E References E.1 Literature References E.2 Web References/List of URLs F Work and Author Information ** Selbständigkeitserklärung (Declaration of Authorship) ** Bibliographic Data ** Scientific Record

Die vorliegende Arbeit beschäftigt sich mit der Entwicklung einer Methode zur Wertermittlung von bergbaubeeinflussten Immobilien, welche die wesentlichen Bergbaurisiken berücksichtigt. Die Untersuchungen ergaben, dass das Risiko von Investitionen in bergbaubeeinflusste Immobilien durchschnittlich dreimal größer ist als das Risiko von Investitionen in Immobilien ohne Bergbaueinflüsse. Für die Ermittlung des Risikos kamen eine immobilien- und eine bergbauspezifische Komponente zum Einsatz. Letztere umfasst Prognosen zu potentiellen Oberflächenvernässungen, zur Sickerwassergefahr und zu bergbaubedingten Wertminderungen von Gebäuden unter besonderer Berücksichtigung der Gebäudeempfindlichkeit gegenüber bergbauinduzierten Bodenbewegungen. Für die Wertermittlung von Immobilien kam das Discounted Cash Flow-Verfahren zur Anwendung. Der Diskontfaktor wurde mit Hilfe eines speziell entwickelten Fuzzy-Modells bestimmt. Die erstellte Bewertungsmethode kann als relevante Entscheidungshilfe für Investitionen in Bergbaugebiete dienen.

An assessment of tin-skarn resources in the Erzgebirge, Germany, was conducted with the 3-Part Method. For this purpose a Grade-Tonnage Model for this deposit type was established. A literature review produced grade and tonnage data for 23 skarn deposits, of which 9 are in the assessment area. Based on an existing predictive map created with an AI algorithm, seven permissive tracts with a total area of 776 km² were defined. To estimate the number of undiscovered deposits a panel of five experts in the economic geology of the Erzgebirge was assembled. From the expert estimates and the newly developed Grade-Tonnage Model the undiscovered ore and metal tonnages in each permissive tract were evaluated. In four of the seven tracts the probability of the existence of at least one undiscovered deposit is estimated to be greater than 50%, in permissive tract 2 it is even greater than 90%. In each of these tracts, the median assessed undiscovered ore tonnages are several million tons and the tin resources exceed 10,000 tons. For the most perspective tract (Permissive tract 2) the median estimates are 40.6 Million tons of ore with a tin content of 114,000 tons. For tungsten (tonnages calculated as WO3) the numbers are slightly lower. The results verify the high resource potential of tin skarns in the Erzgebirge and can be used to guide future exploration activities to the most economically promising permissive tracts.