3 ms·
Thanks, that's a nice example. >> For an example. The potential hypothesis here are pre generated, but you can imagine an algorithm or adapt an existing one wi
by YeGoblynQueenne 4y ago
Thanks, that's a nice example.
>> For an example. The potential hypothesis here are pre generated, but you can imagine an algorithm or adapt an existing one with a tight generalise/specialise loop.
Yes! I'm thinking of how to adapt Louise (https://github.com/stassa/louise https://github.com/stassa/louise) to do that. The fact that s(CASP) is basically a Prolog-y version of ASP (with constraints) could make it a very natural sort of modification. Or, of course, there's always Well-Founded Semantics (https://www.swi-prolog.org/pldoc/man?section=WFS https://www.swi-prolog.org/pldoc/man?section=WFS).
What's hyp_gen.pl?
- samwalrus 4y agoI don't have a working hyp_gen.pl anymore I think but it was just a simple search given the atoms to add to a rule and its negations.
- samwalrus 4y agoAnd adapting Louise would be an interesting thing to work on for sure. Why is it called Louise?
- YeGoblynQueenne 4y agoThere was an earlier system called Thelma (https://github.com/stassa/thelma https://github.com/stassa/thelma), an acronym for "Theory Learning Machine". Then I created a new system and, well, I couldn't resist a bad pun. They're a bit of a tradition in ILP.