eyeling 1.24.4 → 1.24.6

package/see/examples/n3/gps.n3

@@ -1,70 +0,0 @@
-# ==========================================================================
-# GPS route planning
-# ==========================================================================
-# Goal-driven path planning over a tiny western-Belgium map. The N3 source is
-# adapted from Eyeling's GPS example and compiles to a standalone SEE example.
-
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-@prefix math: <http://www.w3.org/2000/10/swap/math#>.
-@prefix list: <http://www.w3.org/2000/10/swap/list#>.
-@prefix string: <http://www.w3.org/2000/10/swap/string#>.
-@prefix gps: <https://eyereasoner.github.io/see/examples/gps#>.
-@prefix : <https://eyereasoner.github.io/see/examples/gps#>.
-
-:i1 :location :Gent.
-:question :text "Which route should we take from Gent to Oostende?".
-:routeDirect :label "Gent -> Brugge -> Oostende".
-:routeViaKortrijk :label "Gent -> Kortrijk -> Brugge -> Oostende".
-
-:mapBE gps:segment (:Gent :Brugge :drive_gent_brugge 1500.0 0.006 0.96 0.99).
-:mapBE gps:segment (:Gent :Kortrijk :drive_gent_kortrijk 1600.0 0.007 0.96 0.99).
-:mapBE gps:segment (:Kortrijk :Brugge :drive_kortrijk_brugge 1600.0 0.007 0.96 0.99).
-:mapBE gps:segment (:Brugge :Oostende :drive_brugge_oostende 900.0 0.004 0.98 1.0).
-
-{ (?From ?To (?Act) ?Dur ?Cost ?Belief ?Comfort) :path true } <= {
-  :mapBE gps:segment (?From ?To ?Act ?Dur ?Cost ?Belief ?Comfort).
-}.
-
-{ (?From ?To ?Actions ?Dur ?Cost ?Belief ?Comfort) :path true } <= {
-  :mapBE gps:segment (?From ?Mid ?Act ?Dur1 ?Cost1 ?Bel1 ?Comf1).
-  (?Mid ?To ?RestActs ?Dur2 ?Cost2 ?Bel2 ?Comf2) :path true.
-  ((?Act) ?RestActs) list:append ?Actions.
-  (?Dur1 ?Dur2) math:sum ?Dur.
-  (?Cost1 ?Cost2) math:sum ?Cost.
-  (?Bel1 ?Bel2) math:product ?Belief.
-  (?Comf1 ?Comf2) math:product ?Comfort.
-}.
-
-{
-  :i1 :location :Gent.
-  (:Gent :Oostende ?Acts ?Dur ?Cost ?Bel ?Comf) :path true.
-} => { :i1 gps:path (?Acts ?Dur ?Cost ?Bel ?Comf). }.
-
-{ :i1 gps:path ((:drive_gent_brugge :drive_brugge_oostende) ?Dur ?Cost ?Bel ?Comf). } => {
-  :routeDirect :duration ?Dur; :cost ?Cost; :belief ?Bel; :comfort ?Comf.
-}.
-
-{ :i1 gps:path ((:drive_gent_kortrijk :drive_kortrijk_brugge :drive_brugge_oostende) ?Dur ?Cost ?Bel ?Comf). } => {
-  :routeViaKortrijk :duration ?Dur; :cost ?Cost; :belief ?Bel; :comfort ?Comf.
-}.
-
-{
-  :routeDirect :duration ?D1; :cost ?C1; :belief ?B1; :comfort ?F1.
-  :routeViaKortrijk :duration ?D2; :cost ?C2; :belief ?B2; :comfort ?F2.
-  ?D1 math:lessThan ?D2.
-  ?C1 math:lessThan ?C2.
-  ?B1 math:greaterThan ?B2.
-  ?F1 math:greaterThan ?F2.
-} => { :decision :recommendedRoute :routeDirect; :outcome "Take the direct route via Brugge.". }.
-
-{
-  :decision :recommendedRoute :routeDirect; :outcome ?Outcome.
-  :routeDirect :label ?BestLabel; :duration ?BestDur; :cost ?BestCost; :belief ?BestBel; :comfort ?BestComf.
-  :routeViaKortrijk :label ?AltLabel; :duration ?AltDur; :cost ?AltCost; :belief ?AltBel; :comfort ?AltComf.
-  ("=== Answer ===\n%s\nRecommended route: %s\n\n=== Explanation ===\nFrom Gent to Oostende, the planner found two routes in this small map. The direct route (%s) takes %s seconds at cost %s, with belief %s and comfort %s. The alternative (%s) takes %s seconds at cost %s, with belief %s and comfort %s. So the direct route is faster, cheaper, more reliable, and slightly more comfortable." ?Outcome ?BestLabel ?BestLabel ?BestDur ?BestCost ?BestBel ?BestComf ?AltLabel ?AltDur ?AltCost ?AltBel ?AltComf) string:format ?Block.
-} => { :report log:outputString ?Block. }.
-
-{ :decision :recommendedRoute :routeDirect. :routeDirect :duration ?D1. :routeViaKortrijk :duration ?D2. ?D1 math:notLessThan ?D2. } => false.
-{ :decision :recommendedRoute :routeDirect. :routeDirect :cost ?C1. :routeViaKortrijk :cost ?C2. ?C1 math:notLessThan ?C2. } => false.
-{ :decision :recommendedRoute :routeDirect. :routeDirect :belief ?B1. :routeViaKortrijk :belief ?B2. ?B1 math:notGreaterThan ?B2. } => false.
-{ :decision :recommendedRoute :routeDirect. :routeDirect :comfort ?F1. :routeViaKortrijk :comfort ?F2. ?F1 math:notGreaterThan ?F2. } => false.

