Denis K. Ponomaryov

Learn More
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed as an indispensible tool. A basic such mechanism is the automatic decomposition of the vocabulary of an ontology into independent parts. In this paper, we study decompositions that(More)
In the paper, a natural class of logical calculi is fixed for which we formulate the notion of a ∆–decomposable set of formulas. We demonstrate that the property of uniqueness of signature decompositions holds in those calculi of this class that have the Craig interpolation property. In conclusion, we give a sufficient condition for the ∆–decomposability(More)
We present an approach for integrating ontological reasoning and planning within cognitive systems. Patterns and mechanisms that suitably link planning domains and interrelated knowledge in an ontology are devised. In particular, this enables the use of (standard) ontology reasoning for extending a (hierarchical) planning domain. Furthermore, explanations(More)
The integration of the various specialized components of cognitive systems poses a challenge, in particular for those architectures that combine planning, inference, and human-computer interaction (HCI). An approach is presented that exploits a single source of common knowledge contained in an ontology. Based upon the knowledge contained in it, specialized(More)
An inductive probabilistic approach to formal concept analysis (FCA) is proposed in which probability on formal contexts is considered; probabilistic formal concepts that have predictive force are defined: nonclassified objects can be assigned to earlier found probabilistic formal concepts; random attributes are eliminated from probabilistic formal(More)
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(More)
We prove that each elementary theory has a unique decomposition into indecomposable components and formulate a decomposability criterion. Definition 1 A theory T of signature Σ is called decomposable, if T is the deductive closure in the predicate calculus of signature Σ of all sentences of some theories S1 and S2 with the disjoint signatures Σ1 and Σ2,(More)
AND-decomposition of a boolean formula means finding two (or several) formulas such that their conjunction is equivalent to the given one. Decomposition is called disjoint if the component formulas do not have variables in common. In the paper, we show that deciding AND-decomposability is intractable for boolean formulas given in CNF or DNF and prove(More)
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(More)