Jump To: Parent Description
- IAEC uses a persistence mechanism and a pending sayer2 implementation which tracks multiple invocations over time to detect changes and also has a KB about the functions themselves. It uses different logics to assert functional relationships in a lispish/prologish notation. It keeps a blackboard of the state of all the different problems it's working on. It can represent strings in more economical ways by refering to function evaluation results and previously stored data. It integrates with kbfs, nlu, etc. It also does knowledge discovery and program verification. Using kbp systems we will extract a KB of properties about algorithms. It then aids in automatic programming. It is capable of exceeding the transitive closure of it' programming because it integrates external data read from books and such into its own system coherently, and thus mines and learns.