An Evidential Path Logic for Multi-Relational Networks

Details An Evidential Path Logic for Multi-Relational Networks An Evidential Path Logic for Multi-Relational Networks

2008-10-08

arxiv.org/abs/0810.1481v2

Proceedings of the Association for the Advancement of Artificial Intelligence Spring Symposium: Technosocial Predictive Analyt

Computer Science

Logic in Computer Science

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Evidential Path Logic for Multi-Relational Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Evidential Path Logic for Multi-Relational Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Evidential Path Logic for Multi-Relational Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-30511