Verifying bounds on deliberation time in multi-agent systems Natasha Alechina a a Brian Logan a

First Page		Document Content
Date: 2009-09-11 12:40:28 Artificial intelligence Formal languages Models of computation Logic programming Logical syntax Intelligent agent Production system Well-formed formula Agent-based model Logic Mathematics Science		Verifying bounds on deliberation time in multi-agent systems Natasha Alechina a a Brian Logan a Add to Reading List Source URL: www.cs.nott.ac.uk Download Document from Source Website File Size: 169,66 KB Share Document on Facebook

	PROJECT PAI TECHNICAL WHITEPAPER SUMMARY PAI BLOCKCHAIN PROTOCOL: A DECENTRALIZED ARTIFICIAL INTELLIGENCE NETWORK DocID: 1xVWW - View Document
	Persistent Memory for Artificial Intelligence Bill Gervasi Principal Systems Architect Santa Clara, CA DocID: 1xVOm - View Document
	Journal of Machine Learning Research, 4th International Conference on Predictive Applications and APIs Marvin - Open source artificial intelligence platform Lucas B. Miguel DocID: 1xVLb - View Document
	Cybersecurity Powered by Artificial Intelligence and the Blockchain HEROIC.com Team February 2018 DocID: 1xVHi - View Document