Theme One • A Program Of Inquiry 14

As an alternative to piling generalities on generalities, not that there’s anything wrong with that, it also helps to look at issues as they arise in concrete applications.

One of the most concrete applications I ever attempted was the program I worked on all through the 1980s designed to integrate a basic form of inductive (data‑driven) learning with a fundamental form of deductive (concept‑driven) reasoning.  Having recently begun a fresh attempt to essay all that on my blog I think it might serve our ends to share it here.

cc: Ontolog Forum

This entry was posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.