Knowledge representation language and knowledge processing environment

• US 20050262489A1
• Filed: 05/11/2005
• Published: 11/24/2005
• Est. Priority Date: 05/12/2004
• Status: Abandoned Application

• Current Assignee: Sentar, Inc.
• Original Assignee: Sentar, Inc.
• Inventors: Potter, Andrew N., Streeter, Gordon S.
• Application Number:
  US11/127,366
• Publication Number:
  US 20050262489A1
• Time in Patent Office: Days
• US Class Current: 717/144
• CPC Class Codes: G06N 5/02 Knowledge representation; Symbolic representation
• CPC Class Codes: G06Q 10/10 Office automation; Time management

Abstract

Described is a knowledge representation language and knowledge processing environment. Embodiments described include an environment for storing, retrieving, transmitting, and reasoning over knowledge. Knowledge is represented using three basic elements: (1) there are concepts, which represent objects or ideas; (2) there are relations, which represent structures and describe the roles concepts play in relation to each other within those structures; and (3) there are graphs, which represent situations or collections composed of concepts, relations, and graphs.

Claims

1. A computer-readable medium encoded with a knowledge data structure, comprising:

a concept that represents an object or idea;

a relation that represents at least one structure and describes a role that the concept plays in relation to other concepts within the structure; and

a graph that represents a collection of concepts, relations, and other graphs.

2. The computer-readable medium recited in claim 1, wherein the knowledge data structure is represented in a graphical, linear, markup-based, or programmatic form.

3. The computer-readable medium recited in claim 1, wherein the relation has a type, the type is defined in the context of an ontology, and the ontology describes the relation type by indicating a number of arcs for the relation type, a label for each arc, and a type of a concept at the end of each arc.

4. The computer-readable medium recited in claim 1, wherein the graph can be expressed as a logical statement in the existential-conjunctive subset of first order logic.

5. The computer-readable medium recited in claim 1, wherein a selected one of the concept, the relation, or the graph represents a first structure and a different instance of the selected one of the concept, the relation, or the graph represents a second structure, and further wherein the first structure is similar to the second structure and no more specific in detail, and further wherein the first structure subsumes the second structure.

6. The computer-readable medium recited in claim 5, further comprising means for unifying the first structure and the second structure into a third structure if the subsumption succeeds to provide discovery.

7. The computer-readable medium recited in claim 5, further comprising means for binding the first structure into the second structure to provide knowledge synthesis.

8. The computer-readable medium recited in claim 1, wherein the concept comprises a frame containing a graph that contains a single relation, and wherein the frame provides qualities of the concept and the relation.

9. The computer-readable medium recited in claim 1, wherein the concept comprises a module that contains a graph that contains a single relation, the relation linking a context concept, an ontologies concept, a catalog concept, and a counter concept.

10. The computer-readable medium recited in claim 9, wherein the module provides a closure over which the identity of unique concepts is maintained and through which individual concepts may be identified.

11. The computer-readable medium recited in claim 1, wherein ontological support is used to create ontologies for specialized modalities to achieve extensibility.

12. A method for representing knowledge as a data structure encoded on a computer-readable medium, comprising:

assigning certain information to a concept;

representing a role that the concept plays in relation to other concepts using a relation; and

representing the concepts and the relation using a graph.

13. The computer-readable medium recited in claim 12, wherein the concept, the relation, and the graph are represented in a graphical, linear, markup-based, or programmatic form.

14. The method recited in claim 12, wherein the relation has a type, the type is defined in the context of an ontology, and the ontology describes the relation type by indicating a number of arcs for the relation type, a label for each arc, and a type of a concept at the end of each arc.

15. The method recited in claim 12, further comprising using ontological support to create ontologies for specialized modalities to achieve extensibility.

16. The method recited in claim 12, wherein the graph can be expressed as a logical statement in the existential-conjunctive subset of first order logic.

17. The method recited in claim 16, wherein a selected one of the concept, the relation, or the graph represents a first structure and a different instance of the selected one of the concept, the relation, or the graph represents a second structure, and further wherein the first structure is similar to the second structure and no more specific in detail, the method further comprising subsuming the second structure by the first structure.

18. The method recited in claim 17, further comprising unifying the first structure and the second structure into a third structure if the subsuming step succeeds to provide discovery.

19. The method recited in claim 17, further comprising binding the first structure into the second structure to provide knowledge synthesis.

20. The method recited in claim 12, wherein the concept comprises a module that contains a graph that contains a single relation, the relation linking a context concept, an ontologies concept, a catalog concept, and a counter concept.

21. The method recited in claim 20, wherein the module provides a closure over which the identity of unique concepts is maintained and through which individual concepts may be identified.

22. The method recited in claim 12, wherein the concept comprises a frame containing a graph that contains a single relation, and wherein the frame provides qualities of the concept and the relation.

23. A computer-readable medium having computer-executable instructions, which when executed perform a method for representing knowledge as a data structure, the instructions comprising:

assigning certain information to a concept;

representing a role that the concept plays in relation to other concepts using a relation; and

representing the concepts and the relation using a graph.

24. The computer-readable medium recited in claim 23, wherein the concept, the relation, and the graph are represented in a graphical, linear, markup-based, or programmatic form.

25. The computer-readable medium recited in claim 23, wherein the relation has a type, the type is defined in the context of an ontology, and the ontology describes the relation type by indicating a number of arcs for the relation type, a label for each arc, and a type of a concept at the end of each arc.

26. The computer-readable medium recited in claim 23, further comprising using ontological support to create ontologies for specialized modalities to achieve extensibility.

27. The computer-readable medium recited in claim 23, wherein the graph can be expressed as a logical statement in the existential-conjunctive subset of first order logic.

28. The computer-readable medium recited in claim 27, wherein a selected one of the concept, the relation, or the graph represents a first structure and a different instance of the selected one of the concept, the relation, or the graph represents a second structure, and further wherein the first structure is similar to the second structure and no more specific in detail, the method further comprising subsuming the second structure by the first structure.

29. The computer-readable medium recited in claim 28, further comprising unifying the first structure and the second structure into a third structure if the subsuming step succeeds to provide discovery.

30. The computer-readable medium recited in claim 28, further comprising binding the first structure into the second structure to provide knowledge synthesis.

31. The computer-readable medium recited in claim 23, wherein the concept comprises a module that contains a graph that contains a single relation, the relation linking a context concept, an ontologies concept, a catalog concept, and a counter concept.

32. The computer-readable medium recited in claim 31, wherein the module provides a closure over which the identity of unique concepts is maintained and through which individual concepts may be identified.

33. The computer-readable medium recited in claim 23, wherein the concept comprises a frame containing a graph that contains a single relation, and wherein the frame provides qualities of the concept and the relation.