Journal ArticleDOI
A guide to completeness and complexity for modal logics of knowledge and belief
Joseph Y. Halpern,Yoram Moses +1 more
TLDR
It is shown that while the problem of deciding satisfiability of an S5 formula with one agent is NP-complete, the problem for many agents is PSPACE-complete and the problem becomes complete for exponential time once a common knowledge operator is added to the language.About:
This article is published in Artificial Intelligence.The article was published on 1992-04-01. It has received 886 citations till now. The article focuses on the topics: Common knowledge & Distributed knowledge.read more
Citations
More filters
Journal ArticleDOI
Intelligent Agents: Theory and Practice
TL;DR: Agent theory is concerned with the question of what an agent is, and the use of mathematical formalisms for representing and reasoning about the properties of agents as discussed by the authors ; agent architectures can be thought of as software engineering models of agents; and agent languages are software systems for programming and experimenting with agents.
Book
Introduction to Multiagent Systems
TL;DR: A multi-agent system (MAS) as discussed by the authors is a distributed computing system with autonomous interacting intelligent agents that coordinate their actions so as to achieve its goal(s) jointly or competitively.
Book ChapterDOI
Agent theories, architectures, and languages: a survey
TL;DR: A survey of what the authors perceive to be the most important theoretical and practical issues associated with the design and construction of intelligent agents is presented.
Journal ArticleDOI
Reaching agreements through argumentation: a logical model and implementation
TL;DR: A logical model of the mental states of the agents based on a representation of their beliefs, desires, intentions, and goals is presented and a general Automated Negotiation Agent is implemented, based on the logical model.
Journal ArticleDOI
Reasoning about knowledge and probability
Ronald Fagin,Joseph Y. Halpern +1 more
TL;DR: This work provides a complete axiomatization for reasoning about knowledge and probability, proves a small model property, and obtains decision procedures for adding common knowledge and a probabilistic variant of common knowledge to the language.
References
More filters
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Book ChapterDOI
Some philosophical problems from the standpoint of artificial intelligence
TL;DR: In this paper, the authors consider the problem of reasoning about whether a strategy will achieve a goal in a deterministic world and present a method to construct a sentence of first-order logic which will be true in all models of certain axioms if and only if a certain strategy can achieve a certain goal.
Journal ArticleDOI
The knowledge complexity of interactive proof systems
TL;DR: A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.
Journal ArticleDOI
Is Justified True Belief Knowledge
TL;DR: In this paper, the necessary and sufficient conditions for someone's knowing a given proposition were discussed in a form similar to the following: IFF P is true, IFF S believes that P, and S is justified in believing that P.
Journal ArticleDOI
Propositional dynamic logic of regular programs
TL;DR: A formal syntax and semantics for the propositional dynamic logic of regular programs is defined and principal conclusions are that deciding satisfiability of length n formulas requires time d n /log n for some d > 1, and that satisfiability can be decided in nondeterministic time cn for some c.