An Evidential Path Logic for Multi-Relational Networks

Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Description Framework (RDF). One of the primary purposes of a knowledge network is to reason; that is, to alter the topology of the network according to an algorithm that uses the existing topological structure as its input. There exist many such reasoning algorithms. With respect to the Semantic Web, the bivalent, monotonic reasoners of the RDF Schema (RDFS) and the Web Ontology Language (OWL) are the most prevalent. However, nothing prevents other forms of reasoning from existing in the Semantic Web. This article presents a non-bivalent, non-monotonic, evidential logic and reasoner that is an algebraic ring over a multi-relational network equipped with two binary operations that can be composed to execute various forms of inference. Given its multi-relational grounding, it is possible to use the presented evidential framework as another method for structuring knowledge and reasoning in the Semantic Web. The benefits of this framework are that it works with arbitrary, partial, and contradictory knowledge while, at the same time, it supports a tractable approximate reasoning process.

💡 Research Summary

The paper tackles a fundamental limitation of current Semantic Web reasoning: the reliance on bivalent, monotonic logics such as RDFS and OWL, which assume that knowledge is either true or false and that adding new information can only increase entailments. Real‑world RDF graphs, however, are riddled with incompleteness, uncertainty, and outright contradictions. To address this, the authors introduce an evidential, non‑bivalent, non‑monotonic logic built directly on top of multi‑relational networks.

Each directed edge in the graph is annotated with an evidence tuple ⟨w⁺, w⁻⟩ where w⁺ (support) and w⁻ (refutation) are real numbers in