K. Van Belleghem, M. Denecker and D. De Schreye, Representing Continuous Change in the Abductive Event Calculus, in Proceedings 1994 International Conference on Logic Programming, ed. P. Van Hentenrijck, pages 225-240, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....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 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] Abduction in the context of the Event Calculus is also discussed in [DeMi 92] VaDe 94a] and [VaDe 94b] Other applications of the Event Calculus include database updates in [Kowa 92] and [VaDe 94b] accident report processing in [LeQu 98] and legal reasoning in [Kowa 95] Various formulations of Event Calculus have been extended to deal with continuous change and mathematical ....

[Article contains additional citation context not shown here]

K. Van Belleghem, M. Denecker and D. De Schreye, Representing Continuous Change in the Abductive Event Calculus, in Proceedings 1994 International Conference on Logic Programming, ed. P. Van Hentenrijck, pages 225-240, 1994.

....Turkey Shooting, the Russian Turkey Shooting and the Stanford Murder Mystery, in the list of the solved problems. 71 the calculus with an abductive procedure a la Eshghi (see [Esh88, EK89] If we further extend the resulting calculus with similar ideas as in the work of Belleghem et al. BDS94] then EC should reach the K RsAd class of reasoning problems. We should proceed in this direction for a while, in constructing a new Event Calculus as the resulting calculus of several extensions, in order to adjust the reasoning process and approach the intended model set for K RACi . At that ....

Kristof Van Belleghem, Marc Denecker, and Danny De Schreye. Representing continuous change in the abductive event calculus. In Proceedings of the International Conference on Logic Programming, 1994.

....actions as the only type of action that can be triggered. There is an importantadvantage of both the axiomatization presented here and Pinto s over approaches which depend on encapsulating the behaviour of at least one parameter inside an explicit T rajectory predicate (or similar) e.g. 11] [13], 12] This is that information about a parameter s behaviour, in the form of various mathematical constraints, may be distributed in a natural way throughout the domain dependent part of the theory.For example, in the water tanks scenario the mathematical knowledge of the domain is expressed in ....

Kristof Van Belleghem, Marc Deneker and DannyDeSchreye, Representing Continuous Change in the Abductive Event Calculus, in proceedings of the 1994 International Conference on Logic Programming, ed. P.Van Hentenrijck, pages 225-240, 1994.

....involving continuously varying parameters to be embedded within domain descriptions. For example, Shanahan (1990) presents a logic programming approach to representing continuous change, based on the event calculus of Kowalski and Sergot (1986) Further work along these lines has been done by Van Belleghem et al. 1994), whose treatment allows a wider class of mathematical expressions, by Shanahan (1995) where a full predicate calculus version using circumscription is presented, and by Herrmann and Thielscher (1996) whose notion of a process generalises Shanahan s notion of a trajectory. However, none of these ....

.... on Qualitative Process Theory (Forbus 1984) Furthermore, qualitative process theory incorporates the ability to handle actions (Forbus 1989) Although some effort has been made to reconcile logic based work in Reasoning about Action with that in Qualitative Reasoning (Crawford Etherington 1992) (van Belleghem et al. 1994), the two fields have yet to be properly integrated. Attempts to axiomatise qualitative reasoning are valuable here (Davis 1992) and it is hoped that the present paper can serve to further work in this vein. Of course, the emphasis in Qualitative Reasoning is on reasoning with incomplete or ....

K. Van Belleghem, M. Deneker and D. De Schreye (1994), Representing Continuous Change in the Abductive Event Calculus, in Proceedings 1994 International Conference on Logic Programming, ed. P. Van Hentenrijck, pages 225-240.

....knowledge. Also like DLs it allows for reasoning on open domains and with incomplete knowledge, two important issues in knowledge representation. To us this is the most interesting result, as the use of OLP for knowledge representation is our main research interest (see for example [11] [21], 12] Acknowledgements Kristof Van Belleghem is supported by the Belgian IWT. Danny De Schreye is a senior research associate of the Belgian NFWO. We thank Werner Nutt and Bernhard Hollunder for pointing us to important references and for their help in answering several arising questions. ....

K. Van Belleghem, M. Denecker, and D. De Schreye. Representing continuous change in the abductive event calculus. Proc. of the International Conference on Logic Programming, 1994, pages 225--240, 1994.

