Verifying Time and Communication Costs of Rule-Based Reasoners

DOI10.1007/978-3-642-00431-5_1MaRDI QIDQ3614874zbMATH OpenOpenAlexFDO

Authors Natasha Alechina, Brian Logan, Nguyen Hoang Nga, Abdur Rakib

Publication date 17 March 2009

Published in Model Checking and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00431-5_1

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Agent technology and artificial intelligence (68T42)

Recommendations

• Verifying time, memory and communication bounds in systems of reasoning agents
• Logics in Artificial Intelligence
• Verifying Space and Time Requirements for Resource-Bounded Agents
• Logics in Artificial Intelligence
• Specifying and verifying systems of communicating agents in a temporal action logic

Cites work

• An axiomatization of full computation tree logic
• On the computational complexity of coalitional resource games
• Partition-based logical reasoning for first-order and propositional theories
• The Dynamics of Syntactic Knowledge
• Verifying Space and Time Requirements for Resource-Bounded Agents
• Verifying time, memory and communication bounds in systems of reasoning agents

Cited in

(2)

• Verifying time, memory and communication bounds in systems of reasoning agents
• Logics in Artificial Intelligence

Describes a project that uses

Uses Software

• MCMAS
• MOCHA

This page was built for publication: Verifying Time and Communication Costs of Rule-Based Reasoners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614874)