A. C. Kakas and R. Miller. A simple declarative language for describing narratives with ations. Logic Programming, 31, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....most remarkable are the following: i) only instantaneous actions, ii) non determinism is not treated adequately, iii) no partial knowledge and no temporal post diction. However there are some successful attempts in order to overcome these problems proving the great exibility of this formalism [KM97, Sha97]. 1.2 Features Fluents The frame problem [HM86] is a typical problem in AI in the eld of commonsense reasoning. Given the description of a world and of an agent in it, a scenario description , we try to infer intuitive conclusions about all the properties that remain unchanged when actions ....

A. Kakas and R. Miller. A simple declarative language for describing narratives with actions. The Journal of Logic Programming, 1997.

....from state constraints ( 6] 5] 11] 15] and require explicit representation through action preconditions and causal laws. Yet, to date, action preconditions and especially causal laws are still considered to be tightly coupled with state constraints. In some approaches, e.g. 12] 13] [10] and [8] causal laws include an implicit state constraint component . In the approach of [17] the semantics of causal rules is defined in terms of the state constraints (the same causal rule may have di#erent semantics in contexts with di#erent state constraints) causal rules are also ....

A. Kakas and R. Miller. A simple declarative language for describing narratives with actions. Journal of Logic Programming, Special Issue on Reasoning about Action and Change, 31(1-3), 1997.

....of both calculi combine the situation calculus ability to represent hypothetical situations with the event calculus representation of actual events. For simplicity, we restrict the representation to times which are situations or transitions between situations, in the spirit of Kakas and Miller [6]. We formulate both calculi as logic programs and reason with their iff completions, induction over situations and integrity constraints as approximations to the intended semantics of those programs. The technique of reasoning about logic programs using iffcompletions and induction was introduced ....

....situations, and from the simplified event calculus to deal with actual states of affairs. For these latter two purposes, we have adapted the technique of [20, 21] for representing branching time. However, our representation of time is less general than that of [20, 21] and is closer to that of [6], because, for the purposes of our comparison, we restrict ourselves to the special case where times are situations or transitions between situations. We have seen that our derivation of the event calculus from the situation calculus requires proof by induction, whereas our derivation of the ....

Kakas A. and Miller R., A simple declarative language for describing narratives with actions, Journal ol'Logic Programming (this issue) (1996).

....involves specifying and reasoning about beliefs. Forms of first order predicate logic [6467 ] or (modified) modal logic [68 71] have been used to represent trust and its associated concepts. A logic used to formalise trust must represent actions and interactions to cater for distributed agents [72, 73]. Simple relational formalisms are used to model trust with statements of the form Ta b, which means a trusts b [64 67] Each formalism extends this primitive construct with features such as temporal constraints and predicate arguments. Given these primitives, traditional conjunction, ....

Kakas A. and Miller R., /Simple Declarative Language for Describing Narratives with Actions, Journal of Logic Programming, 1997(Special Issue on Reasoning About Actions).

....actions and forms the basis of classical planning. But in its original form it does not allow narratives; the only actual observations that can be expressed in it are about values of fluents in the initial situation. 1.1. Allowing narratives with hypothetical reasoning Recently, researchers [5,19,33,35,36,39] have realized the importance of having a formalism that captures both narratives and hypothetical reasoning about effects of actions. Such a formalism is necessary to formulate planning and execution of actions of an agent in a dynamic environment, where exogenous actions may occur. The agent has ....

....L to nested abnormality theories and show their equivalence. Later, we extend L to allow concurrent actions and give a translation of descriptions in this extended language to nested abnormality theories. L is one of a family of high level action languages recently proposed in the literature [12,19,45]. 1.3. High level language approach vs direct formalization approach In general, researchers that use a high level language to formalize reasoning about actions have normally followed the methodology of: 4 This term was coined by Reiter in [42] where he discussed this drawback. The later ....

[Article contains additional citation context not shown here]

A. Kakas, R. Miller, A simple declarative language for describing narratives with actions, Journal of Logic Programming 31 (1--3) (1996) 157--200.

....in a branching time topology, with possible uncertainty on the initial state of the world. Extensions of A tackle gradually more complex issues: for example AR 0 ( 16] deals with indirect effects of actions (ramifications) and simple forms of nondeterminism. Another formalism, the E language ([15]) uses an event based ontology modelled after a variant of the Event Calculus. E allows for modeling uncertainty on the initial state of the world and includes an initial idea on dealing with some ramifications, which is currently being developed further. The authors have also devised extensions ....

....be determined without additional information. There exists in other words no automated, domain independent method to derive the ramifications and qualifications corresponding to an arbitrary set of state constraints. To cure this problem, causal laws in some form or other have been proposed ([22, 15, 31, 14, 20]) to represent ramifications. Causal laws are explicit rules describing that certain changes in fluents cause (or may cause) certain other changes: an example would be a rule stating that making one gear wheel turn results in the 5 turning of the other wheel. Thus causal laws provide a direct ....

[Article contains additional citation context not shown here]

A. Kakas and R. Miller. A simple declarative language for describing narratives with actions. to appear in : Journal of Logic Programming, Special Issue on Reasoning about Actions, 1996.

....can be represented. However, the fact that influence information is represented independent of the state constraints is an important asset which also makes Thielscher s approach very appropriate for analysing other proposals using causal laws. The approach to ramifications in the E language [19] can be interpreted as a more coarse grained variant of Thielscher s: it uses formulae A whenever C, with A a fluent and C a set of fluent literals to be read as a conjunction. Such a formula corresponds to a combination of the state constraint A V c2C c with influence information stating ....

A. Kakas and R. Miller. A simple declarative language for describing narratives with actions. Linkoping Electronic Articles in Computer and Information Science, 2(12), 1997.

....can be derived automatically 2 from state constraints [13, 14, 22, 31] and must be explicitly represented. Yet, to date, action preconditions and especially causal laws are still formalised as tightly coupled implicitly or explicitly with state constraints. In some approaches, e.g. [23, 25, 18, 17], causal laws include an implicit state constraint component 3 . In the approach of [38] the semantics of causal rules is defined in terms of the state constraints, in the sense that they are seen as rules restoring the state constraints (therefore the same causal rule may have different ....

A. Kakas and R. Miller. A simple declarative language for describing narratives with actions. Journal of Logic Programming, Special Issue on Reasoning about Action and Change, 31(1-3), 1997.

....involves specifying and reasoning about beliefs. Forms of first order predicate logic [64 67] or (modified) modal logic [68 71] have been used to represent trust and its associated concepts. A logic used to formalize trust must represent actions and interactions to cater for distributed agents [72, 73]. Simple relational formalisms are used to model trust with statements of the form T a b, which means a trusts b [64 67] Each formalism extends this primitive construct with features such as temporal constraints and predicate arguments. Given these primitives, traditional conjunction, ....

A. Kakas and R. Miller, "A Simple Declarative Language for Describing Narratives with Actions," Journal of Logic Programming, 1997(Special Issue on Reasoning About Actions).

....In particular, we can, and will, adopt our theory of causal relationships [ Thielscher, 1997 ] and combine it with the events as fluents paradigm. The resulting theory is first presented as a formal, high level narrative description language in the spirit of A [ Gelfond and Lifschitz, 1993 ] or E [ Kakas and Miller, 1997 ] etc. Thereafter, in Sections 5 and 6, we show how this theory can be axiomatized on the basis of a novel variant of the Fluent Calculus. Fluents are the only basic entity of domain descriptions in our language; events, and hence actions, are just a particular kind of fluent. As opposed to most ....

Antonis Kakas and Rob Miller. A simple declarative language for describing narratives with actions. Journal of Logic Programming, 31(1--3):157--200, 1997.

No context found.

A. C. Kakas and R. Miller. A simple declarative language for describing narratives with ations. Logic Programming, 31, 1997.

....the implementation of our abductive tool. However, it is implemented in Prolog, using a simplified version of the abductive logic program module described in [14] The logic program conversion of the given (classical logic) Event Calculus specification is achieved using the method described in [15], which overcomes the potential mismatch between the negation as failure used in the implementation and the classical negation used in the specification. We have been able to formally prove the correctness of our Prolog tool with respect to the theoretical framework described in this paper, and ....

Kakas, A. C, and Miller R. (1997). A Simple Declarative Language for Describing Narratives with Actions. Journal of Logic Programming, Special issue on Reasoning about Actions and Events, 31(1-3): 157-200.

....detail and the overall implementation of our abductive framework. The tool is implemented in Prolog, and it uses (i) a logic program conversion of the given (classical logic) Event Calculus specification, based the method described in [29] and (ii) the abductive logic program module described in [28]. Building upon the theoretical results illustrated, it has been 21 sufficient to implement our abductive analysis approach only with respect to the reduced two timepoints structure S. An implementation example of the case study given in Section 3, with some of the abductive analysis results, is ....

Kakas, A. C., and Miller R. (1997). A Simple Declarative Language for Describing Narratives with Actions. Journal of Logic Programming, Special issue on Reasoning about Actions and Events, 31(1-3): 157-200.

....a natural framework for a variety of AI problems such as diagnosis, planning and cognitive robotics. They can o er a high level of expressivity and a basis for the development of a computational framework to solve these problems. In this paper we study how one such formalism, the Language E [10], can be developed into a framework capable of supporting a variety of basic reasoning modes needed to address this type of AI applications. The computational foundation of this framework and its associated system, called E RES, is a re formulation of the Language E in terms of argumentation [2] ....

A.C. Kakas and R.S. Miller. A simple declarative language for describing narratives with actions. In JLP 31(1-3), pp. 157-200, 1997.

....a natural framework for a variety of AI problems such as diagnosis, planning and cognitive robotics. They can offer a high level of expressivity and a basis for the development of a computational framework to solve these problems. In this paper we study how one such formalism, the Language E [Kakas and Miller, 1997] , can be developed into a framework capable of supporting a variety of basic reasoning modes needed to address this type of AI applications. The computational foundation of this framework and its associated system, called E RES, is a re formulation of the Language E in terms of argumentation ....

A.C. Kakas and R.S. Miller. A simple declarative language for describing narratives with actions. In JLP 31(1-3), pp. 157-200, 1997.

....for theories of action and change written in more general purpose or computation oriented formalisms. Since then, many variants and extensions of A have been proposed. The majority of these, like A itself, are based on an ontology inherited from the Situation Calculus. The Language E [10] was introduced partly to illustrate that Gelfond and Lifschitz s methodology can be applied using ontologies other than that of the Situation Calculus. In particular, it showed that for narrative reasoning (that is, reasoning about actions which actually occur at various times, and reasoning ....

....Calculus [13] and its extensions (see [27] for a comprehensive overview) A key characteristic of the E s semantics is that it is modular, and thus easily extendible. To illustrate what is meant by this more precisely, two extensions of the core semantics are briefly described in an appendix of [10], to deal with qualifications and ramifications respectively. The purpose of the present paper is to expand on the theme of ramifications, and in particular to show how the translation method described in [10] from basic E domain descriptions to Event Calculus style logic programs, may be ....

[Article contains additional citation context not shown here]

Antonis Kakas and Rob Miller, A Simple Declarative Language for Describing Narratives with Actions, The Journal of Logic Programming, Vol 31(1-3) (Special Issue on Reasoning about Action and Change), pages 157-200, Elsevier Science, 1997.

....for theories of action and change written in more general purpose or computation oriented formalisms. Since then, many variants and extensions of A have been proposed. The majority of these, like A itself, are based on an ontology inherited from the Situation Calculus. The Language E [9] was introduced partly to illustrate that Gelfond and Lifschitz s methodology can be applied using ontologies other than that of the Situation Calculus. In particular, it showed that for narrative reasoning (that is, reasoning about actions which actually occur at various times, and reasoning ....

....be characterised as the first of a family of event description languages. A key characteristic of the E s semantics is that it is modular, and thus easily extendible. To illustrate what is meant by this more precisely, two extensions of the core semantics are briefly described in an appendix of [9], to deal with qualifications and ramifications respectively. The purpose of the present paper, which summarises the first part of [10] is to expand on the theme of ramifications and causality. We argue that the inclusion of explicit time and events (action occurrences) in our ontology enables a ....

[Article contains additional citation context not shown here]

Antonis Kakas and Rob Miller, A Simple Declarative Language for Describing Narratives with Actions, The Journal of Logic Programming, Vol 31(1-3) (Special Issue on Reasoning about Action and Change), pages 157-200, Elsevier Science, 1997.

....of work in developing or applying a wider range of formulations of the Event Calculus. The Event Calculus was originally formulated as a logic program in [KoSe 86] and many alternative and extended logic program formulations have subsequently been proposed, including [DeMi 92] DeVa 96] KaMi 97] KaMi 99] Kowa 92] SaKo 95] Shan 90] VaDe 94a] VaDe 94b] VaDe 95] and [VaDe 96] The Event Calculus has also been formulated in modal logic in [CeCh 95] CeCh 96] CeFr 97a] CeFr 97b] CeFr 98] and [ChMo 94] as an action description language in [KaMi 97] and [KaMi 98] and in ....

