Self-Supervised Inductive Logic Programming — mentioned by YeGoblynQueenne

Fri, 20 Feb 2026 12:54:15 GMT

L-Systems are not phrase-structure grammars. Some are similar to Regular, others to Context-Free grammars, but they're a different grammar formalism. The difference is that L-system rules are all applied simultaneously and consume an entire string before repeating the process in steps called "generations", where each generation takes as input the output of the previous one. Generations continue indefinitely, generating ever-longer strings, up to a limit set by the user. For instance, take the Dragon Curve L-System, Axiom: f Constants: +,- f -> f+g g -> f-g Suppose we wanted to execute two…

Paper and discussion history. A mention is not an endorsement.

Self-Supervised Inductive Logic Programming · HackerPapers discussions

Self-Supervised Inductive Logic Programming — mentioned by YeGoblynQueenne