-
Notifications
You must be signed in to change notification settings - Fork 3
Theory
Some Notes and excerpts.
Conceptual graphs are finite, connected, bipartite graphs. They are finite because any graph in the human brain or computer storage can have only a finite number of concepts and conceptual relations. They are connected because two parts that were not connected with simply be called to conceptual graphs. They are Bipartite because there are two different kinds of nodes - concepts and conceptual relations - and every article links a note of one kind to a node of the other kind.h bipartite because there are two different kinds of notes concepts and conceptual relations and every article links a node of one kind to a node of the other kind.
Definitions
Every conceptual relation has one or more arts, each of which must be linked to some concept.
A single concept bites of me for a conceptual graph, but every arc of every conceptual relation must be linked to some concept.
Concepts are discrete units. Combination of concepts are not diffuse mixtures, but ordered structures. Only discreet relationships are recorded and concepts. Continuous forms must be approximated by patterns of discrete units.
We are at level one right now, with our inference system.
Level zero simply translate an input sentence into a conceptual graph parentheses open initial world faces, but performs no inference.
Level one does plausible inferences by joining schemata and prototypes that fill in the missing details
Level two checks constrains by testing the graphs against the laws. Any join that causes a contradiction must be undone, as in the truth maintenance systems.
Level III joins more schemata to add further background information.
Level four checks further constraints.
Each succeeding odd level joins more schemata, and each even level checks the laws to enforce constraints.
If-Then Rules
Hypothesis
Graph - needs to be fully covered by a join to be true
Conclusion
Graph Parts that are added to the graph to be joined. (Need to make sure join is done on the graphs not only the Join List information... (Or add to join list?))
'Or' Rule is implemented as a If-Then Rule with for each possible
Hypothesis
Graph1
Conclusion
Graph that you need applied
'And' Rule is implemented by adding options into the hypothesis
Hypothesis
Graph1 Graph2 Graph3
Conclusion
Graph