.... [DeMi 92] DeVa 96] KaMi 97] KaMi 99] Kowa 92] SaKo 95] Shan 90] VaDe 94a] VaDe 94b] VaDe 95] and [VaDe 96] The Event Calculus has also been formulated in modal logic in [CeCh 95] CeCh 96] CeFr 97a] CeFr 97b] CeFr 98] and [ChMo 94] as an action description language in [KaMi 97] and [KaMi 98] and in an argumentation framework in [KaMi 99] The Event Calculus has been applied to planning using abduction in [Eshg 88] Chle 96] JuFi 96] Shan 97b] Shan 98] and [Jung 98] and in particular to cognitive robotics in [Shan 96a] Shan 96b] Shan 98] and [Shan 99b] ....

[Article contains additional citation context not shown here]

A. Kakas and R. Miller, A Simple Declarative Language for Describing Narratives with Actions, JLP 31(1--3) (Special Issue on Reasoning about Action and Change) 157--200, 1997.

....2 Given a planning domain hD; P i and a goal G, let E be an E plan for G. Then, E is a safe plan for G. The high level de nition of the E Planner given above in de nition 5 can be mapped onto a more concrete planner by suitably extending the argumentation based proof theory proposed in (Kakas, Miller, Toni 1999) 0 can be computed directly while computing S 0 , by an abductive process which reasons backwards with the sentences in the background theory. Also, one needs to de ne suitable: extended successful derivations, for computing incrementally w from 0 at step 2 and the nal at step 4.2 from the ....

