000 | 03973nam a22005415i 4500 | ||
---|---|---|---|
001 | 978-3-030-25785-9 | ||
003 | DE-He213 | ||
005 | 20240423125157.0 | ||
007 | cr nn 008mamaa | ||
008 | 190716s2019 sz | s |||| 0|eng d | ||
020 |
_a9783030257859 _9978-3-030-25785-9 |
||
024 | 7 |
_a10.1007/978-3-030-25785-9 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
100 | 1 |
_aÖzçep, Özgür Lütfü. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aRepresentation Theorems in Computer Science _h[electronic resource] : _bA Treatment in Logic Engineering / _cby Özgür Lütfü Özçep. |
250 | _a1st ed. 2019. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2019. |
|
300 |
_aXIV, 190 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _a1 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. | |
520 | _aFormal 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aLogic programming. | |
650 | 0 | _aData mining. | |
650 | 0 | _aInformation storage and retrieval systems. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aLogic in AI. |
650 | 2 | 4 | _aData Mining and Knowledge Discovery. |
650 | 2 | 4 | _aInformation Storage and Retrieval. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783030257842 |
776 | 0 | 8 |
_iPrinted edition: _z9783030257866 |
776 | 0 | 8 |
_iPrinted edition: _z9783030257873 |
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-030-25785-9 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c175099 _d175099 |