Tag Archives: Cognition

Theme One is a program for building and transforming a particular species of graph-theoretic data structures, forms designed to support a variety of fundamental learning and reasoning tasks. The program evolved over the course of an exploration into the integration … Continue reading →

It looks like my time will be at the mercy of contractors and realtors most of the summer but I’ll continue with the informal exposition as time permits.  I’ve also returned to work on the formal documentation, organizing the commentary … Continue reading →

An unexpected benefit of cleaning out our basement and putting our belongings in storage was finding a trove of work I thought I’d lost, in a stash of 3½ inch floppies, no less.  I uploaded a sample to a couple of folders … Continue reading →

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 … Continue reading →

Logical Cacti (cont.) The abstract character of the cactus language relative to its logical interpretations makes it possible to give abstract rules of equivalence for transforming cacti among themselves and partitioning the space of cacti into formal equivalence classes.  The … Continue reading →

Logical Cacti (cont.) The main things to take away from the previous post are the following two ideas, one syntactic and one semantic. The compositional structures of cactus graphs and cactus expressions are constructed from two kinds of connective operations. There are … Continue reading →

The portions of exposition just skipped over covered the use of cactus graphs in the program’s learning module to learn sequences of characters called “words” or “strings” and sequences of words called “sentences” or “strands”.  Leaving the matter of grammar … Continue reading →

Re: Laws Of Form • Armahedi Mahzar AM:  Why do you need XOR in your inquiry system? Clearly we need a way to represent exclusive disjunction, along with its dual, logical equivalence, in any calculus capable of covering propositional logic, … Continue reading →

Lexical, Literal, Logical Theme One puts cactus graphs to work in three distinct but related ways, called lexical, literal, and logical applications.  The three modes of operation employ three distinct but overlapping subsets of the broader species of cacti.  Accordingly we … Continue reading →

We have seen how to take an abstract logical graph of a sort a person might have in mind to represent a logical state of affairs and translate it into a string of characters a computer can translate into a … Continue reading →