國立虎尾科技大學 |

Representation Theorems in Computer Science = A Treatment in Logic Engineering /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Representation Theorems in Computer Science/ by Özgür Lütfü Özçep.
Reminder of title:	A Treatment in Logic Engineering /
Author:	Özçep, Özgür Lütfü.
Description:	XIV, 190 p.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computers. -
Online resource:	https://doi.org/10.1007/978-3-030-25785-9
ISBN:	9783030257859

Representation Theorems in Computer Science = A Treatment in Logic Engineering /
Özçep, Özgür Lütfü.

Representation Theorems in Computer ScienceA Treatment in Logic Engineering /[electronic resource] :by Özgür Lütfü Özçep. - 1st ed. 2019. - XIV, 190 p.online resource.

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.

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.

ISBN: 9783030257859

Standard No.: 10.1007/978-3-030-25785-9doiSubjects--Topical Terms:

565115
Computers.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Representation Theorems in Computer Science = A Treatment in Logic Engineering /
LDR:03496nam a22004215i 4500 001 1014284
003 DE-He213
005 20200705090249.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030257859 $9 978-3-030-25785-9
024 7 $a 10.1007/978-3-030-25785-9 $2 doi
035 $a 978-3-030-25785-9
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Özçep, Özgür Lütfü. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1308507
245 1 0 $a Representation Theorems in Computer Science $h [electronic resource] : $b A Treatment in Logic Engineering / $c by Özgür Lütfü Özçep.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIV, 190 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a 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.
520 $a 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.
650 0 $a Computers. $3 565115
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer logic. $3 786340
650 0 $a Data mining. $3 528622
650 0 $a Information storage and retrieval. $3 1069252
650 1 4 $a Theory of Computation. $3 669322
650 2 4 $a Logic in AI. $3 1228083
650 2 4 $a Data Mining and Knowledge Discovery. $3 677765
650 2 4 $a Information Storage and Retrieval. $3 593926
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030257842
776 0 8 $i Printed edition: $z 9783030257866
776 0 8 $i Printed edition: $z 9783030257873
856 4 0 $u https://doi.org/10.1007/978-3-030-25785-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)