Yeah, you should probably come up yourself with control rules that would
speed up problem solving for your test case, then evaluate if the
current system (used to speed the alphabetic problem) would be able to
learn it (there are some technical limitations that might make it hard
to learn, the main one being that the pattern miner as currently written
can only learn syntactic abstractions, this can be worked around in
various ways but it requires care).
So once you have your problem and your optimal (or at least better than
average) control rule set, I can help you to evaluate if the current
system can handle it.
Nil
On 7/20/21 5:46 PM, Michele Thiella wrote:
Since some details on my thesis have changed,
maybe I first try to formalize the problem and a line of thought to
solve it.
Then, write some comments and text to share with you.
In order to understand even if it is feasible to do "learn control rules
to speed up problem solving",
with my deadlines (thank you in advance Nil for the publication proposal)
Michele
Il giorno martedì 20 luglio 2021 alle 16:13:34 UTC+2 Michele Thiella ha
scritto:
Hi everyone, sorry if I disappeared, I had to complete the exams.
In the next days, I will retrieve your latest tips and try to use
states and transitions between states.
Il giorno venerdì 28 maggio 2021 alle 09:20:07 UTC+2 Nil ha scritto:
On 5/28/21 10:11 AM, Nil Geisweiller wrote:
>
>
> On 5/28/21 10:07 AM, Nil Geisweiller wrote:
>> It's BTW totally publishable material, the only reason I didn't
>> publish is because I consider the alphabetic problem to be too
>> trivial, and then I had to move on to other things and
didn't have
>> time to try on less trivial problems. If you can achieve
that on the
>> worldsblock problem, we can write a paper about it.
>
> Some more info on the subject
>
>
https://blog.singularitynet.io/introspective-reasoning-within-the-opencog-framework-1bc7e182827
<https://blog.singularitynet.io/introspective-reasoning-within-the-opencog-framework-1bc7e182827>
>
>
https://blog.opencog.org/2017/10/14/inference-meta-learning-part-i/
<https://blog.opencog.org/2017/10/14/inference-meta-learning-part-i/>
Here are two publications describing the pattern miner and the
planner/controller that the inference meta learning system uses
https://github.com/ngeiswei/papers/blob/master/MineSurprisingPatterns/MineSurprisingPatterns.pdf
<https://github.com/ngeiswei/papers/blob/master/MineSurprisingPatterns/MineSurprisingPatterns.pdf>
https://github.com/ngeiswei/papers/blob/master/PartialBetaOperatorInduction/PartialBetaOperatorInduction.pdf
<https://github.com/ngeiswei/papers/blob/master/PartialBetaOperatorInduction/PartialBetaOperatorInduction.pdf>
Nil
>
> Nil
>
>>
>> Nil
>>
>>>
>>> Nil
>>>
>>>>
>>>> PS. Blocksword Problem (very briefly) = some blocks on
table, 4
>>>> action (pick-up, put-down, stack: block 1 above block 2,
unstack:
>>>> pick-up block 1 which is above block 2), objective: to
build a tower
>>>> of blocks
>>>>
>>>> Michele
>>>> Il giorno lunedì 24 maggio 2021 alle 20:08:04 UTC+2 linas
ha scritto:
>>>>
>>>> I know nothing about the blocksworld problem, so I
cannot help
>>>> directly. Indirectly, you can use (cog-report-counts)
to monitor
>>>> the number of atoms in the atomspace -- I typically
see an average
>>>> of about 1KB or 2KB per atom. So, a few GB is enough
for millions
>>>> of atoms, normally. This will give you a hint of what
might be
>>>> going
>>>> on there.
>>>>
>>>> The only "problem" is that URE uses some temporary
atomspaces;
>>>> those
>>>> are not included in the count. The URE also mallocs
structures that
>>>> are not part of the atomspace.
>>>>
>>>> There is a third but unlikely issue -- guile garbage
collection not
>>>> running often enough. Take a look at (gc-stats) to
get info, and
>>>> (gc) to manually run garbage collection. It's unlikely
this is a
>>>> problem, but there were issues with older guile-- say,
version 2.0.
>>>> I'm hoping you are on version 3.0, or at least version
2.2.
>>>>
>>>> Perhaps @Nil Geisweiller can help with URE ram issues.
>>>>
>>>> --linas
>>>>
>>>> On Mon, May 24, 2021 at 11:27 AM Michele Thiella
>>>> <[email protected]> wrote:
>>>>
>>>> Hello everyone,
>>>>
>>>> Finally, I was able to pass the first planning
test for the
>>>> blocksword problem, using ContextLinks.
>>>> (For now, it has some ad-hoc things/rules and
others that are
>>>> missing)
>>>>
>>>> But, as long as I look for a column of 3 blocks
everything is
>>>> fine and the times for the BC are very short,
>>>> while when I look for a column of 4 or more I go
into RAM
>>>> overflow.
>>>> Unfortunately, I'm on Linux on an external sdd and
the Swap
>>>> area
>>>> is there.
>>>> Consequently, with a goal of 4 blocks, I use more
than 8
>>>> Giga (I
>>>> only have 8) and it starts swapping but the time
gets longer
>>>> and
>>>> I can't finish the execution.
>>>>
>>>> Would anyone be able to run the
test_pickup_stack.scm file? and
>>>> share me the log file?
>>>> it's in my repo:
>>>> https://github.com/raschild6/blocksworld_problem
<https://github.com/raschild6/blocksworld_problem>
>>>> <https://github.com/raschild6/blocksworld_problem
<https://github.com/raschild6/blocksworld_problem>>
>>>> Thanks a lot in advance!
>>>> (There should be no errors, just do (load
>>>> "path/to/file/test_pickup_stack.scm") in the
telnet shell.
>>>> Report me if there is something wrong, thanks!)
>>>>
>>>> I'm playing with the URE parameters to see if I
can optimize
>>>> the
>>>> inference.
>>>> (extra question) is there a URE parameter to
terminate at the
>>>> first BC solution found?
>>>>
>>>> Michele
>>>>
>>>> --
>>>> You received this message because you are
subscribed to the
>>>> Google Groups "opencog" group.
>>>> To unsubscribe from this group and stop receiving
emails from
>>>> it, send an email to [email protected].
>>>>
>>>> To view this discussion on the web visit
>>>>
https://groups.google.com/d/msgid/opencog/4f5a4761-3ad7-4d6c-87d6-f5bb1f16f993n%40googlegroups.com
<https://groups.google.com/d/msgid/opencog/4f5a4761-3ad7-4d6c-87d6-f5bb1f16f993n%40googlegroups.com>
>>>>
>>>>
<https://groups.google.com/d/msgid/opencog/4f5a4761-3ad7-4d6c-87d6-f5bb1f16f993n%40googlegroups.com?utm_medium=email&utm_source=footer
<https://groups.google.com/d/msgid/opencog/4f5a4761-3ad7-4d6c-87d6-f5bb1f16f993n%40googlegroups.com?utm_medium=email&utm_source=footer>>.
>>>>
>>>>
>>>>
>>>>
>>>> -- Patrick: Are they laughing at us?
>>>> Sponge Bob: No, Patrick, they are laughing next to us.
>>>>
>>>>
>>>> --
>>>> You received this message because you are subscribed to
the Google
>>>> Groups "opencog" group.
>>>> To unsubscribe from this group and stop receiving emails
from it,
>>>> send an email to [email protected]
>>>> <mailto:[email protected]>.
>>>> To view this discussion on the web visit
>>>>
https://groups.google.com/d/msgid/opencog/bcebe289-87a8-4290-8ea3-66644ae8b30fn%40googlegroups.com
<https://groups.google.com/d/msgid/opencog/bcebe289-87a8-4290-8ea3-66644ae8b30fn%40googlegroups.com>
>>>>
<https://groups.google.com/d/msgid/opencog/bcebe289-87a8-4290-8ea3-66644ae8b30fn%40googlegroups.com?utm_medium=email&utm_source=footer
<https://groups.google.com/d/msgid/opencog/bcebe289-87a8-4290-8ea3-66644ae8b30fn%40googlegroups.com?utm_medium=email&utm_source=footer>>.
>>>>
--
You received this message because you are subscribed to the Google
Groups "opencog" group.
To unsubscribe from this group and stop receiving emails from it, send
an email to [email protected]
<mailto:[email protected]>.
To view this discussion on the web visit
https://groups.google.com/d/msgid/opencog/74f682e0-c48c-42e7-836a-6546db42cccdn%40googlegroups.com
<https://groups.google.com/d/msgid/opencog/74f682e0-c48c-42e7-836a-6546db42cccdn%40googlegroups.com?utm_medium=email&utm_source=footer>.
--
You received this message because you are subscribed to the Google Groups
"opencog" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/opencog/67c369d9-1d9e-8435-4c15-0a0cc6c71ccd%40gmail.com.
