The complexity of reasoning about knowledge and time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The complexity of reasoning about knowledge and time. I. lower bounds
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
A first-order branching time logic of multi-agent systems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
What can machines know?: On the properties of knowledge in distributed systems
Journal of the ACM (JACM)
Reasoning about knowledge
Verifying that agents implement a communication language
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Model checking multi-agent systems with MABLE
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
On the Relation between Interpreted Systems and Kripke Models
Proceedings of the Workshops on Commonsense Reasoning, Intelligent Agents, and Distributed Artificial Intelligence: Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications
Monodic Epistemic Predicate Logic
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Distributed Processes and the Logic of Knowledge
Proceedings of the Conference on Logic of Programs
Computationally Grounded Theories of Agency
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Complete Axiomatizations for Reasoning about Knowledge and Time
SIAM Journal on Computing
Specification and verification of data-driven Web applications
Journal of Computer and System Sciences
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems
Computational Logic in Multi-Agent Systems
Automatic verification of data-centric business processes
Proceedings of the 12th International Conference on Database Theory
Quantified epistemic logics for reasoning about knowledge in multi-agent systems
Artificial Intelligence
Foundations of relational artifacts verification
BPM'11 Proceedings of the 9th international conference on Business process management
View-based query answering in Description Logics: Semantics and complexity
Journal of Computer and System Sciences
Deliberation and its role in the formation of intentions
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Verification of deployed artifact systems via data abstraction
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
A computationally-grounded semantics for artifact-centric systems and abstraction results
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Fundamenta Informaticae - Logic, Language, Information and Computation
| Hi-index | 0.00 |
We investigate a class of first-order temporal-epistemic logics for reasoning about multiagent systems. We encode typical properties of systems including perfect recall, synchronicity, no learning, and having a unique initial state in terms of variants of quantified interpreted systems, a first-order extension of interpreted systems. We identify several monodic fragments of first-order temporal-epistemic logic and show their completeness with respect to their corresponding classes of quantified interpreted systems.