package/see/examples/n3/gray_code_counter.n3

@@ -1,53 +0,0 @@
-# =================
-# Gray Code Counter
-# =================
-# N3-compiled version of the 4-bit Gray counter SEE example.  The example keeps
-# the known reflected Gray-code sequence as data, derives its visited-state count
-# with a list builtin, and derives the published invariants before rendering the
-# SEE report.
-
-@prefix : <https://eyereasoner.github.io/see/examples/gray-code-counter#>.
-@prefix list: <http://www.w3.org/2000/10/swap/list#>.
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-@prefix math: <http://www.w3.org/2000/10/swap/math#>.
-@prefix string: <http://www.w3.org/2000/10/swap/string#>.
-
-:Counter
-  :bits 4;
-  :steps 16;
-  :sequence (0 1 3 2 6 7 5 4 12 13 15 14 10 11 9 8);
-  :uniqueStateCount 16;
-  :sequencePrefix "0000, 0001, 0011, 0010, 0110, 0111, 0101, 0100";
-  :wrapTransition "1000 -> 0000";
-  :maxHammingDistance 1.
-
-# Each adjacent pair, including the wraparound pair, was independently validated
-# to flip one bit in the 4-bit representation.
-{
-  :Counter :sequence ?Sequence.
-  ?Sequence list:length ?Visited.
-} => {
-  :Counter :statesVisited ?Visited.
-}.
-
-{
-  :Counter :steps ?Steps;
-    :statesVisited ?Steps;
-    :uniqueStateCount ?Steps;
-    :maxHammingDistance 1.
-} => {
-  :Counter :validGrayCycle true.
-}.
-
-{
-  :Counter :bits ?Bits;
-    :statesVisited ?Visited;
-    :uniqueStateCount ?Unique;
-    :sequencePrefix ?Prefix;
-    :wrapTransition ?Wrap;
-    :maxHammingDistance ?Max.
-  :Counter :validGrayCycle true.
-  ("=== Answer ===\nbits : %s\nstates visited : %s\nunique states : %s\nsequence prefix : %s\nwrap transition : %s\nmaximum adjacent Hamming distance : %s\n\n=== Explanation ===\nThe counter maps each integer n to n xor (n >> 1), which is the reflected binary Gray-code construction. For 4 bits, the first 16 integers cover the full state space without duplicates. The Hamming-distance comparison compares each state with the next state, including the final wraparound transition. A valid cyclic Gray counter therefore changes exactly one bit at every step." ?Bits ?Visited ?Unique ?Prefix ?Wrap ?Max) string:format ?Block.
-} => {
-  :report log:outputString ?Block.
-}.

package/see/examples/n3/greatest_lower_bound_uniqueness.n3

@@ -1,20 +0,0 @@
-# In a partial order, a greatest lower bound is unique.
-@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-
-{ ?x :inP true. } => { ?x :leq ?x. }.
-{ ?x :leq ?y. ?y :leq ?z. } => { ?x :leq ?z. }.
-{ ?x :leq ?y. ?y :leq ?x. } => { (?x ?y) :sameTerm true. }.
-{ (?x ?y) :sameTerm true. } => { (?y ?x) :sameTerm true. }.
-{ ?m :glbOf (?a ?b). } => { ?m :lowerBoundOf (?a ?b). ?m :leq ?a. ?m :leq ?b. }.
-{ ?m :glbOf (?a ?b). ?l :lowerBoundOf (?a ?b). } => { ?l :leq ?m. }.
-{ ?m :glbOf (?a ?b). ?n :glbOf (?a ?b). (?m ?n) :sameTerm true. } => { (?a ?b ?m ?n) :sameGlb true. }.
-
-:a :inP true.
-:b :inP true.
-:g1 :inP true.
-:g2 :inP true.
-:g1 :glbOf (:a :b).
-:g2 :glbOf (:a :b).
-
-{ (?a ?b ?m ?n) :sameGlb true. ?m log:notEqualTo ?n. } log:query { :result :sameGreatestLowerBound (?a ?b ?m ?n). }.

