eyeleng 1.0.4 → 1.0.6

package/examples/cat-koko.srl

@@ -0,0 +1,52 @@
+PREFIX : <https://eyereasoner.github.io/ns#>
+
+# =================================
+# Cat Koko
+# SRL translation of cat-koko.n3
+# =================================
+#
+# The N3 version contains a rule whose conclusion contains two rules:
+#
+#   { :Koko a :Animal } => {
+#     { :Koko a :Animal } => { _:x a :Cat } .
+#     { :Koko a :Animal } => { _:x a :BritishShortHair } .
+#   }.
+#
+# SRL does not have N3 formula terms or rule terms in rule heads.
+# So this SRL version translates the operational effect directly:
+#
+#   if :Koko is an :Animal, derive one fresh :Cat;
+#   if :Koko is an :Animal, derive one fresh :BritishShortHair.
+#
+# The two blank nodes are intentionally different. In the N3 source, the two
+# _:x labels occur in different quoted formula scopes, so they do not denote
+# the same blank node.
+
+DATA {
+  :Koko a :Animal .
+}
+
+RULE { _:cat a :Cat }
+WHERE {
+  :Koko a :Animal .
+}
+
+RULE { _:bsh a :BritishShortHair }
+WHERE {
+  :Koko a :Animal .
+}
+
+# Translation of:
+#
+#   ?X a :Cat .
+#   ?Y a :BritishShortHair .
+#   ?X log:notEqualTo ?Y.
+#
+# SRL uses a FILTER for the inequality test.
+
+RULE { :test :is true }
+WHERE {
+  ?X a :Cat .
+  ?Y a :BritishShortHair .
+  FILTER(?X != ?Y)
+}

package/examples/graph-term-emulation.srl

@@ -0,0 +1,83 @@
+PREFIX : <http://example/graph-term-list/>
+PREFIX rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>
+
+# Emulating N3 graph terms as closed RDF list values.
+#
+# In Notation3, a graph term is a quoted graph/formula used as a term:
+#
+#   { :alice :knows :bob. :bob :knows :carol }
+#
+# The important point is that the quoted graph is closed. It is not an open
+# container to which rules should add more statements.
+#
+# Therefore this SRL encoding does NOT use:
+#
+#   :g1 :statement <<(...)>> .
+#
+# because that is too easy to misuse as an extensible membership relation.
+#
+# Instead, the graph term points to one RDF list value. The list is the quoted
+# graph term representation, and its items are RDF 1.2 quoted triples.
+
+DATA {
+  :g1 a :GraphTerm ;
+      :quotedTriples (
+        <<(:alice :knows :bob)>>
+        <<(:bob :knows :carol)>>
+      ) .
+
+  :g2 a :GraphTerm ;
+      :quotedTriples (
+        <<(:alice :likes :tea)>>
+      ) .
+
+  # Example of using the graph term as a term:
+  # this says that :note1 is about the closed quoted graph :g1.
+  :note1 :aboutGraphTerm :g1 .
+}
+
+# Helper index over the RDF list cells.
+# This reads the closed list value; it does not add to or replace the list.
+RULE { ?g :listCell ?cell }
+WHERE {
+  ?g :quotedTriples ?cell .
+}
+
+RULE { ?g :listCell ?rest }
+WHERE {
+  ?g :listCell ?cell .
+  ?cell rdf:rest ?rest .
+}
+
+# Test rule: classify a graph term if its closed list contains a quoted
+# triple with predicate :knows.  The result is metadata ABOUT the graph term.
+RULE { ?g a :SocialGraphTerm }
+WHERE {
+  ?g a :GraphTerm ;
+     :listCell ?cell .
+  ?cell rdf:first <<(?s :knows ?o)>> .
+}
+
+# Another safe test: derive who is mentioned by the closed graph term.
+RULE { ?g :mentions ?s }
+WHERE {
+  ?g a :GraphTerm ;
+     :listCell ?cell .
+  ?cell rdf:first <<(?s ?p ?o)>> .
+}
+
+RULE { ?g :mentions ?o }
+WHERE {
+  ?g a :GraphTerm ;
+     :listCell ?cell .
+  ?cell rdf:first <<(?s ?p ?o)>> .
+}
+
+# Expected derived facts include:
+#
+#   :g1 a :SocialGraphTerm .
+#   :g1 :mentions :alice, :bob, :carol .
+#   :g2 :mentions :alice, :tea .
+#
+# No rule derives rdf:first, rdf:rest, or :quotedTriples, so the graph-term
+# list remains closed.

package/examples/output/cat-koko.trig

@@ -0,0 +1,3 @@
+_:bsh a :BritishShortHair .
+_:cat a :Cat .
+:test :is true .

package/examples/output/collection-nesting.trig

@@ -1,4 +1,4 @@
 :test :first 1 .
-:test :second _:b1 .
+:test :second _:b3 .
 :test :secondProperty :q .
 :test :thirdFirst 2 .

package/examples/output/graph-term-emulation.trig

@@ -0,0 +1,11 @@
+:g1 :listCell _:b1 .
+:g1 :listCell _:b2 .
+:g1 :listCell rdf:nil .
+:g1 :mentions :alice .
+:g1 :mentions :bob .
+:g1 :mentions :carol .
+:g1 a :SocialGraphTerm .
+:g2 :listCell _:b3 .
+:g2 :listCell rdf:nil .
+:g2 :mentions :alice .
+:g2 :mentions :tea .

package/examples/output/rdf-messages.trig

@@ -0,0 +1,3 @@
+<urn:eyeleng:message-log:03ead54e#m001> :mentionsSensor :s1 .
+<urn:eyeleng:message-log:03ead54e#m002> :isHeartbeat true .
+<urn:eyeleng:message-log:03ead54e#m003> :mentionsSensor :s2 .

package/examples/rdf-messages.srl

@@ -0,0 +1,15 @@
+PREFIX : <http://example/messages#>
+PREFIX eymsg: <https://eyereasoner.github.io/eyeling/vocab/message#>
+
+IMPORTS <./rdf-messages.trig>
+
+RULE { ?envelope :mentionsSensor ?sensor }
+WHERE {
+  ?envelope eymsg:payloadGraph ?payload .
+  ?payload eymsg:payloadTriple <<(?reading :sensor ?sensor)>> .
+}
+
+RULE { ?envelope :isHeartbeat true }
+WHERE {
+  ?envelope eymsg:payloadKind eymsg:empty .
+}

package/examples/rdf-messages.trig

@@ -0,0 +1,12 @@
+VERSION "1.2-messages"
+PREFIX : <http://example/messages#>
+
+_:reading :sensor :s1 ; :value 21 .
+
+MESSAGE
+
+# Empty heartbeat message.
+
+MESSAGE
+
+_:reading :sensor :s2 ; :value 22 .