Boston / New York / Manchester / Cambridge / Lisbon / /
Company
MIT Press / Multi-Agent Systems / ACM Press / df AG / AAAI Press / Real-Time Systems / /
Currency
pence / /
IndustryTerm
intelligent systems / match networks / match algorithm / pattern-match algorithm / expert systems / match network / ai production systems / state transition systems / agent systems / knowledge-based systems / rule-based systems / computing / conflict resolution algorithm / Model checking multiagent systems / web services / /
Organization
University of Nottingham / Nottingham / MIT / Computational Intelligence / Artificial Intelligence for Applications / European Union / Royal Society / IEEE Computer Society / /
Person
Rafael Bordini / Jaideep Srivastava / Liz Sonenberg / Fabio Bellifemine / Tsai Cheng / Thomas A. Henzinger / Rajeev Alur / Milind Tambe / Willem Visser / Shaz Qadeer / Aaron Sloman / Stephanie Forrest / David Gadbois / Jeng-Rung Chen / Freddy Y. C. Mang / Michael Fisher / Giovanni Rimassa / Massimo Benerecetti / Alexander Aiken / Charles Sierra / Orna Grumberg / Jennifer Widom / Sriram K. Rajamani / Agostino Poggi / Kim P. Gostelow / Edmund M. Clarke / Serdar Tasiran / Joseph M. Hellerstein / Michael Wooldridge / Sashi Shekhar / Luc Albert / Natasha Alechina / Lee D. Erman / Mark Whitsey / Chen / Bernie Lofaso / Fausto Giunchiglia / Albert Mo Kim Cheng / Brian Logan / Daniel P. Miranker / Marc Ringuette / Jack S. E. Tan / Luciano Serafini / Charles Forgy / /
Position
Prime Minister / plausible rule interpreter / Rt / naive interpreter / rule interpreter / naive rule interpreter / /
ProgrammingLanguage
Java / OPS5 / /
ProvinceOrState
New York / Massachusetts / /
PublishedMedium
Theoretical Computer Science / Communications of the ACM / /
Verifying bounds on deliberation time in multi-agent systems Natasha Alechina a a Brian Logan a