Verifying time, memory and communication bounds in systems of reasoning agents

DOI10.1007/s11229-009-9557-1zbMath1187.68571OpenAlexW3138118222MaRDI QIDQ1036066

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

Publication date: 4 November 2009

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11229-009-9557-1

zbMATH Keywords

epistemic logicdistributed reasoningresource bounds

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (4)

Logics of Rational Interaction ⋮ Belief ascription under bounded resources ⋮ Verifying Time and Communication Costs of Rule-Based Reasoners ⋮ Verifying time, memory and communication bounds in systems of reasoning agents

Uses Software

• MOCHA

Cites Work

• Verifying time, memory and communication bounds in systems of reasoning agents
• The intractability of resolution
• Decision procedures and expressiveness in the temporal logic of branching time
• On the computational complexity of coalitional resource games
• Partition-based logical reasoning for first-order and propositional theories
• Space Complexity in Propositional Calculus
• Alternating-time temporal logic
• Strongly Complete Axiomatizations of “Knowing at Most” in Syntactic Structures
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Reasoning about rational, but not logically omniscient, agents
• Logics in Artificial Intelligence
• Verifying Space and Time Requirements for Resource-Bounded Agents
• Deductive Algorithmic Knowledge
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Verifying time, memory and communication bounds in systems of reasoning agents