Hi,
How fast is EyeProlog, do we need -C-WAM?
Ok, here is a test:
between2(L, L, R) :- !, L = R.
between2(L, _, L).
between2(L, H, X) :- J is L+1, between2(J, H, X).
test :-
-a-a between2(1, 100, _),
-a-a between2(1, 100, _),
-a-a between2(1, 100, _),
-a-a fail.
test.
I get for EyeProlog and Dogelog:
/* EyeProlog */
0.476 sec
https://eyereasoner.github.io/eyeprolog/playground
/* Dogelog */
% Zeit 446.020 ms, GC 0.000 ms, Lips 6794 k
https://www.herbrand.ai/
Thats not bad. Now watch -C-WAM, the first
AI accelerated Prolog subset, with
JavaScript Workers:
:- ensure_loaded(library(misc/brainfog)).
test2 :-
-a-a execute((between(1,100,_),
-a-a-a-a-a-a-a-a-a-a-a between(1,100,_),
-a-a-a-a-a-a-a-a-a-a-a between(1,100,_))).
?- time(test2).
% Zeit 52.675 ms, GC 0.000 ms, Lips 9 k
true.
BTW: With JavaScript WebGPU the AI acceleration
is even an itch stronger, if the problem can
be parallelized.
Have Fun!
Bye
Hi,
Its interesting that we already have
like for 50 years the Curry Howard
isomorphims, as proof justifications terms,
Still it seems extremly hard to generate
proof certificates for Prolog, isn't it?
How it started:
Ai x Big Gas. What could go wrong? https://www.youtube.com/watch?v=kON2ZI2BNj8
How its going:
eq(Z,Z).
why eq(f(X,a),f(b,Y))
eq(f(b, a), f(b, a)).
why(
-a eq(f(b, a), f(b, a)),
-a proof(
-a-a-a goal(eq(f(b, a), f(b, a))),
-a-a-a by(fact("<input>", clause(1))),
-a-a-a bindings([binding("Z", f(b, a))])
-a )
).
https://eyereasoner.github.io/eyeprolog/playground
Truely some bullshit authorized by Sarah Connor.
So far there is no danger of an upcoming
Skynet that will gained self-awareness.
Bye
Mild Shock schrieb:
Hi,
How fast is EyeProlog, do we need -C-WAM?
Ok, here is a test:
between2(L, L, R) :- !, L = R.
between2(L, _, L).
between2(L, H, X) :- J is L+1, between2(J, H, X).
test :-
-a-a-a between2(1, 100, _),
-a-a-a between2(1, 100, _),
-a-a-a between2(1, 100, _),
-a-a-a fail.
test.
I get for EyeProlog and Dogelog:
/* EyeProlog */
0.476 sec
https://eyereasoner.github.io/eyeprolog/playground
/* Dogelog */
% Zeit 446.020 ms, GC 0.000 ms, Lips 6794 k
https://www.herbrand.ai/
Thats not bad. Now watch -C-WAM, the first
AI accelerated Prolog subset, with
JavaScript Workers:
:- ensure_loaded(library(misc/brainfog)).
test2 :-
-a-a-a execute((between(1,100,_),
-a-a-a-a-a-a-a-a-a-a-a-a between(1,100,_),
-a-a-a-a-a-a-a-a-a-a-a-a between(1,100,_))).
?- time(test2).
% Zeit 52.675 ms, GC 0.000 ms, Lips 9 k
true.
BTW: With JavaScript WebGPU the AI acceleration
is even an itch stronger, if the problem can
be parallelized.
Have Fun!
Bye
Hi,
Its interesting that we already have
like for 50 years the Curry Howard
isomorphims, as proof justifications terms,
Still it seems extremly hard to generate
proof certificates for Prolog, isn't it?
How it started:
Ai x Big Gas. What could go wrong? https://www.youtube.com/watch?v=kON2ZI2BNj8
How its going:
eq(Z,Z).
why eq(f(X,a),f(b,Y))
eq(f(b, a), f(b, a)).
why(
-a eq(f(b, a), f(b, a)),
-a proof(
-a-a-a goal(eq(f(b, a), f(b, a))),
-a-a-a by(fact("<input>", clause(1))),
-a-a-a bindings([binding("Z", f(b, a))])
-a )
).
https://eyereasoner.github.io/eyeprolog/playground
Truely some bullshit authorized by Sarah Connor.
So far there is no danger of an upcoming
Skynet that will gained self-awareness.
Bye
Mild Shock schrieb:
Hi,
How fast is EyeProlog, do we need -C-WAM?
Ok, here is a test:
between2(L, L, R) :- !, L = R.
between2(L, _, L).
between2(L, H, X) :- J is L+1, between2(J, H, X).
test :-
-a-a-a between2(1, 100, _),
-a-a-a between2(1, 100, _),
-a-a-a between2(1, 100, _),
-a-a-a fail.
test.
I get for EyeProlog and Dogelog:
/* EyeProlog */
0.476 sec
https://eyereasoner.github.io/eyeprolog/playground
/* Dogelog */
% Zeit 446.020 ms, GC 0.000 ms, Lips 6794 k
https://www.herbrand.ai/
Thats not bad. Now watch -C-WAM, the first
AI accelerated Prolog subset, with
JavaScript Workers:
:- ensure_loaded(library(misc/brainfog)).
test2 :-
-a-a-a execute((between(1,100,_),
-a-a-a-a-a-a-a-a-a-a-a-a between(1,100,_),
-a-a-a-a-a-a-a-a-a-a-a-a between(1,100,_))).
?- time(test2).
% Zeit 52.675 ms, GC 0.000 ms, Lips 9 k
true.
BTW: With JavaScript WebGPU the AI acceleration
is even an itch stronger, if the problem can
be parallelized.
Have Fun!
Bye
Hi,
ergoAlp at least tries to provide not only
a why, but also a whyNot. But already its
why is not very convincing. I guess the
conjunction order got scrambled. I get:
?- why(ancestor(albert, dan)).
-aruA ancestor(albert,dan)
-a-a ruA ancestor(bob,dan)
-a-a-a-a ruA ancestor(carol,dan)
-a-a-a-a-a-a ruA parent(carol,dan)
-a-a-a-a ruA parent(bob,carol)
-a-a ruA parent(albert,bob)
https://ergoai-studio2-wasm.interprolog.com/
Using my library(kbref) in Dogelog Player,
I get the more convincing:
?- why(ancestor(albert, dan)).
-aruA ancestor(albert, dan)
-a-a-a ruA parent(albert, bob)
-a-a-a ruA ancestor(bob, dan)
-a-a-a-a-a-a ruA parent(bob, carol)
-a-a-a-a-a-a ruA ancestor(carol, dan)
-a-a-a-a-a-a-a-a-a ruA parent(carol, dan)
true;
fail.
And unlike ergoAlp, I don't need to call
solve/2 inside show/3, there is enough
information in the clause references to
reconstruct head bindings. Source code:
:- ensure_loaded(library(edge/kbrefs)).
why(G) :-
-a-a solve(G, T),
-a-a show(G, T, 0).
solve(true, true) :- !.
solve((A,B), (J,K)) :- !,
-a-a solve(A, J),
-a-a solve(B, K).
solve(H, (J,K)) :-
-a-a clause(H, B, J),
-a-a solve(B, K).
show(true, true, _) :- !.
show((A,B), (J,K), O) :- !,
-a-a show(A, J, O),
-a-a show(B, K, O).
show(H, (J,K), O) :-
-a-a compiled(J, H, B),
-a-a tab(O), write(' ruA '), writeq(H), nl,
-a-a O2 is O+3,
-a-a show(B, K, O2).
The predicates clause/3 and compiled/3 are from
library(edge/kbref) and not found in the ISO
core standard. Also I made parent/2 and
ancestor/3 dynamic to be able to access it.
Mild Shock schrieb:
Hi,
Its interesting that we already have
like for 50 years the Curry Howard
isomorphims, as proof justifications terms,
Still it seems extremly hard to generate
proof certificates for Prolog, isn't it?
How it started:
Ai x Big Gas. What could go wrong?
https://www.youtube.com/watch?v=kON2ZI2BNj8
How its going:
eq(Z,Z).
why eq(f(X,a),f(b,Y))
eq(f(b, a), f(b, a)).
why(
-a-a eq(f(b, a), f(b, a)),
-a-a proof(
-a-a-a-a goal(eq(f(b, a), f(b, a))),
-a-a-a-a by(fact("<input>", clause(1))),
-a-a-a-a bindings([binding("Z", f(b, a))])
-a-a )
).
https://eyereasoner.github.io/eyeprolog/playground
Truely some bullshit authorized by Sarah Connor.
So far there is no danger of an upcoming
Skynet that will gained self-awareness.
Bye
Mild Shock schrieb:
Hi,
How fast is EyeProlog, do we need -C-WAM?
Ok, here is a test:
between2(L, L, R) :- !, L = R.
between2(L, _, L).
between2(L, H, X) :- J is L+1, between2(J, H, X).
test :-
-a-a-a between2(1, 100, _),
-a-a-a between2(1, 100, _),
-a-a-a between2(1, 100, _),
-a-a-a fail.
test.
I get for EyeProlog and Dogelog:
/* EyeProlog */
0.476 sec
https://eyereasoner.github.io/eyeprolog/playground
/* Dogelog */
% Zeit 446.020 ms, GC 0.000 ms, Lips 6794 k
https://www.herbrand.ai/
Thats not bad. Now watch -C-WAM, the first
AI accelerated Prolog subset, with
JavaScript Workers:
:- ensure_loaded(library(misc/brainfog)).
test2 :-
-a-a-a execute((between(1,100,_),
-a-a-a-a-a-a-a-a-a-a-a-a between(1,100,_),
-a-a-a-a-a-a-a-a-a-a-a-a between(1,100,_))).
?- time(test2).
% Zeit 52.675 ms, GC 0.000 ms, Lips 9 k
true.
BTW: With JavaScript WebGPU the AI acceleration
is even an itch stronger, if the problem can
be parallelized.
Have Fun!
Bye
| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 76 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 55:36:18 |
| Calls: | 1,265 |
| Calls today: | 1 |
| Files: | 1,362 |
| D/L today: |
3 files (2,684K bytes) |
| Messages: | 285,684 |