....theory describing time, action and state. The resulting theory has a rich ontology. We have used it to express a variety of temporal phenomena, such as point or interval based time [69] ramifications, concurrency and simultaneous events [26] qualitative and quantitative continuous processes [68], etc. By the use of OLP FOL as underlying language, all the above phenomena can be combined with diverse forms of uncertainty on the temporal information, such as uncertainty on the occurrence of actions, on the order in time of certain events, on the initial state of the described system and ....

.... solving planning problems [59] Also other forms of temporal reasoning problems can be solved in the system, using the same domain description, for example ambiguous prediction and postdiction problems [37] We have experimented with domains involving qualitative and quantitative continuous change [68]. The knowledge base has been used for specifying a realistic communication protocol [36] Currently, two ongoing experiments are the use of the knowledge base in a software engineering problem (a boat rental company administration application) and in an industrial scheduling problem (a ....

K. Van Belleghem, M. Denecker, and D. De Schreye. Representing continuous change in the abductive event calculus. In Proc. of the International Conference on Logic Programming, 1994.

.... associate of the Belgian National Fund for Scientific Research 1 Introduction In the past a number of experiments have been carried out to study the usefullness of extensions of logic programming for specification and reasoning on temporal domains ( 11] 14] 21] 9] 10] 7] 20] [23], 24] Although successful, many of these experiments have a fairly academic flavour. In this paper, we conduct a more realistic experiment, using open logic programming and Event Calculus for the specification of a non trivial temporal domain. The sliding window protocol with go back n [22] is a ....

K. Van Belleghem, M. Denecker, and D. De Schreye. Representing continuous change in the abductive event calculus. In Proc. of the International Conference on Logic Programming, 1994.

....LP. 27] uses a prototype abductive system for planning. 12] describes the application of an abductive procedure to database update problems. As described in [8] we are conducting a number of experiments with SLDNFA as a planner and a general reasoner in the context of event calculus. Recently, [31] describes a qualitative approach to problems involving continuous change in event calculus and the use of SLDNFA to reason on such problems. 32] investigates the use of abduction to implement database operations in a temporal database, represented as an event calculus. From the implementation ....

K. Van Belleghem, M. Denecker, and D. De Schreye. Representing continuous change in the abductive event calculus. In Proc. of the International Conference on Logic Programming, 1994.

....or overlapping actions (which have a non zero duration) On the other hand, like in [20] the issue of counterfactual reasoning is not addressed. We feel the paper is complementary to ours. The modeling of continuous change in Event Calculus has been studied in [27] for the quantitative case and in [29] for the qualitative case. The approach of Shanahan relies on calculations with real numbers, which makes it unsuited for extension to branching time structrures. The approach in [29] however, does not use any calculations on time points and therefore leaves the possibility of branching time ....

....ours. The modeling of continuous change in Event Calculus has been studied in [27] for the quantitative case and in [29] for the qualitative case. The approach of Shanahan relies on calculations with real numbers, which makes it unsuited for extension to branching time structrures. The approach in [29], however, does not use any calculations on time points and therefore leaves the possibility of branching time open. This means hypothetical reasoning on continuously changing quantities becomes possible. This has not been studied in detail yet, and we do not pursue the point further here. ....

K. Van Belleghem, M. Denecker, and D. De Schreye. Representing continuous change in the abductive event calculus. In P. Van Hentenrijck, editor, Proc. of the International Conference on Logic Programming, 1994, pages 225--240, 1994.

....change (the classical example of filling water tanks springs to mind) in the Event Calculus we only need to add an extra axiom describing such change, without modifying the existing axioms. Extensions of the Event Calculus to model continuous change have for example been proposed in [ 22 ] and [ 23 ] . As shown in [ 19 ] it is possible to extend the Situation Calculus to deal with continuous change as well, though the extension requires more substantial modifications to the formalism than in Event Calculus. The introduction of an Event Calculus like time line as in [ 18 ] and [ 19 ] is a ....

....On the other hand, continuous change and a number of other problem cases for the Situation Calculus can be represented in exactly the same way as they can in the Event Calculus. A discussion of continuous change at this point would lead us too far, but we refer the reader to for example [ 22 ] or [ 23 ] . The formalism described in the latter paper does not suffer from an extension to branching time, though the one in [ 22 ] due to its use of a numerical time line, might not be so easily adapted to branching time applications. Finally, there are those cases where hypothetical reasoning is ....

K. Van Belleghem, M. Denecker, and D. De Schreye. Representing continuous change in the abductive event calculus. In Proc. of the International Conference on Logic Programming, 1994.

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