arXiv (All)
open access
A hierarchy of faithfulness criteria for knowledge base completion
Knowledge graph completion is evaluated by ranking observed triples above randomly corrupted ones, which treats every unobserved fact as false. When the object being completed is a description logic knowledge base rather than a plain graph, the open world assumption and deductive closure make this i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion#141536
- Pattern Over-Generalization of Knowledge Graph Embedding#926403
- ViSR-KGC: Visual Subgraph Reasoning with Vision-Language Models for Multimodal Knowledge Graph Completion#987775
- SLogic: Subgraph-Informed Logical Rule Learning for Knowledge Graph Completion#665545
- SLogic: Subgraph-Informed Logical Rule Learning for Knowledge Graph Completion#664045
Record · ID 1064407
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive