Rosenschein, S. J., and Kaelbling, L. P., 1986. The synthesis of digital machines with provable epistemic properties, Theoretical Aspects of Reasoning about Knowledge (J. Y. Halpern, ed.), Los Altos: Morgan Kaufmann, 83-98.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....considers the production of behaviour through action networks. It appears that these action networks are more expressive than plan nets. While no techniques for action network synthesis have been presented yet, we expect to be able to borrow from some of Nilsson s work on action net abstraction. Rosenschein and Kaelbling s (1987) work on the theory of situated automata is in part an attempt to provide a theory of high level symbolic control. They view a machine as situated in an environment, and provide a formal characterization of the machine s knowledge in terms of objective correlations between states of the machine ....

Stan Rosenschein and Leslie Kaelbling. The Synthesis of Digital Machines with Provable Epistemic Properties. Technical Note 412, Stanford Research Institute, 1987.

....automata paradigm of Rosenschein and Kaelbling [70] They use an epistemic logic (i.e. a logic of knowledge [20] to specify the perception component of intelligent agent systems. They then used an technique based on constructive proof to directly synthesise automata from these specifications [69]. The general approach of automatic synthesis, although theoretically appealing, is limited in a number of important respects. First, as the agent specification language becomes more expressive, then even offline reasoning becomes too expensive to carry out. Second, the systems generated in this ....

S. Rosenschein and L. P. Kaelbling. The synthesis of digital machines with provable epistemic properties. In J. Y. Halpern, editor, Proceedings of the 1986.

....automata paradigm of Rosenschein and Kaelbling [46] They use an epistemic logic (i.e. a logic of knowledge [13] to specify the perception component of intelligent agent systems. They then used an technique based on constructive proof to directly synthesise automata from these specifications [45]. The general approach of automatic synthesis, although theoretically appealing, is limited in a number of important respects. First, as the agent specification language becomes more expressive, then even o#ine reasoning becomes too expensive to carry out. Second, the systems generated in this ....

S. Rosenschein and L. P. Kaelbling. The synthesis of digital machines with provable epistemic properties. In J. Y. Halpern, editor, Proceedings of the

....virtue of the dynamic nature of the environment, and we shall reserve the term proper sequence for tasks that can be executed only by dynamic agents, in virtue of their internal states. Let us rephrase the above considerations. As it has already been suggested in the literature (see for example Rosenschein Kaelbling, 1986; Beer, 1993) the agent and the environment can be viewed as a global system, made up by two coupled subsystems. For the interactions of the two subsystems to be sequential, at least one of them must be properly dynamic, in the sense that its actions depend on the subsystem s state. The two ....

Rosenschein, S. J., & L. P. Kaelbling, 1986. The synthesis of digital machines with provable epistemic properties. In J. Halpern, ed., Proceedings of the 1986 Conference on Theoretical Aspects of Reasoning about Knowledge , Morgan Kaufmann, Los Altos, CA, 83--98.

....of wellknown intentional (BDI) notions is addressed. Other differences are that in our approach no commitments to specific internal (goal directed) system structures and specific internal states need to be made. An approach that in some aspects is similar in perspective to ours, is that of [Rosenschein and Kaelbling, 1986]. They ascribe knowledge to so called situated automata, which are processes that do not have any internal representation of knowledge. A process with a certain internal state v knows j if j is true in all environment situations which are possible when the process is in state v. Our approach for ....

Rosenschein, S. and Kaelbling, L.P. (1986). The Synthesis of Digital Machines with Provable Epistemic Properties. In: J.Y. Halpern (ed.), Proc. of the 1986 Conference on Theoretical Aspects of Reasoning About Knowledge (TARK'86), Morgan Kaufmann, pp. 83-98.

.... human behavior as is overt rational choice (see (Schumpeter, 1934; Nelson and Winter, 1982; Olson, 1982; Shils, 1981) Habitual action can be quite complex and effective, as shown by Tinbergen (1951) and by recent work on reactive or situated systems (Agre and Chapman, 1987; Brooks, 1986; Rosenschein and Kaelbling, 1986), in which combinations of purely habitual rules are tailored to achieve the desired effects in a variety of circumstances. 4.1.3 Inconsistency The theory of ideal rationality follows the logicist approach and requires that the beliefs and preferences of the reasoner be consistent. In practice, ....

....set of global beliefs may be defined. But since the point of distributing knowledge and reasoning is to free the reasoner from having to take all possibly relevant knowledge into account at every step, it is hard to imagine how (apart from using the shared environment as a coordinating store (Rosenschein and Kaelbling, 1986), which may not always be possible or successful) to ensure any degree of global consistency and coordination without undercutting this motivation for distributed computation. 4.2 Resource limitations The most obvious limitations on resources facing reasoners are limitations on the time and ....

Rosenschein, S. J. and Kaelbling, L. P. 1986. The synthesis of digital machines with provable epistemic properties. In Halpern, J. Y., editor, Theoretical Aspects of Reasoning About Knowledge: Proceedings of the 1986 Conference, pp. 83--98.

....architectures for robot control (e.g. RAPs, subsumption, 3T) very few have paid close attention to issues of hard real time responsiveness. Notable exceptions include Rex Gapps, PRS, DR MARUTI and CIRCA. Rex is a language used to describe digital machines that can be viewed as reactive systems [Rosenschein Kaelbling 1986]. Rex programs are compiled into automata descriptions that perform a constant time mapping between inputs (sensors) and outputs (actuators) Gapps [Kaelbling Rosenschein 1990] is a system for compiling declarative descriptions of agent behaviours into Rex machines. Thus Rex Gapps resembles the ....

Rosenschein, S. J., and Kaelbling, L. P. 1986. The synthesis of digital machines with provable epistemic properties. In Proceedings of the Conference on Theoretical Aspects of Reasoning About Knowledge, 83--98.

.... having an encoding of this knowledge at its disposal (like e.g. in Konolige s deduction model of belief [27] or that knowledge is ascribed implicitly (or even metaphorically) to the agent in terms of a relationship between the agent and its environment (as in Rosenschein s situated automata [50, 51], in which an agent knows in a situation where its internal state is oe if holds in all possible situations in which the agent is in internal state oe) At the action level we consider results, abilities and opportunities. Slightly simplifying ideas of Von Wright [63] we consider any aspect ....

S.J. Rosenschein and L.P. Kaelbling. The synthesis of digital machines with provable epistemic properties. In Proceedings of Conference on Theoretical Aspects of Reasoning about Knowledge, pages 83--86, Los Altos, CA, 1986. Morgan Kaufmann. 36

....program (or plan, or set of concurrent behaviors) that manages the asynchrony of the environment. Even if the control program was written perfectly, however, none of these systems could provide guarantees that all the domain s real time deadlines would be met. While PRS and the Rex Gapps system [15, 8] can provide bounded response times on reactive execution, they have no way to reason about the timing characteristics of a domain to understand whether that bounded response time will be fast enough. In contrast, applying SA CIRCA to this domain requires the human to describe the robot ....

S. J. Rosenschein and L. P. Kaelbling, "The Synthesis of Digital Machines with Provable Epistemic Properties," in Proc. Conf. Theoretical Aspects of Reasoning About Knowledge, pp. 83--98, 1986.

....systems. They impose less explicit sequential structure, but more conditionality on each constituent action to guarantee achievement of goals under a variety of environmental conditions. The agent executes this kind of plan in a tight senseact loop with its environment [Agre and Chapman, 1987; Rosenschein and Kaelbling, 1986; Maes, 1990; Nilsson, 1989, Schoppers, 1987] Finally, some researchers combine plans that mimic conventional programs with plans that mimic production systems. The agent s basic competence is embodied in a set of highly conditional actions, which it executes in a sense act loop. However, the ....

Rosenschein, S.J., and Kaelbling, L. P.. The synthesis of digital machines with provable epistemic properties. In Proceedings of the Conference on Theoretical Aspects of Reasoning about Knowledge , Morgan Kaufman, pp. 83-98, 1986.

....systems. They impose less explicit sequential structure, but more conditionality on each constituent action to guarantee achievement of goals under a variety of environmental conditions. The agent executes this kind of plan in a tight senseact loop with its environment [Agre and Chapman, 1987; Rosenschein and Kaelbling, 1986; Maes, 1990; Nilsson, 1989, Schoppers, 1987] Finally, some researchers combine plans that mimic conventional programs with plans that mimic production systems. The agent s basic competence is embodied in a set of highly conditional actions, which it executes in a sense act loop. However, the ....

Rosenschein, S.J., and Kaelbling, L.P. The synthesis of digital machines with provable epistemic properties. In J. Halpern (ed.), Proceedings of the conference on theoretical aspects of reasoning about knowledge , Monterey, Ca, 83-98, 1986.

....robot executing the two agent mission 20 MacKenzie, Arkin, and Cameron Fig. 29. Snapshot of SAUSAGES simulation display after executing the mission shown in Figure 23. Notice the same general route was taken by the robot. Fig. 30. The state transition diagram for the scouting mission REX[22] [43] language all are based on Lisp[7] These languages suffer from a co mingling of the configuration with the specification of the primitives. They also bury hardware specific binding information within the implementations of individual primitives. This greatly increases the amount of effort ....

....They also bury hardware specific binding information within the implementations of individual primitives. This greatly increases the amount of effort necessary to change the configuration or to re deploy it on other robots. REX does support semantic analysis to formally prove run time properties[43] if a detailed environmental model is available. Another class of existing languages are logic based. Gapps[23] 24] is a declarative language providing goals for an off line planner which generates REX programs for execution. Multivalued logic is used to control the robot Flakey, where the ....

S.J. Rosenschein and L.P. Kaelbling. The synthesis of digital machines with provable epistemic properties. Technical Note 412, SRI International, Menlo Park, California, April 1987. Multiagent Mission Specification and Execution 25

....the interaction of more complex behavior systems which cannot be fined tuned in advance. Circuit approaches A third approach stays closer to electrical engineering by assuming that behavior programs, in order to be as efficient as possible, should take the form of combinatorial circuits [2] [100]. This approach potentially leads to direct hardware implementation using VLSI. A combinatorial circuit consists of a set of components which perform a transformation from inputs to outputs. The outputs of one component may be inputs to one or more other components, thus forming a network. Each ....

....propagate through the network thus relating sensing to action. A language (called REX) has been developed to describe circuits. Compilers and interpreters exist which allow REX defined circuits to run on physical robots. 29 To make programming circuits more tractable, Rosenschein and Kaelbling [100] have developed a higher level language which is based on a logical formalism known as situated automata. A translator has also been developed that transforms expressions expressed in this logical formalism into circuits. A circuit approach has a number of advantages from an engineering point of ....

Rosenschein, S. and L. Kaelbling. (1986) The synthesis of digital machines with provable epistemic properties. In: Halpern, J. (ed.) (1986) Theoretical Aspects of Reasoning about Knowledge. Morgan Kaufmann, Pub. San Mateo. p. 83-98.

....This transformation should be made more straightforward and should ideally be automatic. Two good illustrations of how this objective can be achieved are Shoham s agent oriented programming paradigm [66] and Rosenschein and Kaebling s work on analysing the knowledge states of situated automata [62]. The former has an agentification process which takes high level programming language primitives and converts them into low level executable objects. The latter uses epistemic temporal logic to specify what a designer would have a machine know . This intentional description is then compiled ....

S. J. Rosenschein and L. Kaelbling, The Synthesis of Digital Machines with Provable Epistemic Properties, in: J. Y. Halpern, ed., Proc. of Theoretical Aspects of Reasoning About Knowledge, (Morgan Kaufmann, 1985) 83-98.

.... it was a major oversight of the 1985 paper that I did not compare the proposed control architecture with classical planning models [3] That comparison would have highlighted features of the architecture that anticipated important later work: its eventbased ( situated ) triggering of actions [1, 22]; its support for abstract control plans that constrain, but do not completely determine actions [21] its run time interleaving of planning, replanning, and execution [4, 6] and its integration of deliberation and reactivity [16] There is now a growing interest in architectures for more ....

S. J. Rosenschein and L. P. Kaelbling. "The synthesis of digital machines with provable epistemic properties." In Proceedings of the Conference on Theoretical Aspects of Reasoning about Knowledge, Morgan Kaufman, pp. 83-98, 1986.

....indistinguishable to a processor if it has the same local state in both. This is the situatedautomata approach, where knowledge is ascribed on the basis of the information carried by the state of a machine [Ro] This approach has been used in a number of papers on distributed systems, including [HM1, DM, FHV, MT, RK]. However, there are situations where it is not clear how to use Kripke structures to model directly a state of knowledge. Example 1.1: Consider a system with two communicating agents where message transmission is not guaranteed. Suppose two messages have been exchanged: a message from agent 1 to ....

S.J. Rosenschein and L.P. Kaelbling, The synthesis of digital machines with provable epistemic properties, Theoretical Aspects of Reasoning about Knowledge (J. Y. Halpern, ed.), Morgan Kaufmann, 1986, pp. 83--98. 53

....is ever to become a workaday reality, this issue must be addressed. In this paper, we hope to bring the theory and practice of agent oriented programming closer together. We define an expressive branching time logic for developing agent 1 The obvious exception is the situated automata paradigm [20]. specifications, which contains modal connectives for representing knowledge and seeing to it that (stit) 3] This logic provides the agent designer with a rich collection of primitives for specifying agents. For example, one can use the logic to write formulae that express the sense of if the ....

....a specification, and suggests the possibility of automatically synthesizing agents from specifications given in the logic. This paper can thus be seen to build on the situated automata paradigm, where agents were in part synthesized from specifications given in terms of a modal logic of knowledge [20]. The remainder of the paper is structured as follows. We begin, in the following section, by rigorously defining the new logic. In section 3, we examine the relationship between this logic and automata like agents, and define the conditions under which an agent satisfies a specification. We also ....

[Article contains additional citation context not shown here]

S. Rosenschein and L. P. Kaelbling. The synthesis of digital machines with provable epistemic properties. In J. Y. Halpern, editor, Proceedings of the 1986 Conference on Theoretical Aspects of Reasoning About Knowledge, pages 83--98. Morgan Kaufmann Publishers: San Mateo, CA, 1986.

....knows that processor 3 is still up . Although notions of knowledge have frequently been used in informal descriptions, traditional formal analyses of distributed protocols avoid any explicit mention of knowledge. Recent work has shown that these informal arguments can be completely formalized (see [HM1, DM, MT, RK] for some detailed examples) In AI there have been two approaches to ascribing knowledge to machines or components of systems. The classical AI approach, which has been called the interpretedsymbolic structures approach [Ro] ascribes knowledge on the basis of the information stored in certain ....

.... Alice :p K Alice ( p KBob p) p :KBob:p) 1) Although this formula is perfectly consistent with S5, it is not attainable under the assumptions of [FV2] To see that it is not attainable, it is convenient to consider the notion of distributed knowledge 1 introduced in [HM1] and studied in [CM, DM, FV2, MT, PR, RK]) Roughly speaking, a group has distributed knowledge of a fact if by putting all their information together, the members of the group could deduce that fact. In the class of systems considered in [FV2] distributed knowledge obeys a certain conservation principle it can neither be lost not ....

