Intelligence and Reasoning
From Knowino
(Difference between revisions)
| [checked revision] | [pending revision] |
(→Analysis in Symbolic Logic) |
(→Functional Breakdown) |
||
| (6 intermediate revisions by one user not shown) | |||
| Line 41: | Line 41: | ||
| Measure | | Measure | ||
| [[Inductive Regression|Inductive Regression]] | | [[Inductive Regression|Inductive Regression]] | ||
| − | | [[Inductive Inference|Inductive Inference]] | + | | [[Symbolic Logic:Learning:Inductive Inference|Inductive Inference]] |
|- | |- | ||
| | | | ||
| Search | | Search | ||
| [[Gradient Descent|Gradient Descent]], [[Neural Net|Neural Net]] | | [[Gradient Descent|Gradient Descent]], [[Neural Net|Neural Net]] | ||
| − | | [[Symbolic Replacement|Symbolic Replacement]] | + | | [[Symbolic Logic:Learning:Symbolic Replacement|Symbolic Replacement]], [[Symbolic Logic:Learning:Hierarchical Object Classification|Object Classification]] |
|- | |- | ||
| Analysis | | Analysis | ||
| Line 56: | Line 56: | ||
| Search | | Search | ||
| Simulation of Possible Outcomes | | Simulation of Possible Outcomes | ||
| − | | [[Axiom Theorem Systems|Axiom Theorem Systems]] | + | | [[Symbolic Logic:Analysis:Axiom Theorem Systems|Axiom Theorem Systems]] |
|- | |- | ||
| | | | ||
| Line 71: | Line 71: | ||
| Search | | Search | ||
| [[Gradient Descent|Gradient Descent]], [[Neural Net|Neural Net]] | | [[Gradient Descent|Gradient Descent]], [[Neural Net|Neural Net]] | ||
| − | | [[Symbolic Logic | + | | [[Symbolic Logic:Programming|Symbolic Logic Programming]] |
|} | |} | ||
| Line 169: | Line 169: | ||
===== Symbolic Learning ===== | ===== Symbolic Learning ===== | ||
| − | For symbolic learning we know that compression may be achieved by the replacement of repeated symbols by strings of symbols. These replacement rules can then be compared to create second order replacement rules (replacement rules applied to replacement rules). By applying these rules with a particular set of restrictions, second order replacement rules can be used to implement variables. | + | For symbolic learning we know that compression may be achieved by the replacement of repeated symbols by strings of symbols. These replacement rules can then be compared, using the [http://en.wikipedia.org/wiki/Diff difference algorithm], to create second order replacement rules (replacement rules applied to replacement rules). By applying these rules with a particular set of restrictions, second order replacement rules can be used to implement variables. |
Replacement along with second order replacement forms a simple univeral language of logic. By writing some rules it is possible to define mathematics. | Replacement along with second order replacement forms a simple univeral language of logic. By writing some rules it is possible to define mathematics. | ||
