Verifying time, memory and communication bounds in systems of reasoning agents
DOI10.1007/S11229-009-9557-1zbMATH Open1187.68571OpenAlexW3138118222MaRDI QIDQ1036066FDOQ1036066
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
Logics of knowledge and belief (including belief change) (03B42) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27) Temporal logic (03B44)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating-time temporal logic
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Decision procedures and expressiveness in the temporal logic of branching time
- On the computational complexity of coalitional resource games
- The intractability of resolution
- Partition-based logical reasoning for first-order and propositional theories
- Space Complexity in Propositional Calculus
- Reasoning about rational, but not logically omniscient, agents
- Deductive Algorithmic Knowledge
- Verifying Space and Time Requirements for Resource-Bounded Agents
- Verifying time, memory and communication bounds in systems of reasoning agents
- Strongly Complete Axiomatizations of “Knowing at Most” in Syntactic Structures
- Logics in Artificial Intelligence
Cited In (5)
Uses Software
Recommendations
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems 👍 👎
- Verifying Space and Time Requirements for Resource-Bounded Agents 👍 👎
- Logics in Artificial Intelligence 👍 👎
- AI*IA 2003: Advances in Artificial Intelligence 👍 👎
- Logics in Artificial Intelligence 👍 👎
- Systems of agents controlled by logical programs: complexity of verification 👍 👎
- Compositional verification of multi-agent systems in temporal multi-epistemic logic 👍 👎
- Verifying Systems of Resource-Bounded Agents 👍 👎
- Verifying Time and Communication Costs of Rule-Based Reasoners 👍 👎
This page was built for publication: Verifying time, memory and communication bounds in systems of reasoning agents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1036066)
