Let (H, <) be the standard total oder an the
Prolog finite terms. Let R be the set of rational
term. H c R. Then there is total order
extention (R, <') of (H, <).
Hi,
Create a ChatGPT for cyclic terms? It seems
that the SWI-Prolog discourse contains a lot
of recent exploration of about cyclic terms.
Yet humans don’t remember them,
or are too lazy to recall them, look them
up again. Maybe to offload some of the cognitive
load and have a easier way forward, one might
use GPT builder and
create a cyclic term assistant. One could
then ask the artificial intelligece (AI) for
the following things:
- Automated Testing:
please perform some monkey testing
on my news compare/3 idea
- Automated Proving:
please suggest a proof for my newest
lemma about compare/3
- Code Refactor:
please refactor my code, I would like to
use (==)/2 instead of same_time/2
- Auto Comment:
please auto comment my code, I was too
lazy to write comments
- What else?
ChatGPT itself gave me a list when I ask
what will be between now and AGI. Could
look it up, as a few interesting items as well
mainly targeting automated summarizing ideas.
Is SWI-Prolog discourse part of the SWI-Prolog
assistant building process. Its less a static
resource, has ongoing discussions. Needs periodic
retraining of the AI.
Also the above vision includes some scenarios
where the Assistant would be better integrated
into an IDE, but these Assistants have usually
more expensive price plans.
Will this IDE be XPCE, who knows?
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 546 |
Nodes: | 16 (2 / 14) |
Uptime: | 40:07:34 |
Calls: | 10,392 |
Files: | 14,064 |
Messages: | 6,417,203 |