• Corpus ID: 9131451

An Evidential Path Logic for Multi-Relational Networks

@inproceedings{Rodriguez2009AnEP,
  title={An Evidential Path Logic for Multi-Relational Networks},
  author={Michael A. Rodriguez and Joe Geldart},
  booktitle={AAAI Spring Symposium: Technosocial Predictive Analytics},
  year={2009}
}

• Michael A. Rodriguez, J. Geldart
• Published in
  AAAI Spring Symposium…
  8 October 2008
• Computer Science

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, axiomatic 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-axiomatic, evidential logic and reasoner that is an algebraic ring over a multi-relational network and two binary operations that can be composed to perform 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, supporting a tractable approximate reasoning process.