eyeling 1.5.11 → 1.5.13

package/examples/derived-backward-rule-2.n3

@@ -0,0 +1,28 @@
+# ---------------------
+# Derived backward rule
+# ---------------------
+#
+# Example from Patrick Hochstenbach
+
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
+@prefix : <http://example.org/socrates#>.
+
+true => {
+    { :Socrates a :Human. } <= true .
+    { :Human rdfs:subClassOf :Mortal } <= true.
+}.
+
+{
+    ?S a ?A.
+    ?A rdfs:subClassOf ?B.
+} => {
+    ?S a ?B.
+}.
+
+{
+    :Socrates a :Mortal .
+}
+=>
+{
+    :test :is true .
+} .

package/examples/derived-backward-rule.n3

@@ -0,0 +1,32 @@
+# ---------------------
+# Derived backward rule
+# ---------------------
+
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+@prefix :    <https://eyereasoner.github.io/ns#> .
+
+:parentOf :invOf :childOf .
+
+:alice :parentOf :bob .
+
+# Meta-rule:
+# For every inverse pair (?p :invOf ?q),
+# create a backward rule:
+#   { ?x ?q ?y } <= { ?y ?p ?x } .
+{
+    ?p :invOf ?q .
+} => {
+    {
+        ?x ?q ?y .
+    } <= {
+        ?y ?p ?x .
+    } .
+} .
+
+# Ordinary forward rule that uses :childOf in its premise.
+{
+    ?x :childOf ?y .
+} => {
+    ?x :hasParent ?y .
+} .
+

package/examples/derived-rule.n3

@@ -0,0 +1,19 @@
+# ------------
+# Derived rule
+# ------------
+
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+@prefix : <https://eyereasoner.github.io/ns#>.
+
+:Minka a :Cat.
+:Charly a :Dog.
+
+{
+    ?x a :Cat.
+} => {
+    {
+        ?y a :Dog.
+    } => {
+        :test :is true.
+    }.
+}.

package/examples/dijkstra.n3

@@ -0,0 +1,64 @@
+# ----------------------------------------------
+# Dijkstra's algorithm to find the shortest path
+# ----------------------------------------------
+#
+# Original from https://github.com/agx-r/Dijkstra-s-Algorithm
+
+@prefix list: <http://www.w3.org/2000/10/swap/list#>.
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+@prefix : <https://eyereasoner.github.io/ns#>.
+
+# edges
+(:a :b) :edge 4 .
+(:a :c) :edge 2 .
+(:b :c) :edge 1 .
+(:b :d) :edge 5 .
+(:c :d) :edge 8 .
+(:c :e) :edge 10 .
+(:d :e) :edge 2 .
+(:d :f) :edge 6 .
+(:e :f) :edge 3 .
+
+{
+    (?A ?B) :edge ?C.
+} => {
+    (?B ?A) :edge ?C.
+}.
+
+# Dijkstra's algorithm
+{ (?Start ?Goal) :dijkstra (?Path ?Cost) } <= {
+    (((0 ?Start)) ?Goal ()) :dijkstra2 (?RevPath ?Cost).
+    ?RevPath list:reverse ?Path.
+}.
+
+{ (?L1 ?Goal ?L2) :dijkstra2 (?L3 ?Cost) } <= {
+    ?L1 list:firstRest (?L4 ?L5).
+    ?L4 list:firstRest (?Cost ?L3).
+    ?L3 list:firstRest (?Goal ?Path).
+}.
+
+{ (?L1 ?Goal ?Visited) :dijkstra2 (?ResultPath ?ResultCost) } <= {
+    ?L1 list:firstRest (?L2 ?Queue).
+    ?L2 list:firstRest (?Cost ?L3).
+    ?L3 list:firstRest (?Node ?Path).
+    (?L4 {
+        ?L4 list:firstRest (?NewCost ?L5).
+        ?L5 list:firstRest (?Neighbor ?L6).
+        ?L6 list:firstRest (?Node ?Path).
+        (?Node ?Neighbor) :edge ?Weight.
+        ?Visited list:notMember ?Neighbor.
+        (?Cost ?Weight) math:sum ?NewCost.
+    } ?Neighbors) log:collectAllIn ?SCOPE.
+    (?Queue ?Neighbors) list:append ?NewQueue.
+    ?NewQueue list:sort ?SortedQueue.
+    ?L7 list:firstRest (?Node ?Visited).
+    (?SortedQueue ?Goal ?L7) :dijkstra2 (?ResultPath ?ResultCost).
+}.
+
+# find the paths
+{
+    (:a :f) :dijkstra (?Path ?Cost).
+} => {
+    (:a :f) :path (?Path ?Cost).
+}.

