experimental (functor; args) compound terms

RELEASE

@@ -1,5 +1,6 @@
                                   EYE release
 
+v10.30.5 (2024-11-22) experimental (functor; args) compound terms
 v10.30.4 (2024-11-19) simplify negative answer surfaces
 v10.30.3 (2024-11-13) solving issue https://github.com/eyereasoner/eye/issues/121
 v10.30.2 (2024-11-11) adjusting to https://eyereasoner.github.io/eye/#eye-color

VERSION

@@ -1 +1 @@
-10.30.4
+10.30.5

eye.pl

@@ -22,7 +22,7 @@
 :- catch(use_module(library(process)), _, true).
 :- catch(use_module(library(http/http_open)), _, true).
 
-version_info('EYE v10.30.4 (2024-11-19)').
+version_info('EYE v10.30.5 (2024-11-22)').
 
 license_info('MIT License
 
@@ -2145,6 +2145,15 @@
     {   sort(List, Distinct)
     },
     ['$', ')'].
+pathitem(compound_term(Functor, Args), Triples) -->
+    ['('],
+    expression(Functor, T1),
+    [';'],
+    !,
+    pathlist(Args, T2),
+    [')'],
+    {   append(T1, T2, Triples)
+    }.
 pathitem(List, Triples) -->
     ['('],
     !,
@@ -4179,6 +4188,13 @@
         write(' true')
     ).
 
+wt2(compound_term(X, Y)) :-
+    !,
+    write('('),
+    wt(X),
+    write(';'),
+    wl(Y),
+    write(')').
 wt2((X, Y)) :-
     !,
     (   atomic(X),
@@ -12703,6 +12719,8 @@
     !.
 raw_type(set(_), '<http://www.w3.org/2000/10/swap/log#Set>') :-
     !.
+raw_type(compound_term(_, _), '<http://www.w3.org/2000/10/swap/log#Compound>') :-
+    !.
 raw_type(A, '<http://www.w3.org/2000/10/swap/log#Formula>') :-
     functor(A, B, C),
     B \= ':',

reasoning/good-cobbler/cobbler-query.n3

@@ -2,7 +2,7 @@
 
 # is there some x which is good at some y
 {
-    ?x a (:good ?y).
+    ?x :is (:good; ?y).
 } => {
     :test :is true.
 }.

reasoning/good-cobbler/cobbler.n3

@@ -6,4 +6,4 @@
 @prefix : <urn:example:>.
 
 # some x is a good cobbler
-_:x a (:good :Cobbler).
+_:x :is (:good; :Cobbler).

reasoning/peano/peano-answer.n3

@@ -1,3 +1,3 @@
 @prefix : <http://example.org/#>.
 
-(:s (:s (:s (:s (:s 0))))) :factorial (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s (:s 0)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))).
+(:s; (:s; (:s; (:s; (:s; 0))))) :factorial (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; (:s; 0)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))).

reasoning/peano/peano-query.n3

@@ -2,8 +2,8 @@
 
 # query
 {
-    ((:s 0) (:s (:s 0))) :multiply ?A.
-    (?A (:s (:s (:s 0)))) :add ?B.
+    ((:s; 0) (:s; (:s; 0))) :multiply ?A.
+    (?A (:s; (:s; (:s; 0)))) :add ?B.
     ?B :factorial ?C.
 } => {
     ?B :factorial ?C.

reasoning/peano/peano.n3

@@ -4,26 +4,26 @@
 # add
 {(?A 0) :add ?A} <= true.
 
-{(?A (:s ?B)) :add (:s ?C)} <= {
+{(?A (:s; ?B)) :add (:s; ?C)} <= {
     (?A ?B) :add ?C.
 }.
 
 # multiply
 {(?A 0) :multiply 0} <= true.
 
-{(?A (:s ?B)) :multiply ?C} <= {
+{(?A (:s; ?B)) :multiply ?C} <= {
     (?A ?B) :multiply ?D.
     (?A ?D) :add ?C.
 }.
 
 # factorial
 {?A :factorial ?B} <= {
-    (?A (:s 0)) :fac ?B.
+    (?A (:s; 0)) :fac ?B.
 }.
 
 {(0 ?A) :fac ?A} <= true.
 
-{((:s ?A) ?B) :fac ?C} <= {
-    (?B (:s ?A)) :multiply ?D.
+{((:s; ?A) ?B) :fac ?C} <= {
+    (?B (:s; ?A)) :multiply ?D.
     (?A ?D) :fac ?C.
 }.