Tag Archives: Constraint Satisfaction Problems

Survey of Theme One Program • 2

This is a Survey of previous blog and wiki posts on the Theme One Program that I developed all through the 1980s.  The aim of the project was to develop fundamental algorithms and data structures to support an integrated learning … Continue reading

Posted in Algorithms, Animata, Artificial Intelligence, Automated Research Tools, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognitive Science, Computation, Computational Complexity, Computer Science, Computing, Constraint Satisfaction Problems, Cybernetics, Data Structures, Diagrammatic Reasoning, Diagrams, Differential Analytic Turing Automata, Education, Educational Systems Design, Educational Technology, Equational Inference, Functional Logic, Graph Theory, Indicator Functions, Inquiry, Inquiry Driven Education, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems, Knowledge, Learning, Learning Theory, Logic, Logical Graphs, Machine Learning, Mathematics, Mental Models, Minimal Negation Operators, Painted Cacti, Peirce, Programming, Programming Languages, Propositional Calculus, Propositional Equation Reasoning Systems, Propositions, Research Technology, Semeiosis, Semiosis, Semiotics, Sign Relations, Surveys, Teaching, Theorem Proving, Triadic Relations, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Animated Logical Graphs : 12

Re: Facebook Discussion • MBM I’ve always been fond of picture proofs — it was one of the things that drew me to graph theory, topology, and the logical graphs of C.S. Peirce and Spencer Brown in the first place.  Sue was … Continue reading

Posted in Abstraction, Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Complementarity, Computational Complexity, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Graph Theory, Iconicity, Interpretation, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Spencer Brown, Theorem Proving, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Animated Logical Graphs : 11

Re: Richard Coyne • Inside Out Logic Venn diagrams make for very iconic representations of their universes of discourse.  That is one of the main sources of their intuitive utility and also the main source of their logical limitations — … Continue reading

Posted in Abstraction, Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Complementarity, Computational Complexity, Constraint Satisfaction Problems, Deduction, Diagrammatic Reasoning, Duality, Graph Theory, Iconicity, Interpretation, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Spencer Brown, Theorem Proving, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | Leave a comment

Animated Logical Graphs : 10

Re: Peirce List Discussion • Charles Pyle Let’s consider Peirce’s logical graphs at the alpha level, the abstract forms of which can be interpreted for propositional logic.  I say “can be interpreted” advisedly because the system of logical graphs itself … Continue reading

Posted in Abstraction, Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, C.S. Peirce, Cactus Graphs, Complementarity, Computational Complexity, Constraint Satisfaction Problems, Diagrammatic Reasoning, Duality, Graph Theory, Interpretation, Laws of Form, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Model Theory, Painted Cacti, Peirce, Proof Theory, Propositional Calculus, Propositional Equation Reasoning Systems, Semiotics, Spencer Brown, Theorem Proving, Visualization, Zeroth Order Logic | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Prospects for Inquiry Driven Systems • 1

I finally finished retyping the bibliography to my systems engineering proposal that had gotten lost in a move between computers, so here is a link to the InterSciWiki copy: Prospects for Inquiry Driven Systems • Bibliography This may be of … Continue reading

Posted in Adaptive Systems, Animata, Artificial Intelligence, Automated Research Tools, C.S. Peirce, Cactus Graphs, Constraint Satisfaction Problems, Cybernetics, Differential Logic, Educational Systems Design, Inquiry, Inquiry Driven Systems, Inquiry Into Inquiry, Intelligent Systems Engineering, Learning, Logic, Logic of Science, Logical Graphs, Machine Learning, Peirce, Propositional Calculus, Reasoning, Scientific Method, Semiotics, Sign Relations, Theorem Proving | Tagged , , , , , , , , , , , , , , , , , , , , , , , , , | 2 Comments

Animated Logical Graphs : 9

Re: Ken Regan • The Shapes of Computations The insight that it takes to find a succinct axiom set for a theoretical domain falls under the heading of abductive or retroductive reasoning, a knack as yet refractory to computational attack, … Continue reading

Posted in Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Diagrammatic Reasoning, Graph Theory, Inquiry Driven Education, 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 , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment

Animated Logical Graphs : 8

Re: Ken Regan • The Shapes of Computations The most striking example of a “Primitive Insight Proof” (PIP❢) known to me is the Dawes–Utting proof of the Double Negation Theorem from the CSP–GSB axioms for propositional logic. There is a … Continue reading

Posted in Amphecks, Animata, Automated Research Tools, Boolean Algebra, Boolean Functions, Cactus Graphs, Computational Complexity, Constraint Satisfaction Problems, Diagrammatic Reasoning, Graph Theory, Inquiry Driven Education, 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 , , , , , , , , , , , , , , , , , , , , , , , , | 1 Comment