| M. Shanahan. Event Calculus planning revised. In Proceedings of European Conference on Planning, pages 390-420. Springer-Verlag Lecture notes in Artificial Intelligence 1348, 1997. |
....implementation and specification. Although this is a very important feature in the design of a planner the main issue of the planning task still remains: how to reduce the search space size There are several works aiming the construction of sound and complete logic based planning systems [7] [17] [12] 8] Moreover, some recent research results [6] demonstrate that, a good theoretical solution can co exist with a good practical solution despite of contrary widespread belief [13] In this paper we are going to analyze a particular logic based planner, named Abductive Event Calculus ....
M. Shanahan. Event Calculus planning revised. In Proceedings of European Conference on Planning, pages 390-420. Springer-Verlag Lecture notes in Artificial Intelligence 1348, 1997.
....proposed [44] The simplified version of the Circumscriptive Event Calculus, presented in the next subsection, was motivated by the idea of circumscribing parts of the theories (as discussed in section 4) and not the whole EC theory. This version is applied in the area of cognitive robotics [39][43] and is the one that we are interested in. 2.2 Event Calculus: A Circumscriptive Flavor Below we present the axiomatization of the simplified version of the Circumscriptive Event Calculus [44] After discussing the basic ideas of Circumscription (section 3) we state the circumscription ....
....in this version of the EC, to overcome the frame problem. The Event Calculus is a many sorted first order language comprising, basically: ffl A sort of time points t 1 ; t 2 ; t n ; t n 1 ; In this case, planning is considered to be an abduction task as defined in [14][43] From now on, when we use the term em Event Calculus to designate the simplified version of the Circumscriptive Event Calculus. ffl A sort of fluents f 1 ; f 2 ; f n ; f n 1 ; ffl A sort of event types a 1 ; a 2 ; a n ; a n 1 ; The following are the predicates ....
[Article contains additional citation context not shown here]
M. Shanahan. Event calculus planning revised. In Proceedings European Conference on Planning, pages 390--420. Springer-Verlag Lecture notes in Artificial Intelligence 1348, 1997.
....proposed [44] The simplified version of the Circumscriptive Event Calculus, presented in the next subsection, was motivated by the idea of circumscribing parts of the theories (as discussed in section 4) and not the whole EC theory. This version is applied in the area of cognitive robotics [39][43] and is the one that we are interested in. 2.2 Event Calculus: A Circumscriptive Flavor Below we present the axiomatization of the simplified version of the Circumscriptive Event Calculus 13 [44] After discussing the basic ideas of Circumscription (section 3) we state the circumscription ....
....in this version of the EC, to overcome the frame problem. The Event Calculus is a many sorted first order language comprising, basically: ffl A sort of time points t 1 ; t 2 ; t n ; t n 1 ; 12 In this case, planning is considered to be an abduction task as defined in [14][43] 13 From now on, when we use the term em Event Calculus to designate the simplified version of the Circumscriptive Event Calculus. ffl A sort of fluents f 1 ; f 2 ; f n ; f n 1 ; ffl A sort of event types a 1 ; a 2 ; a n ; a n 1 ; The following are the ....
[Article contains additional citation context not shown here]
M. Shanahan. Event calculus planning revised. In Proceedings European Conference on Planning, pages 390--420. Springer-Verlag Lecture notes in Artificial Intelligence 1348, 1997.
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