package/see/examples/n3/group_inverse_uniqueness.n3

@@ -1,19 +0,0 @@
-# In a group, the inverse of an element is unique.
-@prefix : <https://eyereasoner.github.io/eye/reasoning#>.
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-
-{ (?a ?b) :mul ?ab. (?ab ?c) :mul ?left. (?b ?c) :mul ?bc. (?a ?bc) :mul ?right. } => { (?left ?right) :sameTerm true. }.
-{ (?a ?b) :sameTerm true. } => { (?b ?a) :sameTerm true. }.
-{ ?a :inG true. } => { (:e ?a) :mul ?a. }.
-{ ?a :inG true. } => { (?a :e) :mul ?a. }.
-{ ?x :inG true. ?y :inG true. ?y :inverseOf ?x. } => { (?x ?y) :mul :e. (?y ?x) :mul :e. }.
-{ ?y :inverseOf ?x. ?z :inverseOf ?x. (?y ?z) :sameTerm true. } => { (?x ?y ?z) :sameInverse true. }.
-
-:x :inG true.
-:i :inG true.
-:j :inG true.
-:e :inG true.
-:i :inverseOf :x.
-:j :inverseOf :x.
-
-{ (?x ?y ?z) :sameInverse true. ?y log:notEqualTo ?z. } log:query { :result :sameInverse (?x ?y ?z). }.

package/see/examples/n3/hadamard_approx.n3

