Logic Abstraction Operations and their Algorithmic Implementation

Abstract

The article deals with logic abstraction operations, such as isolation, identification and generalization and their algorithmic implementation using the meta-programming language Sympl that is being developed by the author. As part of the implemented logic operations, new data types such as “identification set", "concept", “notion” and "category" were implemented. The data type “identification set” represents sets, the elements of which all have either common properties or relations and are the result of the application of identification operation to logical objects. The data type “concept” is used for representation of concepts that are results of application of identification and generalization operations and is represented by two daughter data types (subtypes): “notion” and “category”. The “notion” data type represents the result of application of abstraction of generalization to an identification set. The application of abstraction of generalization two (or more times) results in a “category” data type - an extremely broad notion. The developed algorithms can be applied in text analysis when words are presented as logical objects: for finding synonyms, functionally similar personages or objects by their description and activities and so on.