Representation Theorems in Computer Science: A Treatment in Logic Engineering

ISBN-13: 9783030257873 / Angielski / Miękka / 2020 / 190 str.

?zg?r L?tf? ?z?ep

Spis treści

1 Introduction.- 2 Preliminaries.- 3 Representing Spatial Relatedness.- 4 Scalable Spatio-Thematic Query Answering.- 5 Representation Theorems for Stream Processing.- 6 High-Level Declarative Stream Processing.- 7 Representation for Belief Revision.- 8 Conclusion.

O autorze

​Özgür L. Özçep is a researcher and lecturer (Privatdozent) at the University of Lübeck. His research as well as his teaching covers foundational aspects of computer science with a focus on logical and mathematical modelling for AI related domains and problems. He has published in the areas of belief revision, description logics, ontologies, qualitative spatial reasoning, and stream processing.

Blurb

Formal specifications are an important tool for the construction, verification and analysis of systems, since without it is hardly possible to explain whether a system worked correctly or showed an expected behavior. This book proposes the use of representation theorems as a means to develop an understanding of all models of a specification in order to exclude possible unintended models, demonstrating the general methodology with representation theorems for applications in qualitative spatial reasoning, data stream processing, and belief revision.

For qualitative spatial reasoning, it develops a model of spatial relatedness that captures the scaling context with hierarchical partitions of a spatial domain, and axiomatically characterizes the resulting relations. It also shows that various important properties of stream processing, such as prefix-determinedness or various factorization properties can be axiomatized, and that the axioms are fulfilled by natural classes of stream functions. The third example is belief revision, which is concerned with the revision of knowledge bases under new, potentially incompatible information. In this context, the book considers a subclass of revision operators, namely the class of reinterpretation operators, and characterizes them axiomatically. A characteristic property of reinterpretation operators is that of dissolving potential inconsistencies by reinterpreting symbols of the knowledge base.

Intended for researchers in theoretical computer science or one of the above application domains, the book presents results that demonstrate the use of representation theorems for the design and evaluation of formal specifications, and provide the basis for future application-development kits that support application designers with automatically built representations.