eyeling 1.12.0 → 1.12.2

package/examples/output/superdense-coding.n3

@@ -0,0 +1,6 @@
+@prefix dqc: <https://eyereasoner.github.io/eye/reasoning/dqc#> .
+
+1 dqc:superdense-coding 1 .
+3 dqc:superdense-coding 3 .
+0 dqc:superdense-coding 0 .
+2 dqc:superdense-coding 2 .

package/examples/superdense-coding.n3

@@ -0,0 +1,112 @@
+# -----------------------------------
+# Superdense coding and teleportation
+# -----------------------------------
+#
+# See https://arxiv.org/pdf/1101.3764.pdf and https://arxiv.org/pdf/1010.2929.pdf
+#
+# One remarkable feature of entangled states is superdense coding, whereby
+# entanglement can double the information capacity of a quantum system.
+# Suppose that Alice and Bob initially share a pair of mobits in the joint
+# state |R). Alice can encode two bits (four possible messages) by choosing
+# to apply the operators 1, G, K or KG to her mobit, resulting in one of the
+# four states |R), |S), |U) or |V ). If she then delivers her transformed
+# mobit to Bob, he can perform a joint measurement on both mobits to
+# reliably distinguish these possibilities.
+# The same set of entangled mobit states and single-mobit transformations
+# can also be used to accomplish the analogue of quantum teleportation.
+
+@prefix dqc: <https://eyereasoner.github.io/eye/reasoning/dqc#>.
+@prefix math: <http://www.w3.org/2000/10/swap/math#>.
+@prefix log: <http://www.w3.org/2000/10/swap/log#>.
+
+# |R) = |0, 0) + |1, 1)
+false dqc:r false.
+true dqc:r true.
+
+# |S) = |0, 1) + |1, 0)
+false dqc:s true.
+true dqc:s false.
+
+# |U) = |0, 0) + |1, 0) + |1, 1)
+false dqc:u false.
+true dqc:u false.
+true dqc:u true.
+
+# |V ) = |0, 0) + |0, 1) + |1, 0)
+false dqc:v false.
+false dqc:v true.
+true dqc:v false.
+
+# 1 |0) = |0)
+false dqc:id false.
+# 1 |1) = |1)
+true dqc:id true.
+
+# G |0) = |1)
+false dqc:g true.
+# G |1) = |0)
+true dqc:g false.
+
+# K |0) = |0)
+false dqc:k false.
+# K |1) = |0) + |1)
+true dqc:k false.
+true dqc:k true.
+
+# KG
+{?X dqc:kg ?Y} <= {
+    ?X dqc:g ?Z.
+    ?Z dqc:k ?Y.
+}.
+
+# GK
+{?X dqc:gk ?Y} <= {
+    ?X dqc:k ?Z.
+    ?Z dqc:g ?Y.
+}.
+
+# Superdense coding
+{?N dqc:sdcoding ?M} <= {
+    ?X dqc:r ?Y.
+    ?N dqc:alice (?X ?B).
+    (?B ?Y) dqc:bob ?M.
+}.
+
+# Alice
+{0 dqc:alice (?X ?Y)} <= {
+    ?X dqc:id ?Y.
+}.
+{1 dqc:alice (?X ?Y)} <= {
+    ?X dqc:g ?Y.
+}.
+{2 dqc:alice (?X ?Y)} <= {
+    ?X dqc:k ?Y.
+}.
+{3 dqc:alice (?X ?Y)} <= {
+    ?X dqc:kg ?Y.
+}.
+
+# Bob
+{(?S1 ?S2) dqc:bob 0} <= {
+    ?S1 dqc:gk ?S2.
+}.
+{(?S1 ?S2) dqc:bob 1} <= {
+    ?S1 dqc:k ?S2.
+}.
+{(?S1 ?S2) dqc:bob 2} <= {
+    ?S1 dqc:g ?S2.
+}.
+{(?S1 ?S2) dqc:bob 3} <= {
+    ?S1 dqc:id ?S2.
+}.
+
+# remove answers that appear an even number of times
+{
+    ?X dqc:sdcoding ?Y.
+    (1 {?X dqc:sdcoding ?Y} ?A) log:collectAllIn ?SCOPE.
+    ?A math:sum ?B.
+    (?B 2) math:remainder 1.
+} => {
+    ?X dqc:superdense-coding ?Y.
+}.
+