package/examples/dog.n3

@@ -0,0 +1,21 @@
+# -------------------
+# Dog license example
+# -------------------
+#
+# If you have more than 4 dogs you need a license.
+
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix : <https://eyereasoner.github.io/ns#>.
+
+:alice :hasDog :dog1, :dog2, :dog3, :dog4, :dog5.
+:bob :hasDog :dog6, :dog7.
+
+{
+    ?Subject :hasDog ?Any.
+    (1 { ?Subject :hasDog ?Dog } ?List) log:collectAllIn ?Scope.
+    ?List math:sum ?Count.
+    ?Count math:greaterThan 4.
+} => {
+    ?Subject :mustHave :dogLicense.
+}.

package/examples/equals.n3

@@ -0,0 +1,12 @@
+# -----------
+# Equals test
+# -----------
+#
+# Example from Patrick Hochstenbach
+
+@prefix owl: <http://www.w3.org/2002/07/owl#> .
+@prefix : <http://example.org/socrates#>.
+
+:X = :Y . 
+
+{ :X owl:sameAs :Y } => { :test :is true }.

package/examples/existential-rule.n3

@@ -0,0 +1,18 @@
+# ----------------
+# Existential rule
+# ----------------
+
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
+@prefix : <http://example.org/socrates#>.
+
+# facts
+:Socrates a :Human.
+:Plato a :Human.
+
+# subclass rule
+{
+    ?S a :Human.
+} => {
+    ?S :is _:B.
+}.
+

package/examples/fibonacci.n3

@@ -0,0 +1,34 @@
+# -----------------
+# Fibonacci numbers
+# -----------------
+#
+# See https://en.wikipedia.org/wiki/Fibonacci_number
+
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
+
+{?X :fibonacci ?Y} <= {(?X 0 1) :fib ?Y}.
+
+{(0 ?A ?B) :fib ?A} <= true.
+{(1 ?A ?B) :fib ?B} <= true.
+{(?X ?A ?B) :fib ?Y} <= {
+    ?X math:greaterThan 1.
+    (?X 1) math:difference ?D.
+    (?A ?B) math:sum ?S.
+    (?D ?B ?S) :fib ?Y.
+}.
+
+{
+    0 :fibonacci ?F0.
+    1 :fibonacci ?F1.
+    10 :fibonacci ?F10.
+    100 :fibonacci ?F100.
+} => {
+    :test :is {
+        0 :fibonacci ?F0.
+        1 :fibonacci ?F1.
+        10 :fibonacci ?F10.
+        100 :fibonacci ?F100.
+    }.
+}.
+

package/examples/for-all-in.n3

@@ -0,0 +1,21 @@
+# --------------------
+# log:forAllIn example
+# --------------------
+
+@prefix : <http://example.org/>.
+@prefix log: <http://www.w3.org/2000/10/swap/log#> .
+
+:c a :CompositeTask ;
+    :subTask :s1 , :s2 , :s3 .
+:s1 :state :Completed .
+:s2 :state :Completed .
+:s3 :state :Completed .
+
+{
+    ?c a :CompositeTask .
+    ( { ?c :subTask ?s } { ?s :state :Completed } ) log:forAllIn _:t .
+}
+=>
+{
+    :result :is true .
+} .

package/examples/french-cities.n3

