activity
20182026
most citedOntology Focusing: Knowledge-enriched Databases on Demand

5 citations · 6 across the 5 of their papers we have counts for

collaborators
Showing cs.AIShow all

8 papers · 1 filter

cs.AI2026

AUDITFLOW: Executable Symbolic Environments for Structured Financial Reporting Verification

Yan Wang, Xuguang Ai, Jaisal Patel +7

Structured financial audit verification is difficult for language-model agents because correctness depends on structured evidence rather than text alone. A model must link reported…

cs.AI2023

Inductive Knowledge Graph Completion with GNNs and Rules: An Analysis

Akash Anil, Víctor Gutiérrez-Basulto, Yazmín Ibañéz-García +1

The task of inductive knowledge graph completion requires models to learn inference patterns from a training graph, which can then be used to make predictions on a disjoint test gr…

cs.AI2021

A Description Logic for Analogical Reasoning

Steven Schockaert, Yazmín Ibáñez-García, Víctor Gutiérrez-Basulto

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly in…

cs.AI2020

On Finite Entailment of Non-Local Queries in Description Logics

Tomasz Gogacz, Víctor Gutiérrez-Basulto, Albert Gutowski +2

We study the problem of finite entailment of ontology-mediated queries. Going beyond local queries, we allow transitive closure over roles. We focus on ontologies formulated in the…

cs.AI2020

Plausible Reasoning about EL-Ontologies using Concept Interpolation

Yazmín Ibáñez-García, Víctor Gutiérrez-Basulto, Steven Schockaert

Description logics (DLs) are standard knowledge representation languages for modelling ontologies, i.e. knowledge about concepts and the relations between them. Unfortunately, DL o…

cs.AI20191 cited

Beyond the Grounding Bottleneck: Datalog Techniques for Inference in Probabilistic Logic Programs (Technical Report)

Efthymia Tsamoura, Victor Gutierrez-Basulto, Angelika Kimmig

State-of-the-art inference approaches in probabilistic logic programming typically start by computing the relevant ground program with respect to the queries of interest, and then…