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:195-237, 1989.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....applied to : If the resultant structure is empty then : is unsatisfiable and valid. The logic we consider is linear time temporal logic with finite past and infinite future combined with the modal logic S5, allowing the interactions synchrony and perfect recall and synchrony and no learning [6, 13, 14, 15]. Such interactions allow us to consider how knowledge evolves over time. For example, for certain classes of systems, interaction occurs between knowledge and time so that, for example, statements such as if an agent knows that in the next moment p holds then, in the next moment, the agent knows ....

....between knowledge and time so that, for example, statements such as if an agent knows that in the next moment p holds then, in the next moment, the agent knows p holds are valid. Systems with this property have been termed as synchronous with no forgetting, or unbounded memory or perfect recall [6, 13, 14, 15]. For other systems we may want the converse of this. Systems with this property are known as synchronous with no learning [6, 13, 14, 15] For many of the interactions described in the literature [14, 15] this increases the complexity of the logic (sometimes dramatically) even for the single ....

[Article contains additional citation context not shown here]

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:195-- 237, 1989.

....applied to : If the resultant structure is empty then : is unsatisfiable and valid. The logic we consider is linear time temporal logic with finite past and infinite future combined with the modal logic S5, allowing the interactions synchrony and perfect recall and synchrony and no learning [6, 13, 14, 15]. Such interactions allow us to consider how knowledge evolves over time. For example, for certain classes of systems, interaction occurs between knowledge and time so that, for example, statements such as if an agent knows that in the next moment p holds then, in the next moment, the agent knows ....

....between knowledge and time so that, for example, statements such as if an agent knows that in the next moment p holds then, in the next moment, the agent knows p holds are valid. Systems with this property have been termed as synchronous with no forgetting, or unbounded memory or perfect recall [6, 13, 14, 15]. For other systems we may want the converse of this. Systems with this property are known as synchronous with no learning [6, 13, 14, 15] For many of the interactions described in the literature [14, 15] this increases the complexity of the logic (sometimes dramatically) even for the single ....

[Article contains additional citation context not shown here]

J. Y. Halpern and M. Y. Vardi. The Complexity of Reasoning about Knowledge and Time: Synchronous Systems. Technical Report RJ 6097, IBM Almaden Research Center, San Jose, California, April 1988.

....applied to : If the resultant structure is empty then : is unsatisfiable and valid. The logic we consider is linear time temporal logic with finite past and infinite future combined with the modal logic S5, allowing the interactions synchrony and perfect recall and synchrony and no learning [6, 13, 14, 15]. Such interactions allow us to consider how knowledge evolves over time. For example, for certain classes of systems, interaction occurs between knowledge and time so that, for example, statements such as if an agent knows that in the next moment p holds then, in the next moment, the agent knows ....

....between knowledge and time so that, for example, statements such as if an agent knows that in the next moment p holds then, in the next moment, the agent knows p holds are valid. Systems with this property have been termed as synchronous with no forgetting, or unbounded memory or perfect recall [6, 13, 14, 15]. For other systems we may want the converse of this. Systems with this property are known as synchronous with no learning [6, 13, 14, 15] For many of the interactions described in the literature [14, 15] this increases the complexity of the logic (sometimes dramatically) even for the single ....

[Article contains additional citation context not shown here]

J. Y. Halpern and M. Y. Vardi. The Complexity of Reasoning about Knowledge and Time: Extended Abstract. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 304--315, Berkeley, California, May 1986.

.... between, and this area of research is much at the leading edge of contemporary modal logic research [48] Moreover, for the few combinations for which completeness results are availaible, we also know that satisfiability problem for many such enriched systems can easily become computationally hard [26]. Despite these problems, modal approaches dominate in the literature, and in this article, we focus exclusively on such approaches. In addition to representing an agent s attitudes, logics of rational agency also typically incorporate some way of representing the actions that agents perform, ....

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:195 237, 1989.

....of dynamic logic and epistemic logic by [16] the BDI model [17, 18] the KARO framework [15, 21] and temporal logics of knowledge We thank C. Dixon, M Fisher and U. Hustadt for valuable discussions. This research is supported by EPSRC Research Grants GR M88761 and GR R92035. and belief [3, 6, 7]. Examples of more recent work is the proposal of a modal logic framework of belief and change in [12] and an epistemic dynamic logic in [10] This paper is an investigation of actions and the informational attitudes, i.e. beliefs and knowledge, of agents. For reasoning about actions, a single ....

