Category Archives: Constraint Satisfaction Problems

Theme One Program • Exposition 5

Posted on June 23, 2022 by Jon Awbrey

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 →

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 6 Comments

Theme One Program • Exposition 4

Posted on June 20, 2022 by Jon Awbrey

Parsing Logical Graphs It is possible to write a program that parses cactus expressions into reasonable facsimiles of cactus graphs as pointer structures in computer memory, making edges correspond to addresses and nodes correspond to records.  I did just that … Continue reading →

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Theme One Program • Exposition 3

Posted on June 17, 2022 by Jon Awbrey

Coding Logical Graphs My earliest experiments coding logical graphs as dynamic “pointer” data structures taught me that conceptual and computational efficiencies of a critical sort could be achieved by generalizing their abstract graphs from trees to the variety graph theorists … Continue reading →

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 7 Comments

Theme One Program • Exposition 2

Posted on June 16, 2022 by Jon Awbrey

The previous post described the elementary data structure used to represent nodes of graphs in the Theme One program.  This post describes the specific family of graphs employed by the program. Painted And Rooted Cacti Figure 1 shows a typical example … Continue reading →

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 8 Comments

Theme One Program • Exposition 1

Posted on June 15, 2022 by Jon Awbrey

Theme One is a program for constructing 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 of … Continue reading →

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 8 Comments

Survey of Theme One Program • 4

Posted on June 12, 2022 by Jon Awbrey

This is a Survey of blog and wiki posts relating to the Theme One Program I worked on all through the 1980s.  The aim was to develop fundamental algorithms and data structures for integrating empirical learning with logical reasoning.  I … Continue reading →

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 | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , | 22 Comments

Logical Graphs, Iconicity, Interpretation • Discussion 2

Posted on October 21, 2021 by Jon Awbrey

Re: Logical Graphs, Iconicity, Interpretation • 2 Re: Laws of Form • John Mingers JM: The quote you have given does not match the standard Peircean trichotomy of icon, index, symbol.  See this quote from [CP 4.447 …] Dear John, I … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Theme One Program • Discussion 6

Posted on October 19, 2021 by Jon Awbrey

Re: Peirce List • Jerry Chandler JC: This post [Theme One Program • Motivation 1] is so muddled that I gave up on a meaningful scientific interpretation of it. Dear Jerry, Thanks for the response. I heartily agree with the … Continue reading →

Posted in Artificial Intelligence, C.S. Peirce, Cognition, Computation, Constraint Satisfaction Problems, Cybernetics, Formal Languages, Inquiry, Inquiry Driven Systems, Intelligent Systems, Learning Theory, Logic, Semiotics, Visualization | Tagged , , , , , , , , , , , , , | 6 Comments

Theme One Program • Discussion 5

Posted on October 15, 2021 by Jon Awbrey

I’ve been going back and looking again at the problems and questions which nudged me into the computational sphere as a way of building our human capacities for inquiry, learning, and reasoning. One critical issue, you might even say bifurcation … Continue reading →

Posted in Artificial Intelligence, C.S. Peirce, Cognition, Computation, Constraint Satisfaction Problems, Cybernetics, Formal Languages, Inquiry, Inquiry Driven Systems, Intelligent Systems, Learning Theory, Logic, Semiotics, Visualization | Tagged , , , , , , , , , , , , , | 6 Comments

Logical Graphs, Iconicity, Interpretation • Discussion 1

Posted on October 13, 2021 by Jon Awbrey

Re: Logical Graphs, Iconicity, Interpretation • 1 Re: Laws of Form • John Mingers JM: I’m impressed that you have read Ricoeur — my impression is that Americans don’t have much time for Continental philosophy (a huge generalisation of course). … Continue reading →

Posted in Amphecks, Animata, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Equational Inference, Graph Theory, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Spencer Brown, Theorem Proving, Visualization | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment