SingularityNET (@SingularityNET): The MeTTa AGI programming language was designed to express complex relationships between entities and manipulate their structures. One of its main pur…

The MeTTa AGI programming language was designed to express complex relationships between entities and manipulate their structures. One of its main purposes is operating over a knowledge metagraph called AtomSpace (or just Space), which stores all sorts of knowledge from raw data to abstract concepts. In MeTTa, expressions like "(Parent Tom Bob)" can be placed into the program space to represent facts (In this case, Tom is Bob's parent). The core operation for retrieving information is matching, which searches for declared atoms corresponding to a given pattern. The "match" function takes three arguments: a reference to a Space (often "&self" for the current program), a pattern to be matched, and an output pattern. For example, "(match &self (Parent Bob Ann) (Bob is Ann's father))" returns the output when the pattern is found, or nothing when it isn't. Variables in patterns create powerful queries: "(match &self (Parent "$x" Bob) "$x")" finds all of Bob's parents. Note that match only finds direct matches and doesn't search in subexpressions, keeping queries precise and predictable. Visit https://t.co/Ys1fJs2IJm to learn more about MeTTa's patterns of knowledge.