*Implika rule-based inference engine* Implika is a Javascript library made of rule-based inference engine. The only operator used in input is a implication which operates on three types of expressions: constants, schematic variables, and implications recursively. These elements are just enough to derive all the other operators and data structures we may find useful in computational field. Output of the inference engine includes assertion of all the implicit information that can be derived from input set of mutually correlating rules. One of the surprises about Implika is in its code size: the whole pattern matching and inference system is implemented in only about 150 lines of Javascript code. Nevertheless, this does not diminish ability of Implika to represent a Turing complete system.
Implika input language is a kind of s-expression: s-exp := () | constant | @variable | (s-exp s-exp) where the left s-expression implies the right s-expression in `(s-exp s-exp)`. The only rule of inference is modus ponens. Execution time for variable-less expressions such is propositional logic should be between O(n^2) and O(n^4). Read about it here: https://github.com/e-teoria/Implika Test it in dedicated UI here: https://e-teoria.github.io/Implika/test -- 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 opencog+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/opencog/CAB5%3Dj6X67pmKw2PWTqOd-1mukQ_0-hmoL3TUV2UHd-HYXmp%3DPw%40mail.gmail.com.