@@ -0,0 +1,32 @@
+# ----------------------
+# Traversing Graph Paths
+# ----------------------
+#
+# Simple data & rules over a tiny city dataset
+
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+@prefix owl: <http://www.w3.org/2002/07/owl#>.
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
+@prefix : <http://www.agfa.com/w3c/euler/graph.axiom#>.
+
+:paris :oneway :orleans.
+:paris :oneway :chartres.
+:paris :oneway :amiens.
+:orleans :oneway :blois.
+:orleans :oneway :bourges.
+:blois :oneway :tours.
+:chartres :oneway :lemans.
+:lemans :oneway :angers.
+:lemans :oneway :tours.
+:angers :oneway :nantes.
+
+:oneway rdfs:subPropertyOf :path.
+:path a owl:TransitiveProperty.
+
+# RDFS rules
+{?P rdfs:subPropertyOf ?Q. ?S ?P ?O} => {?S ?Q ?O}.
+{?P rdfs:subPropertyOf ?Q. ?Q rdfs:subPropertyOf ?R} => {?P rdfs:subPropertyOf ?R}.
+
+# OWL rules
+{?P a owl:TransitiveProperty. ?S ?P ?X. ?X ?P ?O.} => {?S ?P ?O}.
+

package/examples/fuse.n3

@@ -0,0 +1,13 @@
+# --------------
+# Inference fuse
+# --------------
+
+@prefix : <https://eyereasoner.github.io/ns#>.
+
+:stone :color :black.
+:stone :color :white.
+
+{
+    ?X :color :black.
+    ?X :color :white.
+} => false.

package/examples/good-cobbler.n3

@@ -0,0 +1,18 @@
+# ------------
+# Good cobbler
+# ------------
+#
+# Example from https://shs.hal.science/halshs-04148373/document
+# Using term logic http://intrologic.stanford.edu/chapters/chapter_11.html
+
+@prefix : <https://eyereasoner.github.io/ns#>.
+
+# joe is a good cobbler
+:joe :is (:good :Cobbler).
+
+# is there some x which is good at some y
+{
+    ?X :is (:good ?Y).
+} => {
+    :test :is { ?X :is (:good ?Y) }.
+}.

package/examples/gray-code-counter.n3

@@ -0,0 +1,64 @@
+# -----------------
+# Gray code counter
+# -----------------
+#
+# Taken from the book "Clause and Effect" Chapter 8
+
+@prefix list: <http://www.w3.org/2000/10/swap/list#>.
+@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
+
+(0 0) :and 0.
+(0 1) :and 0.
+(1 0) :and 0.
+(1 1) :and 1.
+
+(0 0) :or 0.
+(0 1) :or 1.
+(1 0) :or 1.
+(1 1) :or 1.
+
+0 :inv 1.
+1 :inv 0.
+
+{(?D 0 ?Q) :dff ?Q} <= true.
+{(?D 1 ?Q) :dff ?D} <= true.
+
+{(?A ?B) :neta ?Q} <= {
+    (?A ?B) :and ?T1.
+    ?A :inv ?NA.
+    ?B :inv ?NB.
+    (?NA ?NB) :and ?T2.
+    (?T1 ?T2) :or ?Q.
+}.
+
+{(?A ?B ?C) :netb (?Q1 ?Q2)} <= {
+    (?A ?C) :and ?T1.
+    ?C :inv ?NC.
+    (?B ?NC) :and ?T2.
+    ?A :inv ?NA.
+    (?NA ?C) :and ?T3.
+    (?T1 ?T2) :or ?Q1.
+    (?T2 ?T3) :or ?Q2.
+}.
+
+
+{(?C (?Qa ?Qb ?Qc)) :gcc (?Za ?Zb ?Zc)} <= {
+    (?Qa ?Qb ?Qc) :netb (?D1 ?D2).
+    (?Qa ?Qb) :neta ?D3.
+    (?D1 ?C ?Qa) :dff ?Za.
+    (?D2 ?C ?Qb) :dff ?Zb.
+    (?D3 ?C ?Qc) :dff ?Zc.
+}.
+
+
+{(() ?S) :testgcc ()} <= true.
+{(?Cc ?S) :testgcc ?Nc} <= {
+    ?Cc list:firstRest (?C ?Cs).
+    ?Nc list:firstRest (?N ?Ns).
+    (?C ?S) :gcc ?N.
+    (?Cs ?N) :testgcc ?Ns.
+}.
+
+# test
+{((1 1 1 1 1 1 1 1 1) (0 0 0)) :testgcc ?Q} => {((1 1 1 1 1 1 1 1 1) (0 0 0)) :isgcc ?Q}.
+

package/examples/hanoi.n3