[Article contains additional citation context not shown here]

S.J. Rosenschein and L.P. Kaelbling, The synthesis of digital machines with provable epistemic properties, Theoretical Aspects of Reasoning about Knowledge (ed. J.Y. Halpern), Morgan Kaufmann, 1986, pp. 83--98.

....because the system fails entirely if any single part of it is not functioning properly, particularly when the real world deviates significantly from the models employed. In architectures which employ priority based arbitration such as the Subsumption Architecture [Brooks, 1986] and GAPPS [Rosenschein and Kaelbling, 1986], action selection is achieved by assigning priorities to each behavior; the active behavior with the highest priority is in control and the rest are ignored. This allows for quick responses to new situations and stimuli, although, by definition, prioritization only allows one module to affect ....

Stanley Rosenschein and Leslie Kaelbling. The Synthesis of Digital Machines with Provable Epistemic Properties. In Proceedings of Theoretical Aspects of Reasoning about Knowledge, pp 83-98. 1986.

....to directly control the amount of time spent on the match process. By contrast, in an effort to avoid the computational cost of control reasoning and thereby create real time responsivity, some researchers have turned their attention to the theory, design, and implementation of reactive agents [1, 2, 39, 43, 45]. Basically, reactive agents store large numbers of perception action rules in a computationally efficient form and execute actions invoked by environmental conditions on each iteration of a perceive act cycle. Thus, they are similar to control theoretic methods [5] where traversal of symbolic ....

Rosenschein, S.J., and Kaelbling, L.P. The synthesis of digital machines with provable epistemic properties. In J. Halpern (ed.), Proceedings of the Conference on Theoretical Aspects of Reasoning about Knowledge, Morgan Kauffman, 1986.

No context found.

Rosenschein, S. J., and Kaelbling, L. P., 1986. The synthesis of digital machines with provable epistemic properties, Theoretical Aspects of Reasoning about Knowledge (J. Y. Halpern, ed.), Los Altos: Morgan Kaufmann, 83-98.

No context found.

S.J. Rosenschein and L.P. Kaelbling. The synthesis of digital machines with provable epistemic properties. Technical Note 412, SRI International, Menlo Park, CA, April 1987.

No context found.

S.J. Rosenschein and L.P. Kaelbling. The synthesis of digital machines with provable epistemic properties. Technical Note 412, SRI International, Menlo Park, CA, April 1987.

No context found.

S. Rosenschein and L. P. Kaelbling. The synthesis of digital machines with provable epistemic properties. In J. Y. Halpern, editor, Proceedings of the 1986.

No context found.

S. Rosenschein and L. Kaelbling. The synthesis of digital machines with provable epistemic properties. In J.F. Halpern, editor, The 1986.

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