Incomplete Information: Structure, Inference, Complexity

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

The construction of any broadly understood theory of information or infor­ mation processing system involves two major methodological processes: (1) abstraction and analysis, (2) reasoning and computing. This monograph is a realisation of these two processes in relation to the study of incompleteness of information. The paradigm we are working with is inspired by a rough-set approach to data analysis: the formalisms we develop enable the use of a non­ invasive data representation. This means that the only information which is and must be used in the process of analysis is the actual information that is to be analysed; we do not require any additional sources of information. An abstraction is formed in the process of conception, design, and develop­ ment of structures. Then analysis leads to a selection of a class of structures. In this book we delineate a class of informational structures that enable us to represent both numerical and non-numerical information and we analyse var­ ious manifestations of its incompleteness. We discuss several general types of incompleteness of information which are grounded in a rough-set-style view of imprecision and uncertainty. Manifestations of these types of incompleteness in information systems are investigated.

Author(s): Stéphane P. Demri, Ewa S. Orłowska
Series: Monographs in Theoretical Computer Science An EATCS Series
Publisher: Springer
Year: 2002

Language: English
Pages: 414
Tags: Mathematical Logic and Formal Languages; Models and Principles; Information Storage and Retrieval; Artificial Intelligence (incl. Robotics); Algorithm Analysis and Problem Complexity

Front Matter....Pages I-XVIII
Mathematical Prerequisites....Pages 1-12
Front Matter....Pages 13-13
Structures of Information....Pages 15-36
Information Relations Derived from Information Systems....Pages 37-69
Information Operators Derived from Information Systems....Pages 71-90
Front Matter....Pages 91-91
Towards Information Logics....Pages 93-116
Techniques for Information Logics....Pages 117-136
Front Matter....Pages 137-137
Reasoning About Similarity....Pages 139-170
Reasoning About Indiscernibility....Pages 171-192
Reasoning About Knowledge....Pages 193-216
Front Matter....Pages 217-217
Information Logics Versus Standard Modal Logics....Pages 219-241
Decidability of Information Logics....Pages 243-266
Complexity of Information Logics....Pages 267-293
Front Matter....Pages 295-295
Informational Representability....Pages 297-320
Informational Interpretation of Standard Algebraic Structures....Pages 321-354
Information Algebras....Pages 355-377
Back Matter....Pages 379-408