@@ -0,0 +1,21 @@
+# ---------------
+# Towers of Hanoi
+# ---------------
+#
+# Taken from the book "The Art of Prolog" by Leon Sterling and Ehud Shapiro
+
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix list: <http://www.w3.org/2000/10/swap/list#>.
+@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
+
+# ?M is the sequence of moves to move ?N disks from ?X to ?Y using ?Z as intermediary
+{(?N ?X ?Y ?Z) :moves ?M} <=
+{   ?N math:greaterThan 1.
+    (?N 1) math:difference ?N1.
+    (?N1 ?X ?Z ?Y) :moves ?M1.
+    (?N1 ?Z ?Y ?X) :moves ?M2.
+    (?M1 ((?X ?Y)) ?M2) list:append ?M.
+}.
+{(1 ?X ?Y ?Z) :moves ((?X ?Y))} <= true.
+
+{(3 :left :right :center) :moves ?M} => {3 :answer ?M}.

package/examples/liar.n3

@@ -0,0 +1,6 @@
+@prefix : <https://eyereasoner.github.io/ns#>.
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+
+{ :Alice a :Liar } => false .
+
+{ { :Alice a :Liar } => false } => false .

package/examples/list-builtins-tests.n3

@@ -0,0 +1,84 @@
+# -------------------
+# list builtins tests
+# -------------------
+
+@prefix :      <https://eyereasoner.github.io/ns#> .
+@prefix list:  <http://www.w3.org/2000/10/swap/list#> .
+@prefix log:   <http://www.w3.org/2000/10/swap/log#> .
+
+# ============================================================
+# 4.4 list: builtins
+# ============================================================
+
+# 4.4.1 list:append
+# ( (1 2) (3 4) ) list:append (1 2 3 4) .
+{
+    ( (1 2) (3 4) ) list:append (1 2 3 4) .
+} => {
+    :ok_list_append_1 a :Pass .
+} .
+
+# 4.4.2 list:first
+# (1 2 3 4) list:first 1 .
+{
+    (1 2 3 4) list:first 1 .
+} => {
+    :ok_list_first_1 a :Pass .
+} .
+
+# 4.4.3 list:in
+# "cat" list:in ( "dog" "penguin" "cat" ) .
+{
+    "cat" list:in ( "dog" "penguin" "cat" ) .
+} => {
+    :ok_list_in_1 a :Pass .
+} .
+
+# 4.4.4 list:iterate
+# ("dog" "penguin" "cat") list:iterate (?index "cat") .
+{
+    ("dog" "penguin" "cat") list:iterate (?index "cat") .
+} => {
+    :ok_list_iterate_1 a :Pass .
+} .
+
+# 4.4.5 list:last
+# (1 2 3 4) list:last 4 .
+{
+    (1 2 3 4) list:last 4 .
+} => {
+    :ok_list_last_1 a :Pass .
+} .
+
+# 4.4.6 list:length
+# (1 2 3 4) list:length 4 .
+{
+    (1 2 3 4) list:length 4 .
+} => {
+    :ok_list_length_1 a :Pass .
+} .
+
+# 4.4.7 list:member
+# ("dog" "penguin" "cat") list:member "cat" .
+{
+    ("dog" "penguin" "cat") list:member "cat" .
+} => {
+    :ok_list_member_1 a :Pass .
+} .
+
+# 4.4.8 list:memberAt
+# (("dog" "penguin" "cat") 2) list:memberAt "cat" .
+{
+    (("dog" "penguin" "cat") 2) list:memberAt "cat" .
+} => {
+    :ok_list_memberAt_1 a :Pass .
+} .
+
+# 4.4.9 list:remove
+# (("dog" "penguin" "cat" "penguin") "penguin") list:remove ("dog" "cat") .
+{
+    (("dog" "penguin" "cat" "penguin") "penguin") list:remove ("dog" "cat") .
+} => {
+    :ok_list_remove_1 a :Pass .
+} .
+

package/examples/lldm.n3