....executing the action. Thus, any Kripke model is a multi agent system represented on some level of abstraction. Of course, one can propose other levels of abstraction and detailisations of multi agent systems, and each of them will have it s own notion of a model, for instance, interpreted systems [7], Aumann structures [3] hypercubes [14] general Kripke models and algebras [24] What is the expressiveness of the logic just de ned Trivially, PDL without the (classical) test operator is a sublogic of BDL. Consequently, it is possible to reason about simple programs inside BDL. To give us ....

[Article contains additional citation context not shown here]

J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time. I Lower bounds. J. Computer and System Sci., 38:195-237, 1989.

.... independent combination (or fusion) and join (or product) are probably the most popular ones as well as the ones that have been studied most extensively [41, 44, 45, 54, 57, 76, 112] They have been successfully applied in several areas, including databases [42, 43, 46] artificial intelligence [37, 39, 64, 91, 3, 131], and system specification and verification [51] We are mainly interested in this last application of combined logics. In the following, we introduce syntax and semantics for temporalization, independent combination and join. We will use the following general definition of temporal logic. The ....

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.

.... independent combination (or fusion) and join (or product) are probably the most popular ones as well as the ones that have been studied most extensively [11, 13, 14, 24] They have been successfully applied in several areas, including databases [12, 26, 27] artificial intelligence [9, 19, 10], and system specification and verification [16] We are mainly interested in this last application of combined logics. Our ultimate goal is to provide combined temporal logics with an automata theoretic counterpart. Such an equivalent characterization of combined logics as combined automata ....

Joseph Y. Halpern and Moshe Y. Vardi. The complexity of reasoning about knowledge and time I: Lower bounds. Journal of Computer and System Sciences, 38(1):195--237, 1989.

....of agent states as basic, and then derives the rules of agent change as axioms. This paper takes the rules of agent change as basic and derives the sequences of agent states. Halpern and Vardi give a very clear account of a relation of knowledge and histories similar to that in this paper in [8]. I am unaware of earlier descriptions of derivation trees as quotients of histories by a belief relation. Propositional attitudes without possible worlds Despite the success of possible worlds, there is a continuing strand of work combining syntactic and possible world accounts. Haas, and ....

JY Halpern and MY Vardi. The complexity of reasoning about knowledge and time, i: lower bounds. Journal of Computer and System Sciences, 38(1):195--237, 1989.

No context found.

J. Y. Halpern and M. Y. Vardi, The complexity of reasoning about knowledge and time, in Proc. 18th ACM Symp. on Theory of Computing, 1986, pp. 304--315.

No context found.

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:195-237, 1989.

No context found.

Halpern, J. Y., and M. Y. Vardi', `The complexity of reasoning about knowledge and time. I. Lower bounds', Journal of Computer and System Sciences, 38:195--237, 1989.

No context found.

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:195--237, 1989.

No context found.

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:195--237, 1989.

No context found.

J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time. In ACM Symposium on Theory of Computing (STOC '86), pages 304-315, Baltimore, USA, May 1986. ACM Press.

No context found.

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:195-237, 1989.

No context found.

J. Y. Halpern and M. Y. Vardi. The Complexity of Reasoning about Knowledge and Time: Extended Abstract. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 304-315, Berkeley, California, May 1986.

No context found.

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:195-- 237, 1989.

No context found.

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.

No context found.

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:195--237, 1989.

No context found.

J. Y. Halpern and M. Y. Vardi. The Complexity of Reasoning about Knowledge and Time: Synchronous Systems. Technical Report RJ 6097, IBM Almaden Research Center, San Jose, California, April 1988.

No context found.

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.

No context found.

J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time: synchronous systems. Research Report RJ 6097, IBM, 1988.

No context found.

J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time in asynchronous systems. In Proc. 20th ACM Symp. on Theory of Computing, pages 53--65, 1988.

No context found.

J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time. In Proc. 18th ACM Symp. on Theory of Computing, pages 304--315, 1986.

No context found.

J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time. In ACM Symposium on Theory of Computing (STOC '86), pages 304--315, Baltimore, USA, May 1986. ACM Press.

First 50 documents  Next 50

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