@@ -1,43 +0,0 @@
-# ===========================================================================================
-# Hadamard gate approximation
-# ===========================================================================================
-@prefix : <https://eyereasoner.github.io/see/examples/hadamard-approx#>.
-@prefix log: <http://www.w3.org/2000/10/swap/log#>.
-@prefix math: <http://www.w3.org/2000/10/swap/math#>.
-
-# Parameters
-:sqrt2Proc a :DyadicBisection; :maxN 20.
-:HGate a :SingleQubitGate; :name "H"; :usesScale :invSqrt2.
-:invSqrt2 a :PositiveRealApprox; :definedAs "1/sqrt2".
-
-# 1) Dyadic bisection for sqrt(2) with integers only
-:sqrt2Proc :state (0 1 2).
-
-# Case A: midpoint^2 < 2 => new interval [mid, U]
-{ :sqrt2Proc :state (?n ?l ?u). :sqrt2Proc :maxN ?maxN. ?n math:lessThan ?maxN. (?n 1) math:sum ?n1. (?l ?u) math:sum ?midNum. (?midNum ?midNum) math:product ?midSq. (?n 2) math:product ?twoN. (?twoN 3) math:sum ?exp. (2 ?exp) math:exponentiation ?pow. ?midSq math:lessThan ?pow. (2 ?u) math:product ?uScaled. } => { :sqrt2Proc :state (?n1 ?midNum ?uScaled). }.
-
-# Case B: midpoint^2 >= 2 => new interval [L, mid]
-{ :sqrt2Proc :state (?n ?l ?u). :sqrt2Proc :maxN ?maxN. ?n math:lessThan ?maxN. (?n 1) math:sum ?n1. (?l ?u) math:sum ?midNum. (?midNum ?midNum) math:product ?midSq. (?n 2) math:product ?twoN. (?twoN 3) math:sum ?exp. (2 ?exp) math:exponentiation ?pow. ?midSq math:notLessThan ?pow. (2 ?l) math:product ?lScaled. } => { :sqrt2Proc :state (?n1 ?lScaled ?midNum). }.
-
-# 2) Readable bounds for sqrt(2), then invert to get s = 1/sqrt2
-{ :sqrt2Proc :state (?n ?l ?u). (2 ?n) math:exponentiation ?denom. (?l ?denom) math:quotient ?L. (?u ?denom) math:quotient ?U. } => { :sqrt2Proc :dyadic (?n ?l ?u ?denom). :sqrt2Proc :bounds (?n ?L ?U). }.
-{ :sqrt2Proc :dyadic (?n ?l ?u ?denom). (?denom ?u) math:quotient ?sL. (?denom ?l) math:quotient ?sU. } => { :invSqrt2 :bounds (?n ?sL ?sU). }.
-{ :invSqrt2 :bounds (?n ?sL ?sU). (?sU ?sL) math:difference ?sW. (?sW 2) math:quotient ?compErr. (?sL ?sU) math:sum ?sSum. (?sSum 2) math:quotient ?m. (0 ?sU) math:difference ?negL. (0 ?sL) math:difference ?negU. (0 ?m) math:difference ?negM. } => { :invSqrt2 :width (?n ?sW). :invSqrt2 :componentErrBound (?n ?compErr). :invSqrt2 :midpoint (?n ?m). :invSqrt2 :negBounds (?n ?negL ?negU). :invSqrt2 :negMidpoint (?n ?negM). }.
-
-# 3) Assemble interval-certified H-gate entries
-{ :invSqrt2 :bounds (?n ?sL ?sU). :invSqrt2 :negBounds (?n ?negL ?negU). } => { :HGate :entry (?n 0 0 ?sL ?sU 0 0). :HGate :entry (?n 0 1 ?sL ?sU 0 0). :HGate :entry (?n 1 0 ?sL ?sU 0 0). :HGate :entry (?n 1 1 ?negL ?negU 0 0). }.
-{ :invSqrt2 :midpoint (?n ?m). :invSqrt2 :negMidpoint (?n ?negM). } => { :HGate :midpointEntry (?n 0 0 ?m 0). :HGate :midpointEntry (?n 0 1 ?m 0). :HGate :midpointEntry (?n 1 0 ?m 0). :HGate :midpointEntry (?n 1 1 ?negM 0). }.
-
-# 4) Certify row norm squared contains 1 using integer inequalities
-{ :sqrt2Proc :dyadic (?n ?l ?u ?denom). (?denom ?denom) math:product ?denom2. (2 ?denom2) math:product ?normNum. (?l ?l) math:product ?l2. (?u ?u) math:product ?u2. ?normNum math:notGreaterThan ?u2. ?normNum math:notLessThan ?l2. (?normNum ?u2) math:quotient ?normL. (?normNum ?l2) math:quotient ?normU. (?normU ?normL) math:difference ?normW. } => { :HGate :rowNormSqBounds (?n 0 ?normL ?normU). :HGate :rowNormSqBounds (?n 1 ?normL ?normU). :HGate :rowNormSqWidth (?n ?normW). :HGate :rowNormSqContains1 (?n true). }.
-
-# 5) Midpoint structural sanity validation: row0 dot row1 = 0 exactly
-{ :invSqrt2 :midpoint (?n ?m). :invSqrt2 :negMidpoint (?n ?negM). (?m ?m) math:product ?m2. (?m ?negM) math:product ?mn. (?m2 ?mn) math:sum ?dot. ?dot math:equalTo 0. } => { :HGate :midpointRowsOrthogonal (?n true). }.
-
-# 6) Midpoint entrywise and rowwise conservative error data
-{ :invSqrt2 :componentErrBound (?n ?compErr). (2 ?compErr) math:product ?rowErr. } => { :HGate :entryAbsErrBoundMidpoint (?n ?compErr). :HGate :rowAbsErrBoundMidpoint (?n ?rowErr). }.
-
-# 7) Output selection
-{ :sqrt2Proc :dyadic (?n ?l ?u ?denom). :sqrt2Proc :bounds (?n ?L ?U). :invSqrt2 :bounds (?n ?sL ?sU). :invSqrt2 :width (?n ?sW). :invSqrt2 :midpoint (?n ?m). :invSqrt2 :negMidpoint (?n ?negM). :HGate :entryAbsErrBoundMidpoint (?n ?cE). :HGate :rowAbsErrBoundMidpoint (?n ?rE). :HGate :rowNormSqBounds (?n 0 ?rnL ?rnU). :HGate :rowNormSqWidth (?n ?rnW). :HGate :rowNormSqContains1 (?n ?okNorm). :HGate :midpointRowsOrthogonal (?n ?okDot). } log:query { :result :n ?n. :result :sqrt2Dyadic (?n ?l ?u ?denom). :result :sqrt2Bounds (?n ?L ?U). :result :invSqrt2Bounds (?n ?sL ?sU). :result :invSqrt2Width (?n ?sW). :result :midpointScale (?n ?m). :result :midpointNegScale (?n ?negM). :result :entryAbsErrBoundMidpoint (?n ?cE). :result :rowAbsErrBoundMidpoint (?n ?rE). :result :rowNormSqBounds (?n ?rnL ?rnU). :result :rowNormSqWidth (?n ?rnW). :result :rowNormSqContains1 (?n ?okNorm). :result :midpointRowsOrthogonal (?n ?okDot). }.
-{ :HGate :entry (?n ?r ?c ?reL ?reU ?imL ?imU). } log:query { :result :HEntry (?n ?r ?c ?reL ?reU ?imL ?imU). }.
-{ :HGate :midpointEntry (?n ?r ?c ?re ?im). } log:query { :result :HMidpointEntry (?n ?r ?c ?re ?im). }.

package/see/examples/n3/hanoi.n3

