Grailog 1.0 : graph-logic visualization of ontologies and rules

AuthorSearch for:
ConferenceHigh Performance Computing Center Stuttgart (HLRS), 14 August 2012, Stuttgart, Germany
Pages116; # of pages: 16
AbstractDirected labeled graphs (DLGs) provide a good starting point for visual data & knowledge representation but cannot straightforwardly represent non-binary relationships, nested structures, and relation descriptions. These advanced features require encoded constructs with auxiliary nodes and relationships, which also need to be kept separate from straightforward constructs. Therefore, various extensions of DLGs have been proposed for data & knowledge representation, including n-ary relationships as directed labeled hyperarcs, graph partitionings (possibly interfaced as complex nodes), and (hyper)arc labels used as nodes of other (hyper)arcs. Ontologies and rules have used extended logics for knowledge representation such as description logic, object/frame logic, higher-order logic, and modal logic. The paper demonstrates how data & knowledge representation with graphs and logics can be reconciled, inspiring flexible name specification. It proceeds from simple to extended graphs for logics needed in AI and the Semantic Web. Along with its visual introduction, each graph construct is mapped to its corresponding symbolic logic construct. These graph-logic extensions constitute a systematics defined by orthogonal axes, which has led to the Grailog 1.0 language aligned with the Web-rule industry standard RuleML 1.0.
Publication date
AffiliationSecurity and Disruptive Technologies; National Research Council Canada
Peer reviewedNo
NPARC number21268356
Export citationExport as RIS
Report a correctionReport a correction
Record identifier14df6902-12d9-4145-9903-12e259813ebf
Record created2013-07-02
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)
Date modified: