ORDER STRUCTURE OF SYMBOLIC ASSERTION OBJECTS

• Type: Another Publication in an International Scientific Journal
• Date: 1994

Authors

brito, p (Author) Other

Journal

Title: IEEE Transactions on Knowledge and Data Engineering

Vol. 6

Pages: 830-835

ISSN: 1041-4347

Publisher: IEEE

Indexing

ISI Web of Knowledge - 7 Citations

Scopus - 22 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-001-JH0

DOI: 10.1109/69.317710

Abstract (EN): We study assertion objects that constitute a particular class of symbolic objects. Symbolic objects constitute a data analysis driven formalism, which can be compared to propositional calculus, but which is oriented toward the duality intension (characteristic properties) versus extension (set of all individuals verifying a given set of properties). The set of assertion objects is endowed with a partial order and a quasi-order. We focus on the property of completeness, which precisely expresses the duality intension-extension. The order structure of complete assertion objects is studied, using notions of lattice theory and Galois connection, and extending Wille's work to multiple-valued data. Two results are then obtained for particular cases.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 6