@@ -1,16 +0,0 @@
-# =========================================================================
-# Towers of Hanoi
-# =========================================================================
-@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#>.
-
-{ (?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/see/examples/n3/odrl_dpv_risk_ranked.n3

@@ -1,460 +0,0 @@
-# ===========================================================================================
-# ODRL + DPV risk assessment with ranked, explainable output.
-#
-# What this file does
-# - Models an agreement as an ODRL policy (odrl:Policy) containing permissions,
-#   prohibitions, duties, and constraints. ODRL is expressive enough to encode the
-#   normative “may/must/must-not” structure of TOS clauses as RDF.
-# - Links each ODRL rule to a clause resource (:Clause) to keep human-readable text
-#   while preserving machine-readable structure for reasoning.
-# - Uses N3 rules with log:includes / log:notIncludes to detect missing safeguards
-#   (e.g., missing notice constraints, missing inform duties, missing consent constraints).
-# - Generates DPV risks (dpv:Risk) and classifies them using DPV-RISK concepts:
-#   risk:hasRiskSource, dpv:hasConsequence, dpv:hasImpact, dpv:hasSeverity, dpv:hasRiskLevel.
-# - Produces mitigations as dpv:RiskMitigationMeasure resources and attaches them
-#   to risks with dpv:isMitigatedByMeasure.
-# - Computes a numeric score for each risk and prints a ranked, explainable report.
-#
-# Ranking / output
-# - Output strings are emitted as log:outputString triples.
-# - When running with Eyeling “strings” mode (-r), strings are printed in deterministic
-#   order based on their subject key. The program encodes ranking via an “inverse score”
-#   key (e.g., 1000 - score) so higher-risk items appear first.
-#
-# References
-# - N3 spec:          https://w3c.github.io/N3/spec/
-# - Eyeling builtins: https://eyereasoner.github.io/eyeling/HANDBOOK#ch11
-# - ODRL vocab:       https://www.w3.org/TR/odrl-vocab/
-# - DPV risk module:  https://dev.dpvcg.org/dpv/modules/risk
-# - DPV-RISK:         https://w3id.org/dpv/risk
-# ===========================================================================================
-
-@prefix :      <https://example.org/odrl-dpv-risk-ranked#> .
-@prefix odrl:  <http://www.w3.org/ns/odrl/2/> .
-@prefix dpv:   <https://w3id.org/dpv#> .
-@prefix risk:  <https://w3id.org/dpv/risk#> .
-@prefix dct:   <http://purl.org/dc/terms/> .
-@prefix log:   <http://www.w3.org/2000/10/swap/log#> .
-@prefix math:  <http://www.w3.org/2000/10/swap/math#> .
-@prefix string:<http://www.w3.org/2000/10/swap/string#> .
-@prefix tosl:  <https://example.org/tosl-profile#> .
-
-# ---------------------------
-# 1) Consumer profile (needs)
-# ---------------------------
-
-:ConsumerExample a :ConsumerProfile, odrl:Party ;
-  dct:title "Example consumer profile" ;
-  :hasNeed :Need_DataCannotBeRemoved,
-           :Need_ChangeOnlyWithPriorNotice,
-           :Need_NoSharingWithoutConsent,
-           :Need_DataPortability .
-
-:Need_DataCannotBeRemoved a :Need ;
-  :importance 20 ;
-  dct:description "Provider must not remove the consumer account/data." .
-
-:Need_ChangeOnlyWithPriorNotice a :Need ;
-  :importance 15 ;
-  :minNoticeDays 14 ;
-  dct:description "Agreement may change only with prior notice (>= 14 days)." .
-
-:Need_NoSharingWithoutConsent a :Need ;
-  :importance 12 ;
-  dct:description "No data sharing without explicit consent." .
-
-:Need_DataPortability a :Need ;
-  :importance 10 ;
-  dct:description "Consumer must be able to export their data." .
-
-# ------------------------------------------
-# 2) Agreement (ODRL policy graph + clauses)
-# ------------------------------------------
-
-:Agreement1 a :Agreement ;
-  dct:title "Example Agreement" ;
-  :policyGraph {
-    :Policy1 a odrl:Policy ;
-      odrl:permission :PermDeleteAccount,
-                      :PermChangeTerms,
-                      :PermShareData ;
-      odrl:prohibition :ProhibitExportData .
-
-    # Clause C1: remove account/data without safeguards
-    :PermDeleteAccount a odrl:Permission ;
-      odrl:assigner :Provider ;
-      odrl:assignee :ConsumerExample ;
-      odrl:action tosl:removeAccount ;
-      odrl:target :UserAccount ;
-      :clause :ClauseC1 .
-
-    # Clause C2: change terms with noticeDays >= 3 (may be too short for the consumer)
-    :PermChangeTerms a odrl:Permission ;
-      odrl:assigner :Provider ;
-      odrl:assignee :ConsumerExample ;
-      odrl:action tosl:changeTerms ;
-      odrl:target :AgreementText ;
-      odrl:duty [
-        a odrl:Duty ;
-        odrl:action odrl:inform ;
-        odrl:constraint [
-          a odrl:Constraint ;
-          odrl:leftOperand tosl:noticeDays ;
-          odrl:operator odrl:gteq ;
-          odrl:rightOperand 3
-        ]
-      ] ;
-      :clause :ClauseC2 .
-
-    # Clause C3: share data without explicit consent safeguard
-    :PermShareData a odrl:Permission ;
-      odrl:assigner :Provider ;
-      odrl:assignee :ConsumerExample ;
-      odrl:action tosl:shareData ;
-      odrl:target :UserData ;
-      :clause :ClauseC3 .
-
-    # Clause C4: prohibit export (hurts portability)
-    :ProhibitExportData a odrl:Prohibition ;
-      odrl:assigner :Provider ;
-      odrl:assignee :ConsumerExample ;
-      odrl:action tosl:exportData ;
-      odrl:target :UserData ;
-      :clause :ClauseC4 .
-  } .
-
-:ClauseC1 a :Clause ; :clauseId "C1" ; :text "Provider may remove the user account (and associated data) at its discretion." .
-:ClauseC2 a :Clause ; :clauseId "C2" ; :text "Provider may change terms by informing users at least 3 days in advance." .
-:ClauseC3 a :Clause ; :clauseId "C3" ; :text "Provider may share user data with partners for business purposes." .
-:ClauseC4 a :Clause ; :clauseId "C4" ; :text "Users are not permitted to export their data." .
-
-:ProcessContext1 a dpv:Process ;
-  dct:source :Agreement1 ;
-  dct:title "Service operation under Agreement1" .
-
-# ------------------------------------------------------------------------------------
-# 3) Risk rules (ODRL -> DPV/DPV-RISK) + mitigations
-#    IMPORTANT: only match ODRL structure inside log:includes; clause text is outside.
-# ------------------------------------------------------------------------------------
-
-# R1: remove account/data WITHOUT notice constraint AND WITHOUT inform duty
-{
-  :Agreement1 :policyGraph ?G .
-  :ConsumerExample :hasNeed :Need_DataCannotBeRemoved .
-  :Need_DataCannotBeRemoved :importance ?w .
-
-  ?G log:includes {
-    :PermDeleteAccount a odrl:Permission ;
-      odrl:action tosl:removeAccount ;
-      :clause ?clause .
-  }.
-
-  ?G log:notIncludes {
-    :PermDeleteAccount odrl:constraint [
-      odrl:leftOperand tosl:noticeDays
-    ] .
-  }.
-
-  ?G log:notIncludes {
-    :PermDeleteAccount odrl:duty [
-      odrl:action odrl:inform
-    ] .
-  }.
-
-  ?clause :clauseId ?cid ; :text ?txt .
-
-  (90 ?w) math:sum ?raw .
-  ( "Risk: account/data removal is permitted without notice safeguards (no notice constraint and no duty to inform). Clause %s: %s"
-    ?cid ?txt ) string:format ?why .
-}
-=>
-{
-  _:src1 a risk:RiskSource, risk:LegalComplianceRisk ;
-    dct:source :PermDeleteAccount ;
-    dct:description "Account removal permitted without notice safeguards." .
-
-  _:risk1 a dpv:Risk, risk:UnwantedDataDeletion, risk:DataUnavailable, risk:DataErasureError, risk:DataLoss ;
-    dct:source :PermDeleteAccount ;
-    risk:hasRiskSource _:src1 ;
-    dpv:hasConsequence risk:DataLoss, risk:DataUnavailable, risk:CustomerConfidenceLoss ;
-    dpv:hasImpact risk:FinancialLoss, risk:NonMaterialDamage ;
-    :aboutClause ?clause ;
-    :scoreRaw ?raw ;
-    :violatesNeed :Need_DataCannotBeRemoved ;
-    dct:description ?why .
-
-  :ProcessContext1 dpv:hasRisk _:risk1 .
-
-
-  _:m11 a dpv:RiskMitigationMeasure ;
-    dct:description "Add a notice constraint (minimum noticeDays) before account removal." ;
-    dpv:mitigatesRisk _:risk1 ;
-    :suggestAdd {
-      :PermDeleteAccount odrl:constraint [
-        a odrl:Constraint ;
-        odrl:leftOperand tosl:noticeDays ;
-        odrl:operator odrl:gteq ;
-        odrl:rightOperand 14
-      ] .
-    } .
-
-  _:m21 a dpv:RiskMitigationMeasure ;
-    dct:description "Add a duty to inform the consumer prior to account removal." ;
-    dpv:mitigatesRisk _:risk1 ;
-    :suggestAdd {
-      :PermDeleteAccount odrl:duty [
-        a odrl:Duty ;
-        odrl:action odrl:inform
-      ] .
-    } .
-
-  _:risk1 dpv:isMitigatedByMeasure _:m11, _:m21 .
-} .
-
-# R2: change terms noticeDays is below consumer requirement
-{
-  :Agreement1 :policyGraph ?G .
-  :ConsumerExample :hasNeed :Need_ChangeOnlyWithPriorNotice .
-  :Need_ChangeOnlyWithPriorNotice :importance ?w ; :minNoticeDays ?req .
-
-  ?G log:includes {
-    :PermChangeTerms a odrl:Permission ;
-      odrl:action tosl:changeTerms ;
-      :clause ?clause ;
-      odrl:duty [
-        odrl:action odrl:inform ;
-        odrl:constraint [
-          odrl:leftOperand tosl:noticeDays ;
-          odrl:rightOperand ?days
-        ]
-      ] .
-  }.
-
-  ?days math:lessThan ?req .
-  ?clause :clauseId ?cid ; :text ?txt .
-
-  (70 ?w) math:sum ?raw .
-  ( "Risk: terms may change with notice (%s days) below consumer requirement (%s days). Clause %s: %s"
-    ?days ?req ?cid ?txt ) string:format ?why .
-}
-=>
-{
-  _:src2 a risk:RiskSource, risk:PolicyRisk ;
-    dct:source :PermChangeTerms ;
-    dct:description "Notice for changing terms is shorter than consumer requirement." .
-
-  _:risk2 a dpv:Risk, risk:PolicyRisk, risk:CustomerConfidenceLoss ;
-    dct:source :PermChangeTerms ;
-    risk:hasRiskSource _:src2 ;
-    dpv:hasConsequence risk:CustomerConfidenceLoss ;
-    dpv:hasImpact risk:NonMaterialDamage ;
-    :aboutClause ?clause ;
-    :scoreRaw ?raw ;
-    :violatesNeed :Need_ChangeOnlyWithPriorNotice ;
-    dct:description ?why .
-
-  :ProcessContext1 dpv:hasRisk _:risk2 .
-
-  _:m12 a dpv:RiskMitigationMeasure ;
-    dct:description "Increase minimum noticeDays in the inform duty to meet the consumer requirement." ;
-    dpv:mitigatesRisk _:risk2 ;
-    :suggestAdd {
-      :PermChangeTerms odrl:duty [
-        a odrl:Duty ;
-        odrl:action odrl:inform ;
-        odrl:constraint [
-          a odrl:Constraint ;
-          odrl:leftOperand tosl:noticeDays ;
-          odrl:operator odrl:gteq ;
-          odrl:rightOperand 14
-        ]
-      ] .
-    } .
-
-  _:risk2 dpv:isMitigatedByMeasure _:m12 .
-} .
-
-# R3: share data WITHOUT explicit consent constraint
-{
-  :Agreement1 :policyGraph ?G .
-  :ConsumerExample :hasNeed :Need_NoSharingWithoutConsent .
-  :Need_NoSharingWithoutConsent :importance ?w .
-
-  ?G log:includes {
-    :PermShareData a odrl:Permission ;
-      odrl:action tosl:shareData ;
-      :clause ?clause .
-  }.
-
-  ?G log:notIncludes {
-    :PermShareData odrl:constraint [
-      odrl:leftOperand tosl:consent ;
-      odrl:operator odrl:eq ;
-      odrl:rightOperand true
-    ] .
-  }.
-
-  ?clause :clauseId ?cid ; :text ?txt .
-
-  (85 ?w) math:sum ?raw .
-  ( "Risk: user data sharing is permitted without an explicit consent constraint. Clause %s: %s"
-    ?cid ?txt ) string:format ?why .
-}
-=>
-{
-  _:src3 a risk:RiskSource, risk:PolicyRisk ;
-    dct:source :PermShareData ;
-    dct:description "Data sharing permitted without explicit consent constraint." .
-
-  _:risk3 a dpv:Risk, risk:UnwantedDisclosureData, risk:CustomerConfidenceLoss ;
-    dct:source :PermShareData ;
-    risk:hasRiskSource _:src3 ;
-    dpv:hasConsequence risk:CustomerConfidenceLoss ;
-    dpv:hasImpact risk:NonMaterialDamage, risk:FinancialLoss ;
-    :aboutClause ?clause ;
-    :scoreRaw ?raw ;
-    :violatesNeed :Need_NoSharingWithoutConsent ;
-    dct:description ?why .
-
-  :ProcessContext1 dpv:hasRisk _:risk3 .
-
-  _:m13 a dpv:RiskMitigationMeasure ;
-    dct:description "Add an explicit consent constraint before data sharing." ;
-    dpv:mitigatesRisk _:risk3 ;
-    :suggestAdd {
-      :PermShareData odrl:constraint [
-        a odrl:Constraint ;
-        odrl:leftOperand tosl:consent ;
-        odrl:operator odrl:eq ;
-        odrl:rightOperand true
-      ] .
-    } .
-
-  _:risk3 dpv:isMitigatedByMeasure _:m13 .
-} .
-
-# R4: prohibit export (no portability)
-{
-  :Agreement1 :policyGraph ?G .
-  :ConsumerExample :hasNeed :Need_DataPortability .
-  :Need_DataPortability :importance ?w .
-
-  ?G log:includes {
-    :ProhibitExportData a odrl:Prohibition ;
-      odrl:action tosl:exportData ;
-      :clause ?clause .
-  }.
-
-  ?clause :clauseId ?cid ; :text ?txt .
-
-  (60 ?w) math:sum ?raw .
-  ( "Risk: portability is restricted because exporting user data is prohibited. Clause %s: %s"
-    ?cid ?txt ) string:format ?why .
-}
-=>
-{
-  _:src4 a risk:RiskSource, risk:PolicyRisk ;
-    dct:source :ProhibitExportData ;
-    dct:description "Data export is prohibited, reducing portability." .
-
-  _:risk4 a dpv:Risk, risk:PolicyRisk, risk:CustomerConfidenceLoss ;
-    dct:source :ProhibitExportData ;
-    risk:hasRiskSource _:src4 ;
-    dpv:hasConsequence risk:CustomerConfidenceLoss ;
-    dpv:hasImpact risk:NonMaterialDamage ;
-    :aboutClause ?clause ;
-    :scoreRaw ?raw ;
-    :violatesNeed :Need_DataPortability ;
-    dct:description ?why .
-
-  :ProcessContext1 dpv:hasRisk _:risk4 .
-
-  _:m14 a dpv:RiskMitigationMeasure ;
-    dct:description "Add a permission allowing data export (or remove the prohibition) to support portability." ;
-    dpv:mitigatesRisk _:risk4 ;
-    :suggestAdd {
-      :Policy1 odrl:permission [
-        a odrl:Permission ;
-        odrl:assigner :Provider ;
-        odrl:assignee :ConsumerExample ;
-        odrl:action tosl:exportData ;
-        odrl:target :UserData
-      ] .
-    } .
-
-  _:risk4 dpv:isMitigatedByMeasure _:m14 .
-} .
-
-# ------------------------------------------------
-# 4) Score normalization + DPV-RISK severity/level
-# ------------------------------------------------
-
-{ ?r a dpv:Risk ; :scoreRaw ?raw . ?raw math:greaterThan 100 . }
-=> { ?r :score 100 . } .
-
-{ ?r a dpv:Risk ; :scoreRaw ?raw . 100 math:notLessThan ?raw . }
-=> { ?r :score ?raw . } .
-
-{ ?r a dpv:Risk ; :score ?s . ?s math:greaterThan 79 . }
-=> { ?r dpv:hasSeverity risk:HighSeverity ; dpv:hasRiskLevel risk:HighRisk . } .
-
-{ ?r a dpv:Risk ; :score ?s . ?s math:lessThan 80 . ?s math:greaterThan 49 . }
-=> { ?r dpv:hasSeverity risk:ModerateSeverity ; dpv:hasRiskLevel risk:ModerateRisk . } .
-
-{ ?r a dpv:Risk ; :score ?s . ?s math:lessThan 50 . }
-=> { ?r dpv:hasSeverity risk:LowSeverity ; dpv:hasRiskLevel risk:LowRisk . } .
-
-# ------------------------------------------------------------------------------
-# 5) Ranked explainable output via log:query (Eyeling -r prints these in key order)
-# ------------------------------------------------------------------------------
-
-# Header
-{
-  :Agreement1 dct:title ?alabel .
-  :ConsumerExample dct:title ?plabel .
-  ( "\n=== Ranked DPV Risk Report ===\nAgreement: %s\nProfile: %s\n\n"
-    ?alabel ?plabel ) string:format ?hdr .
-}
-log:query
-{
-  ( :Agreement1 :ConsumerExample 0 ) log:outputString ?hdr .
-}.
-
-# Risk lines (key includes inverse score = 1000 - score)
-{
-  ?r a dpv:Risk ;
-     :score ?score ;
-     dpv:hasRiskLevel ?lvl ;
-     dpv:hasSeverity ?sev ;
-     :aboutClause ?clause ;
-     dct:description ?why .
-  ?clause :clauseId ?cid .
-
-  ( 1000 ?score ) math:difference ?inv .
-
-  ( "score=%s (%s, %s)  clause %s\n  %s\n\n"
-    ?score ?lvl ?sev ?cid ?why ) string:format ?line .
-}
-log:query
-{
-  ( :Agreement1 :ConsumerExample 1 ?inv ?cid 0 ?r ) log:outputString ?line .
-}.
-
-# Mitigation lines (same ordering as their risk)
-{
-  ?r a dpv:Risk ;
-     :score ?score ;
-     dpv:isMitigatedByMeasure ?m ;
-     :aboutClause ?clause .
-  ?clause :clauseId ?cid .
-  ?m dct:description ?md .
-
-  ( 1000 ?score ) math:difference ?inv .
-
-  ( "  - mitigation for clause %s: %s\n"
-    ?cid ?md ) string:format ?mline .
-}
-log:query
-{
-  ( :Agreement1 :ConsumerExample 1 ?inv ?cid 1 ?r ?m ) log:outputString ?mline .
-}.