package/eyeling.js

@@ -1418,7 +1418,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // math:sum
   // Schema: ( $s.i+ )+ math:sum $o-
   if (pv === MATH_NS + 'sum') {
-    if (!(g.s instanceof ListTerm) || g.s.elems.length < 2) return [];
+    // We accept any (possibly empty) closed list here.
+    if (!(g.s instanceof ListTerm)) return [];
     const xs = g.s.elems;
 
     const dtOut0 = commonNumericDatatype(xs, g.o);
@@ -1472,7 +1473,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // math:product
   // Schema: ( $s.i+ )+ math:product $o-
   if (pv === MATH_NS + 'product') {
-    if (!(g.s instanceof ListTerm) || g.s.elems.length < 2) return [];
+    // We accept any (possibly empty) closed list here.
+    if (!(g.s instanceof ListTerm)) return [];
     const xs = g.s.elems;
 
     const dtOut0 = commonNumericDatatype(xs, g.o);

package/lib/builtins.js

@@ -1406,7 +1406,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // math:sum
   // Schema: ( $s.i+ )+ math:sum $o-
   if (pv === MATH_NS + 'sum') {
-    if (!(g.s instanceof ListTerm) || g.s.elems.length < 2) return [];
+    // We accept any (possibly empty) closed list here.
+    if (!(g.s instanceof ListTerm)) return [];
     const xs = g.s.elems;
 
     const dtOut0 = commonNumericDatatype(xs, g.o);
@@ -1460,7 +1461,8 @@ function evalBuiltin(goal, subst, facts, backRules, depth, varGen, maxResults) {
   // math:product
   // Schema: ( $s.i+ )+ math:product $o-
   if (pv === MATH_NS + 'product') {
-    if (!(g.s instanceof ListTerm) || g.s.elems.length < 2) return [];
+    // We accept any (possibly empty) closed list here.
+    if (!(g.s instanceof ListTerm)) return [];
     const xs = g.s.elems;
 
     const dtOut0 = commonNumericDatatype(xs, g.o);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "eyeling",
-  "version": "1.12.0",
+  "version": "1.12.2",
   "description": "A minimal Notation3 (N3) reasoner in JavaScript.",
   "main": "./index.js",
   "keywords": [

package/test/manifest.test.js

@@ -101,7 +101,10 @@ function rmrf(p) {
   ok(`cloned notation3tests ${C.dim}(${r.ms} ms)${C.n}`);
 
   // 2) Install suite dependencies
-  r = run('npm', ['ci'], { cwd: suiteDir });
+  // Notation3tests can carry vulnerabilities in its transient dependency tree.
+  // These are outside Eyeling's control, and npm's audit summary can be noisy in logs.
+  // Disable audit/funding output for this integration test install.
+  r = run('npm', ['ci', '--audit=false', '--fund=false'], { cwd: suiteDir });
   if (r.status !== 0) {
     fail(`npm ci failed (exit ${r.status})`);
     rmrf(workDir);
@@ -131,7 +134,8 @@ function rmrf(p) {
   ok(`packed ${tgzName} ${C.dim}(${pack.ms} ms)${C.n}`);
 
   // 4) Install local tarball into suite
-  r = run('npm', ['install', '--no-save', tgzPath], { cwd: suiteDir });
+  // Keep the install output focused on the actual test run.
+  r = run('npm', ['install', '--no-save', '--audit=false', '--fund=false', tgzPath], { cwd: suiteDir });
   if (r.status !== 0) {
     fail(`npm install eyeling tarball failed (exit ${r.status})`);
     rmrf(tgzPath);