Key scientific contribution II: Regular Agent Programs
Year 1: We provided a detailed complexity analysis of agent programs - complexity is high !
Year 2:
- Identified a class of regular agents that have polynomial complexity (hence efficient to implement).
- Developed/Implemented compile time algorithm which associates with any agent, a set of queries on the agent state.
- Developed/Implemented an algorithm that computes what the agent is to do, given some recent state changes/messages.
- Developed an incremental algorithm to update what the agent is to do.
- Proved correctness and complexity results for all the above.
Web Accessibility