0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Databases

Buy Now

Incomplete Information: Structure, Inference, Complexity (Hardcover, 2002 ed.) Loot Price: R4,756
Discovery Miles 47 560
Incomplete Information: Structure, Inference, Complexity (Hardcover, 2002 ed.): Stephane P. Demri, Ewa Orlowska

Incomplete Information: Structure, Inference, Complexity (Hardcover, 2002 ed.)

Stephane P. Demri, Ewa Orlowska

Series: Monographs in Theoretical Computer Science. An EATCS Series

 (sign in to rate)
Loot Price R4,756 Discovery Miles 47 560 | Repayment Terms: R446 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

This monograph presents a systematic, exhaustive and up-to-date overview of formal methods and theories for data analysis and inference inspired by the concept of rough set. The book studies structures with incomplete information from the logical, algebraic and computational perspective. The formalisms developed are non-invasive in that only the actual information is needed in the process of analysis without external sources of information being required.The book is intended for researchers, lecturers and graduate students who wish to get acquainted with the rough set style approach to information systems with incomplete information.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Monographs in Theoretical Computer Science. An EATCS Series
Release date: July 2002
First published: 2002
Authors: Stephane P. Demri • Ewa Orlowska
Dimensions: 235 x 155 x 23mm (L x W x T)
Format: Hardcover
Pages: 408
Edition: 2002 ed.
ISBN-13: 978-3-540-41904-4
Categories: Books > Computing & IT > Applications of computing > Databases > General
LSN: 3-540-41904-7
Barcode: 9783540419044

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners