Institute of Informatics Systems

Novosibirsk, Russia

Institute of Informatics Systems

Novosibirsk, Russia
SEARCH FILTERS
Time filter
Source Type

Demin A.,Institute of Informatics Systems | Ponomaryov D.,Institute of Informatics Systems | Vityaev E.,Institute of Mathematics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2012

We generalize the main notions of Formal Concept Analysis with the ideas of the semantic probabilistic inference. We demonstrate that under standard restrictions, our definitions completely correspond to the original notions of Formal Concept Analysis. From the point of view of applications, we propose a method of recovering concepts in formal contexts in presence of noise on data. © 2012 Springer-Verlag Berlin Heidelberg.


Ponomaryov D.,University of Ulm | Ponomaryov D.,Institute of Informatics Systems | Vlasov D.,Institute of Mathematics
CEUR Workshop Proceedings | Year: 2013

It is known that in Description Logics explicit concept definability is directly related to concept interpolation. The problem to decide whether a concept is definable under a TBox wrt a signature usually reduces to entailment in the underlying logic. If an explicit definition exists, then it can be found as a concept interpolant for a concept inclusion entailed by an appropriately chosen TBox. In fact, it can be extracted from a corresponding proof of the concept inclusion. We describe a graph structure called enriched model that represents proofs in normalized EL-TBoxes and show that, built once for a normalization of a given TBox T it can be used for deciding the existence or direct computation of explicit definitions of concepts under arbitrary subsets of axioms of T and wrt different subsignatures of T Solving this computational problem has applications in collaborative ontology engineering and is an important part of the recently proposed algorithms for ontology decomposition.


Ponomaryov D.,Institute of Informatics Systems | Omelianchuk N.,RAS Institute of Cytology and Genetics | Mironova V.,RAS Institute of Cytology and Genetics | Zalevsky E.,Novosibirsk State University | And 3 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

We report on the development progress of the AGNS (Arabidopsis gene net supplementary) database and a AGNS-based information system for automation of research on the morphogenesis of Arabidopsis thaliana (L.), a well-known model plant in system biology. © 2011 Springer-Verlag.


Emelyanov P.,Institute of Informatics Systems | Ponomaryov D.,Institute of Informatics Systems
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

Disjoint AND-decomposition of a boolean formula means its representation as a conjunction of two (or several) formulas having disjoint sets of variables. We show that deciding AND-decomposability is intractable in general for boolean formulas given in CNF or DNF and prove tractability of computing AND-decompositions of boolean formulas given in positive DNF, Full DNF, and ANF. The results follow from tractability of multilinear polynomial factorization over the finite field of order 2, for which we provide a polytime factorization algorithm based on identity testing for partial derivatives of multilinear polynomials. © Springer-Verlag Berlin Heidelberg 2015.


Kasyanov V.N.,Institute of Informatics Systems
WSEAS Transactions on Systems | Year: 2013

In the paper, we consider a practical and general graph formalism called hierarchical graphs and graph models. It is suited for visual processing and can be used in many areas where the strong structuring of information is needed. We present also the Higres, Visual Graph and ALVIS systems that are aimed at supporting of structural information visualization on the base hierarchical graph modes.


Kasyanov V.,Institute of Informatics Systems
Enterprise Information Systems | Year: 2013

Sisal 3.2 is a new input language of system of functional programming (SFP) which is under development at the Institute of Informatics Systems in Novosibirsk as an interactive visual environment for supporting of scientific parallel programming. This paper contains an overview of Sisal 3.2 and a description of its new features compared with previous versions of the SFP input language such as the multidimensional array support, new abstractions like parametric types and generalised procedures, more flexible user-defined reductions, improved interoperability with other programming languages and specification of several optimising source text annotations. © 2013 Copyright Taylor and Francis Group, LLC.


Kasyanov V.N.,Institute of Informatics Systems | Kasyanova E.V.,Institute of Informatics Systems
Enterprise Information Systems | Year: 2013

Information visualisation is a key component of support tools for many applications in science and engineering. A graph is an abstract structure that is widely used to model information for its visualisation. In this paper, we consider practical and general graph formalism called hierarchical graphs and present the Higres and Visual Graph systems aimed at supporting information visualisation on the base of hierarchical graph models. © 2013 Copyright Taylor and Francis Group, LLC.


Kasyanov V.N.,Institute of Informatics Systems | Zolotuhin T.A.,Novosibirsk State University
Scientific Visualization | Year: 2015

The paper is devoted to the Visual Graph system being under development by the laboratory for Program construction and optimization of Institute of Informatics Systems as an universal system for visualization of big size complex structural information on the base of hierarchical graph models.

Loading Institute of Informatics Systems collaborators
Loading Institute of Informatics Systems collaborators