System and method for constructing cognitive programs

• US 20070245295A1
• Filed: 06/07/2007
• Published: 10/18/2007
• Est. Priority Date: 12/07/2004
• Status: Active Grant

• Current Assignee: Eric Baum
• Original Assignee: Eric Baum
• Inventors: Baum, Eric
• Granted Patent: US 7,548,893 B2
• Time in Patent Office: Days
• US Class Current: 717/100
• CPC Class Codes: G06F 9/30145 Instruction analysis, e.g. decoding, instruction word fields
• CPC Class Codes: G06N 20/00 Machine learning

Abstract

The present invention is directed to a method to search for a solution to a problem in a domain. The method may comprise obtaining a plurality of agents each operable to produce one or more numerical bids and to propose one or more actions and a plurality of nodes each representing a state of the domain; automatically selecting a respective agent and a respective node based on a bids from the plurality of agents; and automatically adding a new node representing a new state which is obtained by applying to the state represented by the selected node an action proposed by the selected agent. The plurality of nodes may each have a depth associated therewith and the respective agent and the respective node may be selected regardless of the depth associated with the selected node.

Claims

1. A method to search for a solution to a problem in a domain, the method comprising:

obtaining a plurality of agents each operable to produce one or more numerical bids and to propose one or more actions and a plurality of nodes each representing a state of said domain;

automatically selecting a respective agent and a respective node based on bids from the plurality of agents; and

automatically adding a new node representing a new state which is obtained by applying an action proposed by the selected agent to said state represented by the selected node.

2. The method according to claim 1, in which the plurality of nodes each have a depth associated therewith, and in which the respective agent and the respective node are selected regardless of the depth associated with the selected node.

3. The method according to claim 2, in which the depth associated with the selected node is not adjacent to the depth associated with the most recently added node.

4. The method according to claim 1, in which the selected node is not the most recently added node.