@@ -0,0 +1,133 @@
+# ----------------------------------
+# Leg Length Discrepancy Measurement
+# ----------------------------------
+#
+# See https://web.archive.org/web/20220524062310/http://www.agfa.com/w3c/2002/10/medicad/op/
+
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix owl: <http://www.w3.org/2002/07/owl#>.
+@prefix xsd: <http://www.w3.org/2001/XMLSchema#>.
+@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>.
+@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>.
+@prefix : <http://www.agfa.com/w3c/2002/10/medicad/op/lldmP#>.
+
+## measurement data
+
+:meas47 a :Measurement;
+        :p1xCm 10.1; :p1yCm 7.8;
+        :p2xCm 45.1; :p2yCm 5.6;
+        :p3xCm 3.6;  :p3yCm 29.8;
+        :p4xCm 54.7; :p4yCm 28.5.
+
+## measurement axioms
+
+:p1 a :Point; :incident :L1.
+:p2 a :Point; :incident :L1.
+:p3 a :Point; :incident :L3.
+:p4 a :Point; :incident :L4.
+:p5 a :Point; :incident :L1, :L3.
+:p6 a :Point; :incident :L1, :L4.
+:L1 a :Line; :perpendicular :L3, :L4.
+:L3 a :Line.
+:L4 a :Line.
+
+:incident rdfs:domain :Point; rdfs:range :Line; owl:inverseOf :contains.
+:perpendicular rdfs:domain :Line; rdfs:range :Line; a owl:SymmetricProperty. 
+
+:p1xCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p1yCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p2xCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p2yCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p3xCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p3yCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p4xCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p4yCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p5xCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p5yCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p6xCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:p6yCm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dx12Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dx51Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dx53Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dx62Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dx64Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dy12Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dy13Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dy24Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dy53Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dy64Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:cL1 rdfs:domain :Measurement; rdfs:range :Quantity.
+:dL3m rdfs:domain :Measurement; rdfs:range :Quantity.
+:cL3 rdfs:domain :Measurement; rdfs:range :Quantity.
+:pL1x1Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:pL1x2Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:pL3x3Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:pL3x4Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dd13Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:ddy13Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dd24Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:ddy24Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:ddL13 rdfs:domain :Measurement; rdfs:range :Quantity.
+:pL1dx51Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:pL1dx62Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:sdx53Cm2 rdfs:domain :Measurement; rdfs:range :Quantity.
+:sdx64Cm2 rdfs:domain :Measurement; rdfs:range :Quantity.
+:sdy53Cm2 rdfs:domain :Measurement; rdfs:range :Quantity.
+:sdy64Cm2 rdfs:domain :Measurement; rdfs:range :Quantity.
+:sdd53Cm2 rdfs:domain :Measurement; rdfs:range :Quantity.
+:sdd64Cm2 rdfs:domain :Measurement; rdfs:range :Quantity.
+:ssd53Cm2 rdfs:domain :Measurement; rdfs:range :Quantity.
+:ssd64Cm2 rdfs:domain :Measurement; rdfs:range :Quantity.
+:d53Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:d64Cm rdfs:domain :Measurement; rdfs:range :Quantity.
+:dCm rdfs:domain :Measurement; rdfs:range :Quantity.
+
+## measurement implications
+
+{?M a :Measurement; :p1xCm ?X; :p2xCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dx12Cm ?Z}.
+{?M a :Measurement; :p5xCm ?X; :p1xCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dx51Cm ?Z}.
+{?M a :Measurement; :p5xCm ?X; :p3xCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dx53Cm ?Z}.
+{?M a :Measurement; :p6xCm ?X; :p2xCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dx62Cm ?Z}.
+{?M a :Measurement; :p6xCm ?X; :p4xCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dx64Cm ?Z}.
+{?M a :Measurement; :p1yCm ?X; :p2yCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dy12Cm ?Z}.
+{?M a :Measurement; :p1yCm ?X; :p3yCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dy13Cm ?Z}.
+{?M a :Measurement; :p2yCm ?X; :p4yCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dy24Cm ?Z}.
+{?M a :Measurement; :p5yCm ?X; :p3yCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dy53Cm ?Z}.
+{?M a :Measurement; :p6yCm ?X; :p4yCm ?Y. (?X ?Y) math:difference ?Z} => {?M :dy64Cm ?Z}.
+
+{?M a :Measurement; :dy12Cm ?Y; :dx12Cm ?X. (?Y ?X) math:quotient ?Z} => {?M :cL1 ?Z}.
+{?M a :Measurement; :cL1 ?X. (1 ?X) math:quotient ?Z} => {?M :dL3m ?Z}.
+{?M a :Measurement; :dL3m ?X. (0 ?X) math:difference ?Z} => {?M :cL3 ?Z}.
+
+{?M a :Measurement; :cL1 ?X; :p1xCm ?Y. (?X ?Y) math:product ?Z} => {?M :pL1x1Cm ?Z}.
+{?M a :Measurement; :cL1 ?X; :p2xCm ?Y. (?X ?Y) math:product ?Z} => {?M :pL1x2Cm ?Z}.
+{?M a :Measurement; :cL3 ?X; :p3xCm ?Y. (?X ?Y) math:product ?Z} => {?M :pL3x3Cm ?Z}.
+{?M a :Measurement; :cL3 ?X; :p4xCm ?Y. (?X ?Y) math:product ?Z} => {?M :pL3x4Cm ?Z}.
+{?M a :Measurement; :pL1x1Cm ?X; :pL3x3Cm ?Y. (?X ?Y) math:difference ?Z} => {?M :dd13Cm ?Z}.
+{?M a :Measurement; :dd13Cm ?X; :dy13Cm ?Y. (?X ?Y) math:difference ?Z} => {?M :ddy13Cm ?Z}.
+{?M a :Measurement; :pL1x2Cm ?X; :pL3x4Cm ?Y. (?X ?Y) math:difference ?Z} => {?M :dd24Cm ?Z}.
+{?M a :Measurement; :dd24Cm ?X; :dy24Cm ?Y. (?X ?Y) math:difference ?Z} => {?M :ddy24Cm ?Z}.
+{?M a :Measurement; :cL1 ?X; :cL3 ?Y. (?X ?Y) math:difference ?Z} => {?M :ddL13 ?Z}.
+{?M a :Measurement; :cL1 ?X; :dx51Cm ?Y. (?X ?Y) math:product ?Z} => {?M :pL1dx51Cm ?Z}.
+{?M a :Measurement; :cL1 ?X; :dx62Cm ?Y. (?X ?Y) math:product ?Z} => {?M :pL1dx62Cm ?Z}.
+
+{?M a :Measurement; :ddy13Cm ?X; :ddL13 ?Y. (?X ?Y) math:quotient ?Z} => {?M :p5xCm ?Z}.
+{?M a :Measurement; :pL1dx51Cm ?X; :p1yCm ?Y. (?X ?Y) math:sum ?Z} => {?M :p5yCm ?Z}.
+{?M a :Measurement; :ddy24Cm ?X; :ddL13 ?Y. (?X ?Y) math:quotient ?Z} => {?M :p6xCm ?Z}.
+{?M a :Measurement; :pL1dx62Cm ?X; :p2yCm ?Y. (?X ?Y) math:sum ?Z} => {?M :p6yCm ?Z}.
+
+{?M a :Measurement; :dx53Cm ?X. (?X 2) math:exponentiation ?Z} => {?M :sdx53Cm2 ?Z}.
+{?M a :Measurement; :dx64Cm ?X. (?X 2) math:exponentiation ?Z} => {?M :sdx64Cm2 ?Z}.
+{?M a :Measurement; :dy53Cm ?X. (?X 2) math:exponentiation ?Z} => {?M :sdy53Cm2 ?Z}.
+{?M a :Measurement; :dy64Cm ?X. (?X 2) math:exponentiation ?Z} => {?M :sdy64Cm2 ?Z}.
+{?M a :Measurement; :sdx53Cm2 ?X; :sdy53Cm2 ?Y. (?X ?Y) math:sum ?Z} => {?M :ssd53Cm2 ?Z}.
+{?M a :Measurement; :sdx64Cm2 ?X; :sdy64Cm2 ?Y. (?X ?Y) math:sum ?Z} => {?M :ssd64Cm2 ?Z}.
+
+{?M a :Measurement; :ssd53Cm2 ?X. (?X 0.5) math:exponentiation ?Z} => {?M :d53Cm ?Z}.
+{?M a :Measurement; :ssd64Cm2 ?X. (?X 0.5) math:exponentiation ?Z} => {?M :d64Cm ?Z}.
+
+{?M a :Measurement; :d53Cm ?X; :d64Cm ?Y. (?X ?Y) math:difference ?Z} => {?M :dCm ?Z}.
+
+{?M a :Measurement; :dCm ?X. ?X math:lessThan -1.25} => {?M a :LLDAlarm}.
+{?M a :Measurement; :dCm ?X. ?X math:greaterThan 1.25} => {?M a :LLDAlarm}.