rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Representation Theorems in Computer Science
    sub title: A Treatment in Logic Engineering
  name:
    name part: Özçep, Özgür Lütfü.
    role:
      role term: creator
    role:
      role term: author.
    role:
      role term: aut
    role:
      role term: http://id.loc.gov/vocabulary/relators/aut
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2019
    edition: 1st ed. 2019.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIV, 190 p. online resource.
  abstract: 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.
  table of contents: 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.
  note: by Özgür Lütfü Özçep.
  subject:
    topic: Computers
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer logic
  subject:
    topic: Data mining
  subject:
    topic: Information storage and retrieval
  subject:
    topic: Theory of Computation
  subject:
    topic: Logic in AI
  subject:
    topic: Data Mining and Knowledge Discovery
  subject:
    topic: Information Storage and Retrieval
  classification: QA75.5-76.95
  classification: QA76.63
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  identifier: 9783030257859
  identifier: https://doi.org/10.1007/978-3-030-25785-9
  record info:
    record creation date: 190716
    record change date: 20191025182700.0
    record identifier: 978-3-030-25785-9