(Enter summary)
Abstract: We study the propositional modal logic of knowledge and time for distributed
systems. We consider a number of logics (ninety-six in all!), which vary according to the
choice of language and the assumptions made on the underlying system. The major parameters
in the language are whether there is a common knowledge operator, whether we reason about
the knowledge of one or more than one processor, and whether our temporal operators are
branching or linear. The assumptions on distributed systems... (Update)
Cited by: More
Towards a Logic of Rational Agency - van der Hoek, Wooldridge (2003)
(Correct)
Cooperation, Knowledge, and Time: Alternating-time.. - van der Hoek, Wooldridge (2003)
(Correct)
Model Checking a Knowledge Exchange - Scenario Sieuwert Van
(Correct)
Similar documents (at the sentence level):
18.9%: The Complexity of Reasoning about Knowledge and Time. I. Lower .. - Halpern, Vardi (1989)
(Correct)
Active bibliography (related documents): More All
0.8: What Can Machines Know? On the Properties of Knowledge in.. - Fagin, Halpern, Vardi (1996)
(Correct)
0.2: Axioms for Knowledge and Time in Distributed Systems with.. - van der Meyden (1993)
(Correct)
0.2: Branching Time and Partial Order - In Temporal Logics
(Correct)
Similar documents based on text: More All
0.3: What is an Inference Rule? - Fagin, Halpern, Vardi (1992)
(Correct)
0.2: Model Checking vs. Theorem Proving: A Manifesto - Halpern, Vardi (1991)
(Correct)
0.2: Complete Axiomatizations for Reasoning about Knowledge.. - Halpern, van der Meyden, .. (1997)
(Correct)
Related documents from co-citation: More All
71: Reasoning about Knowledge (context) - Fagin, Halpern et al. - 1995
50: A guide to completeness and complexity for modal logics of knowledge and belief (context) - Halpern, Moses - 1992
31: Knowledge and Belief (context) - Hintikka - 1962
BibTeX entry: (Update)
J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time, I: lower bounds. Journal of Computer and System Sciences, 38(1):195--237, 1989. http://citeseer.ist.psu.edu/halpern89complexity.html More
@inproceedings{ halpern86complexity,
author = "J. Y. Halpern and M. Y. Vardi",
title = "The complexity of reasoning about knowledge and time",
pages = "304--315",
year = "1986",
url = "citeseer.ist.psu.edu/halpern89complexity.html" }
Citations (may not include all citations):
264
Knowledge and common knowledge in a distributed environment
- Halpern, Moses
163
the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
94
Knowledge and common knowledge in a Byzantine environment I:.. (context) - Dwork, Moses
84
Decision procedures and expressiveness in the temporal logic.. (context) - Emerson, Halpern - 1985
76
How processes learn (context) - Chandy, Misra - 1986
50
Using reasoning about knowledge to analyze distributed syste.. (context) - Halpern - 1987
40
A guide to the modal logics of knowledge and belief: prelimi.. (context) - Halpern, Moses
24
Alternative semantics for temporal logics (context) - Emerson - 1983
19
A model-theoretic analysis of knowledge
- Fagin, Halpern et al. - 1984
14
and communication in distributed systems: preliminary report (context) - Halpern, Fagin et al. - 1985
5
Decidability and expressiveness of logics of processes (context) - Abrahamson - 1980
5
the epistemic properties of machines (context) - Fagin, Halpern et al. - 1986
2
Theoretical Aspects of Reasoning About Knowledge: Proceeding.. (context) - Fischer, Iramerman et al.
2
revisited: on branching rs (context) - Emerson, Halpern et al. - 1986
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/~vardi/papers/index.html): More
An Operational Semantics for Knowledge Bases - Fagin, Halpern, al. (1994)
(Correct)
Nontraditional Applications of Automata Theory - Vardi (1994)
(Correct)
Synthesis with Incomplete Information - Kupferman, Vardi (1997)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC