• Corpus ID: 9131451

An Evidential Path Logic for Multi-Relational Networks

  title={An Evidential Path Logic for Multi-Relational Networks},
  author={Michael A. Rodriguez and Joe Geldart},
  booktitle={AAAI Spring Symposium: Technosocial Predictive Analytics},
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… 

Figures from this paper

Role of Non-Axiomatic Logic in a Distributed Reasoning Environment
The aim of this paper is to introduce the design of a novel Distributed Non-Axiomatic Reasoning System, a formalism in the domain of artificial general intelligence designed for realizations of systems with insufficient resources and knowledge.
Matchmaking Using Natural Language Descriptions: Linking Customers with Enterprise Service Descriptions
  • J. Geldart, W. Song, Y. Li
  • Computer Science
    2009 33rd Annual IEEE International Computer Software and Applications Conference
  • 2009
A novel architecture is presented for the matching of web-services based on the extraction of interpretation graphs from natural language text using a numerical node-node similarity calculationbased on the structure of the graphs.


RDF as Graph-Based, Diagrammatic Logic
  • F. Dau
  • Computer Science
  • 2006
RDF is investigated as a logic system based on mathematical graphs, i.e., as diagrammatic reasoning system, which has humanly-readable, diagrammatic representations and a sound and complete calculus is provided.
Bipartite Graphs as Intermediate Model for RDF
It is argued in this paper that there is need for an intermediate representation of RDF to enable the application of well-established methods from graph theory and its advantages as intermediate model between the abstract triple syntax and data structures used by applications are shown.
Exposing multi-relational networks to single-relational network analysis algorithms
Grammar-based random walkers in semantic networks
A Directed Hypergraph Model for RDF
While LDG model is the most widely used representation, it can not be considered a formal model for RDF, UH represents RDF documents as a generalization of undirected graphs, losing the notion of direction in RDF graphs, which impacts the task of semantic reasoning.
Non-Axiomatic Reasoning System (Version 4.1)
The NARS 4.1 demo is a Java applet that comes with help information and simple examples to show how the system does deduction, induction, abduction, analogy, belief revision, membership evaluation, relational inference, backward inference, new concept formation, and so on, in a unified manner.
The Description Logic Handbook: Theory, Implementation, and Applications
This new edition of The Description Logic Handbook provides a thorough account of the subject, covering all aspects of research in this field, namely: theory, implementation, and applications.
From Inheritance Relation to Non-Axiomatic Logic
A Non-Axiomatic Reasoning System has a term-oriented language and an experience-grounded semantics that can uniformly represents and processes randomness, fuzziness, and ignorance and uniformly carries out deduction, abduction, induction, and revision.
Unifying Reasoning and Search to Web Scale
The Web and reasoning started to meet around 1996 with the first projects that added semantics to Web page descriptions in much the same way that HTML added formatting information, but serious doubt remains whether reasoning really adds something useful in the Web context.
Named graphs, provenance and trust
The extension of RDF to Named Graphs provides a formally defined framework to be a foundation for the Semantic Web trust layer.