Artem Revenko

  • Citations Per Year
Learn More
The classification of possible errors in object intents is given and some possibilities of exploring them are discussed. An approach for finding some types of errors in new object intents is introduced. This approach is based on finding implications from an implication basis of the context that are not respected by a new object. It is noted that this(More)
Errors in implicative theories coming from binary data are studied. First, two classes of errors that may affect implicative theories are singled out. Two approaches for finding errors of these classes are proposed, both of them based on methods of Formal Concept Analysis. The first approach uses the cardinality minimal (canonical or DuquenneGuigues)(More)
We suggest a classification of possible mistakes in lines of binary data tables (in formal contexts) and discuss their detection. An approach is proposed to detect some types of mistakes in new lines (contents of objects) of binary data tables (formal contexts). This approach is based on detecting those implications from implication bases of the formal(More)
Based on the technique for finding errors in new object intents a method of debugging source code is presented. This method is capable of finding strict implicative dependencies between lines of source code covered in successful and failed runs. The output is a logical expression. Using the new method it is possible to come closer to debugging programs on a(More)
This paper sheds light on how semantic technology can be a key driver for promoting financial awareness and capability, through the presentation of the ideas behind the PROFIT platform and its functionalities. The PROFIT platform is designed by the newly funded namesake EU project, as a solution catering to the exact need of action enhancement for greater(More)
The parametric expressibility of functions is a generalization of the expressibility via composition. All parametrically closed classes of functions (p-clones) form a lattice. For finite domains the lattice is shown to be finite, however straight-forward iteration over all functions is infeasible, and so far the p-indecomposable functions are only known for(More)