Kakas, A., and Miller, R. 1997b. A simple declarative language for describing narratives with actions. In JLP 31(1-3), 157-200.

....description languages was rst introduced in [7, 8] and here exempli ed by the Language A) with the aim that such languages could serve as speci cations for theories of action and change written in di erent, general purpose or computation oriented formalisms. One such language is the Language E [10], designed to describe domains involving narrative information, i.e. information about actual occurrences of actions, using a basic ontology of actions, uents and time points inspired by the Event Calculus [12, 13] This paper contributes to the research agenda suggested in [7, 8] by showing how ....

....of this paper we have made the simplifying assumption that the structure of time is isomorphic either to the the integer or to the real number line. For such structures of time, it is reasonable to assume that the number of action occurrences in a given domain is nite. Various previous works [8, 5, 3, 2, 10] address the problem of translating various declarative speci cations for reasoning about actions and change into a computation oriented form. Most of these works translate Language A theories into (some extension of) Logic Programming. On the whole these translations are less direct than the one ....

[Article contains additional citation context not shown here]

A.C. Kakas and R.S. Miller. A Simple Declarative Language for Describing Narratives with Actions. JLP 31(1-3) (Special Issue on Reasoning about Action and Change) 157-200, 1997.

No context found.

Kakas A, Miller R. A simple declarative language for describing narratives with actions. Journal of Logic Programming 1997;31 (1-3) (Special Issue on Reasoning about Action and Change):157-200.

No context found.

A. C. Kakas and R. Miller. A simple declarative language for describing narratives with actions. J. Log. Prog., 31(1--3):157--200, 1997.

No context found.

Antonis Kakas and Rob Miller, A Simple Declarative Language for Describing Narratives with Actions, The Journal of Logic Programming, Vol 31(1-3) (Special Issue on Reasoning about Action and Change), pages 157-200, Elsevier, 1997.

No context found.

Antonis Kakas and Rob Miller, A Simple Declarative Language for Describing Narratives with Actions, The Journal of Logic Programming, Vol 31(1-3) (Special Issue on Reasoning about Action and Change), pages 157-200, Elsevier, 1997.

No context found.

Kakas A., and R. Miller, A simple declarative language for describing narratives with actions, in [155], 157-200, 1997.

First 50 documents

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