Verifying Time and Communication Costs of Rule-Based Reasoners

DOI10.1007/978-3-642-00431-5_1zbMath1226.68118OpenAlexW1607917053MaRDI QIDQ3614874

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

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

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

Uses Software

• MCMAS
• MOCHA

Cites Work

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

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