Arrow Research search

Author name cluster

Daria Stepanova 0001

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

ICLR Conference 2020 Conference Paper

Differentiable learning of numerical rules in knowledge graphs

  • Po-Wei Wang
  • Daria Stepanova 0001
  • Csaba Domokos
  • J. Zico Kolter

Rules over a knowledge graph (KG) capture interpretable patterns in data and can be used for KG cleaning and completion. Inspired by the TensorLog differentiable logic framework, which compiles rule inference into a sequence of differentiable operations, recently a method called Neural LP has been proposed for learning the parameters as well as the structure of rules. However, it is limited with respect to the treatment of numerical features like age, weight or scientific measurements. We address this limitation by extending Neural LP to learn rules with numerical values, e.g., ”People younger than 18 typically live with their parents“. We demonstrate how dynamic programming and cumulative sum operations can be exploited to ensure efficiency of such extension. Our novel approach allows us to extract more expressive rules with aggregates, which are of higher quality and yield more accurate predictions compared to rules learned by the state-of-the-art methods, as shown by our experiments on synthetic and real-world datasets.

JELIA Conference 2014 Conference Paper

Computing Repairs for Inconsistent DL-programs over EL Ontologies

  • Thomas Eiter
  • Michael Fink 0001
  • Daria Stepanova 0001

Abstract DL-programs couple nonmonotonic logic programs with DL- ontologies through queries in a loose way which may lead to inconsistency, i. e. , lack of an answer set. Recently defined repair answer sets remedy this. In particular, for \(DL-Lite_{\mathcal{A}}\) ontologies, the computation of deletion repair answer sets can effectively be reduced to constraint matching based on so-called support sets. Here we consider the problem for DL-programs over \(\mathcal{EL}\) ontologies. This is more challenging than adopting a suitable notion of support sets and their computation. Compared to \(DL-Lite_{\mathcal{A}}\), support sets may neither be small nor few, and completeness may need to be given up in favor of sound repair computation on incomplete support information. We provide such an algorithm and discuss partial support set computation, as well as a declarative implementation. Preliminary experiments show a very promising potential of the partial support set approach.

ECAI Conference 2014 Conference Paper

Towards Practical Deletion Repair of Inconsistent DL-programs

  • Thomas Eiter
  • Michael Fink 0001
  • Daria Stepanova 0001

Nonmonotonic Description Logic (DL-) programs couple nonmonotonic logic programs with DL-ontologies through queries in a loose way which may lead to inconsistency, i. e. , lack of an answer set. Recently defined repair answer sets remedy this but a straightforward computation method lacks practicality. We present a novel evaluation algorithm for deletion repair answer sets based on support sets, which reduces evaluation of DL-LiteAontology queries to constraint matching. This leads to significant performance gains towards inconsistency management in practice.

v2026.09.13