Dipartimento di Matematica e Informatica, Universita di Udine. This paper proposes a modal logic reconstruction of temporal reasoning

Transcription

1 A Modal Calculus of Partially Ordered Events in a Logic Programming Framework Iliano Cervesato 1 Dipartimento di Informatica, Universita di Torino Corso Svizzera 185, Torino - ITALY iliano@di.unito.it Luca Chittaro and Angelo Montanari 2 Dipartimento di Matematica e Informatica, Universita di Udine Via delle Scienze 206, Udine - ITALY fchittarojmontanag@dimi.uniud.it Abstract This paper proposes a modal logic reconstruction of temporal reasoning about partially ordered events in a logic programming framework. It considers two variants of Kowalski and Sergot's Event Calculus (EC): the Skeptical EC (SKEC) and the Credulous EC (CREC). In the presence of partially ordered sequences of events, SKEC and CREC derive the maximal validity intervals over which the relevant properties are necessarily and possibly true, respectively. SKEC and CREC are proved to be the operational counterparts of the modal operators of necessity and possibility in an appropriate modal logic and their properties in relation to EC are studied. 1 Introduction The problem of computing which facts must be or can possibly be true over certain time intervals when information about the ordering of events is incomplete has been already addressed in the literature, e.g. [2, 4, 5]. This is a key issue for many real-world applications that either receive ordering information asynchronously with respect to the recording of events or cannot acquire complete ordering information. Case studies in the domains of planning and diagnosis have been analyzed in [10] and [3], respectively. In this paper, we propose a unifying framework based on Kowalski and Sergot's Event Calculus [8] (hereinafter EC) and its skeptical and credulous variants [3] that allows us to formally characterize the state of knowledge about event ordering and its updates as well as queries about the truth of facts over time. 1 Currently visiting the Computer Science Department of Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA On leave at ILLC, Universiteit van Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands. Appeared in the Proceedings of the Twelfth International Conference on Logic Programming ICLP'95, (L. Sterling editor), pp. 299{313, MIT Press, Kanagawa, Japan, 13{16 June 1995.

2 EC is a formalism for reasoning about time and change in a logic programming framework. Given a set of events, EC allows to derive maximal validity intervals (MVIs hereinafter) over which the properties they initiate or terminate hold. However, when only partial knowledge about the ordering of events is given, EC is neither able to derive all possible MVIs nor to distinguish which of the derived intervals are defeasible and which are not. In this paper, we consider two variants of EC, namely the skeptical and the credulous EC (SKEC and CREC, respectively) [3]. The rst derives MVIs that will be true in whatever nal completion of the ordering, while the second derives those that may be true in at least one possible renement of the ordering. We provide a uniform interpretation of EC, SKEC and CREC in a modal logic framework. In particular, we show how the two latter calculi can be respectively viewed as the operational counterparts of the modal operators of necessity and possibility in an appropriate modal logic. The paper is organized as follows. In Section 2 we briey describe the basic features of EC. In Section 3 we introduce its skeptical and credulous variants. In Section 4 we provide a modal logic interpretation of the three calculi. In particular, we prove the soundness and completeness results that relate the three calculi to their modal counterparts. 2 The basic Event Calculus EC proposes a general approach to representing and reasoning about events and their eects in a logic programming framework. It takes the notions of event, property, time-point and time-interval as primitives and denes a model of change in which events happen at time-points and initiate and/or terminate time-intervals over which some property holds. EC also embodies a notion of default persistence according to which properties are assumed to persist until an event that interrupts them occurs. Formally, we represent an event occurrence by means of the predicate happens/1. Events are assumed to be ordered relatively to each other rather than with respect to an absolute time line. Factual knowledge about event ordering is expressed through the predicate beforefact/2. EC exploits the transitive closure of this ordering information, dened by means of the predicate before/2: before(e1,e2) :- beforefact(e1,e2). (1) before(e1,e2) :- beforefact(e1,e3),before(e3,e2). (2) The relations between events and properties are dened by means of the predicates initiates/2 and terminates/2: initiates(e1,p1). terminates(e2,p2).

3 The initiates (terminates) declaration states that event e1 (e2) initiates (terminates) a period of time during which property p1 (p2) holds. The plain EC model of time and change is dened by means of a set of axioms. The axiom holds/1 allows us to state that a property P holds maximally between events Ei and Et if Ei initiates P and occurs before Et that terminates P, provided that there are no known interruptions in between: holds(period(ei,p,et)) :- happens(ei),initiates(ei,p),happens(et), terminates(et,p),before(ei,et),not broken(ei,p,et). (3) The negation involving broken/3 is interpreted as negation-as-failure: properties are assumed to hold uninterrupted over an interval of time on the basis of failure to determine an interrupting event. The predicate broken is dened as follows: broken(ei,p,et) :- happens(e),before(ei,e),before(e,et), (initiates(e,q);terminates(e,q)),(exclusive(p,q);p=q). (4) This axiom states that a given property P ceases to hold if there is an event E that happens between Ei and Et and initiates or terminates a property Q that is incompatible with P (predicate exclusive(p,q)). We must also constrain the interferences due to incomplete sequences of events relating to the same property. By considering the condition P=Q, we guarantee that the axiom for broken succeeds also when an initiating or terminating event for property P is found between the pair of events Ei and Et starting and terminating P, respectively. 3 Managing the temporal ordering of events Database updates in EC provide information about the occurrence of events and their occurrence times, and are of additive nature only [7]. Since EC computes MVIs by applying a default persistence rule, an upgrading of its knowledge may result in some no longer derivable MVIs. In this paper, we investigate how the MVIs derivable within the current set of events can change in response to the arrival of new ordering information (the practical relevance of this case has been illustrated in [3]). More precisely, we formally characterize the set of MVIs that cannot be invalidated no matter how the ordering information is updated (as far as it is consistent), and the set of MVIs that may eventually become deducible depending on which ordered pairs are acquired. The corresponding two calculi, respectively nicknamed the Skeptical Event Calculus (SKEC ) and the Credulous Event Calculus (CREC ), permit to derive the set of MVIs that are necessarily and possibly valid, respectively, in the possible completions of

4 the current state of knowledge. SKEC implements a sort of absolute persistence in order to exclude the possibility of deriving information that could be later retracted, provided that the given set of event occurrences does not change. The idea is to transform the denition of holds/1 so that holds(period(ei,p,et)) succeeds if and only if it is possible to conclude that no event aecting p will ever occur after ei and before et. In such a way, the computed MVIs are undefeasible with respect to renements of the ordering specication: new ordering pieces coming in may result in new MVIs being derived, but every old MVI is still valid. SKEC replaces the predicates holds and broken of EC with the predicates sholds/1 and sbroken/3, respectively: sholds(period(ei,p,et)) :- happens(ei),initiates(ei,p),happens(et), terminates(et,p),before(ei,et),not sbroken(ei,p,et). sbroken(ei,p,et) :- happens(e),e n== Ei,E n== Et, not before(e,ei),not before(et,e), (initiates(e,q);terminates(e,q)),(exclusive(p,q);p=q). (5) (6) Unlike SKEC, whenever it is not possible to derive that a terminating event et precedes an initiating event ei, CREC assumes that et follows ei. Such an assumption allows CREC to compute all MVIs which are not incompatible with a given set of partially ordered events. More precisely, CREC computes every MVI that holds with respect to at least one possible completion of the given partial ordering of events. Further constraining the ordering of events may indeed invalidate previously computed MVIs, but it never forces CREC to compute new MVIs. The axioms of CREC are the same of EC except for the replacement of before(ei,et) with the negation of before(et,ei) in the denition of holds. The resulting predicate cholds/1 is dened as follows: cholds(period(ei,p,et)) :- happens(ei),initiates(ei,p),happens(et), terminates(et,p),not before(et,ei),not broken(ei,p,et). (7) A collection of facts with happens, initiates, terminates or exclusive as their predicate symbols is called factual knowledge. It represents information specic to the problem at hand. A collection of beforefact facts is instead referred to as ordering information. It represents temporal data that become available during the execution 3. 3 For the ease of the reader, we associate names to certain sets of clauses. Specically, clauses (1){(7) are generically called the axioms of the extended Event Calculus and are referred to as EC+; clauses (1){(2), (3){(4) constitute the axioms of EC and are denoted by EC; clauses (1){(2), (4), (7) are the axioms of CREC (CREC); clauses (1){(2), (5){(6) are the axioms of SKEC (SKEC); axioms (1){(2) are the ordering axioms and are denoted by O.

5 4 A modal logic interpretation of the calculi EC, SKEC and CREC have a modal logic counterpart where orderings are interpreted as possible worlds, each one denoting a dierent state of knowledge. Moreover, an MVI derived by EC translates into a formula which is true in the current world, and its derivability in SKEC (resp. CREC) corresponds to the truth of the formula in every accessible world (resp. in at least one of them). 4.1 Formalization of the Event Calculus with relative timing In order to formalize EC with relative timing, we rst give a precise description of the factual knowledge. A structure for the Event Calculus with relative timing (hereinafter EC-structure) is a quintuple H = (E; P; [i; h]; ];[) such that: E = fe 1 ; : : :; e n g is a nite set of events; P = fp 1 ; : : :; p m g is a nite set of properties; [i : P! 2 E and h] : P! 2 E are respectively the initiating and terminating map of H (for every property p 2 P, [pi and hp] represent the set of events that initiate and terminate p, respectively; [pi and hp] are disjoint for every p 2 P ); ];[ P P is an irreexive and symmetric relation, called the exclusivity relation, that models exclusivity among properties. In order to formally dene the notion of ordering, let R + denote the transitive closure of a relation R on a set A. Given a set of events E, we dene o E E to be a knowledge state for E if o + is a (possibly partial) strict ordering on E. Let O E be the set of all knowledge states for E and W E O E be the set of all strict orderings on E (the subscripts will be kept implicit when no confusion can arise). Two knowledge states o 1 and o 2 are equally informative if o + = 1 o+ 2. This induces an equivalence relation on O. It is easy to prove that O = and W are isomorphic. Thus, in the following, a knowledge state o will always be identied with the corresponding element o + of W, unless explicitly stated otherwise. The pair (W; ), where is the ordinary subset relation, has the structure of an ordered set 4. Let w belong to W. Any w 0 2 W such that w w 0 is called an extension of w. We denote the set of all extensions of w as Ext(w). It is trivial to prove that if (e 1 ; e 2 ) 2 w, then, for every w 0 2 Ext(w), (e 1 ; e 2 ) 2 w 0. Let us now dene a family of representation functions that relate the mathematical entities we have been using in this section to the terms of the logic programming language we have described in Sections 2 and 3. In the following, we will refer to an EC-structure H = (E; P; [i; h]; ];[). First, we dene the functions E and P that consider the concrete syntax of single events and properties, respectively. We explicitly assume that these functions are injective, i.e. that every event e in E (property p in 4 It can be easily proved that (W; \; ) forms a nite lower semilattice, and that, for every w 1; w 2 2 W, w 1 " w 2 = (w 1 [ w 2) + is the lub of w 1 and w 2 with respect to whenever this element belongs to W (w 1 and w 2 may indeed contain incompatible pairs).

6 P ) has a representation that is dierent from that of all other events (resp. properties). This enables us to utilize the respective inverse functions, E and P, whenever they are dened. Moreover, we want E and P give distinct representations to events and properties. The next step consists in dening the translation maps for [i, h] and ];[, that correspond to the predicates initiates, terminates and exclusive. We need also a function that relates the set of events E to the predicate happens to complete the mapping onto the factual knowledge: [i I = finitiates( e E ; p P ) : e 2 E; p 2 P; and e 2 [pig; h] T = fterminates( e E ; p P ) : e 2 E; p 2 P; and e 2 hp]g; ];[ X = fexclusive( p P ; q P ) : p; q 2 P and ]p; q[g; E H = fhappens( e E ) : e 2 Eg: We dene the representation of the EC-structure H as the union of the representations of its constituent entities: H S = E H [ [i I [ h] T [ ];[ X : Information concerning a knowledge state o on a set E of events will be related to its concrete syntax by means of the function O : o O = fbeforefact( e 1 E ; e 2 E ) : (e 1 ; e 2 ) 2 og. In order to simplify the notation, we will write the previously dened translation maps as whenever possible. 4.2 A uniform modal framework for EC, SKEC and CREC In this section, we investigate the properties of EC-structures and their relationships to the event calculi introduced in Sections 2 and 3. First we dene the query language. Let H = (E; P; [i; h]; ];[) be an ECstructure. The query language for H, denoted as L H (L when no ambiguity arises) is the set of all EC-formulae, as dened by the following equality: L H = fp(e 1 ; e 2 ); 2p(e 1 ; e 2 ); 3p(e 1 ; e 2 ) : p 2 P and e 1 ; e 2 2 Eg: We call L 0 H the sublanguage of L H consisting of atomic formulae p(e 1 ; e 2 ) only. Notice that L H is a propositional language (do not be misled by the structured notation we used for atomic formulae). A modal interpretation for EC formulae can be dened as follows. Given an EC-structure H = (E; P; [i; h]; ];[), an EC-frame for H is dened as a pair (W; ), where W is the set of all strict orderings on E and plays the role of accessibility relation. EC-frames are reexive, transitive and antisymmetric. An EC-interpretation M based on a frame (W; ) is the triplet (W; ; ), where is the valuation function : L 0 W! ftrue; falseg that assigns a truth value to each atomic formula in L 0 in each world w 2 W in such a way that (p(e 1 ; e 2 ); w) = true if and only if i. e 1 2 [pi; e 2 2 hp]; (e 1 ; e 2 ) 2 w; ii. :9e 2 E: (e 1 ; e) 2 w ^ (e; e 2 ) 2 w ^ 9q 2 P: ((e 2 [qi _ e 2 hq]) ^ (]p; q[ _ p = q))):

7 Condition (ii) expresses the requirement that p holds uninterruptedly between e 1 and e 2. As a matter of convenience, let us denote such a condition as nb(p; e 1 ; e 2 ; w). Notice also that, since w is a strict ordering, (e 1 ; e) 2 w and (e; e 2 ) 2 w entail e 1 6= e and e 6= e 2. The notion of satisability of an L H -formula in a knowledge state is dened as follows: w j= p(e 1 ; e 2 ) i (p(e 1 ; e 2 ) = true; w j= 2p(e 1 ; e 2 ) i for every w 0 2 W such that w w 0, w 0 j= p(e 1 ; e 2 ) w j= 3p(e 1 ; e 2 ) i there is w 0 2 W such that w w 0 and w 0 j= p(e 1 ; e 2 ): The following two lemmas relate satisability and local properties of ECstructures. Lemma 4.1 (Pointwise condition for necessity) Let H = (E; P; [i; h]; ];[) be an EC structure. Then for any e 1 ; e 2 2 E, p 2 P and w 2 W, w j= 2p(e 1 ; e 2 ) i the following conditions are satised: e 1 2 [pi; e 2 2 hp]; (e 1 ; e 2 ) 2 w; and nsb(p; e 1 ; e 2 ; w); where nsb(p; e 1 ; e 2 ; w) stands for the expression 8e 2 E: 8q 2 P: _ e = e 1 _ e = e 2 _ (e; e 1 ) 2 w _ (e 2 ; e) 2 w (e 2 [qi _ e 2 hq] ) :]p; q[ ^ p 6= q): Proof: (() Let us proceed by contradiction. Assume that e 1 2 [pi, e 2 2 hp], (e 1 ; e 2 ) 2 w and nsb(p; e 1 ; e 2 ; w), but there exists an extension w 0 of w such that w 0 j= p(e 1 ; e 2 ) does not hold, i.e. such that nb(e 1 ; e 2 ; w 0 ) is false. After some logical manipulations, the latter statement rewrites to 9e 2 E: q 2 P:((e 1 ; e) 2 w 0 ^ (e; e 2 ) 2 w 0 ^ (e 2 [qi _ e 2 hq]) ^ (]p; q[ _ p = q): Let e 0 and q 0 witness the validity of this formula. By instantiation, we obtain: (e 1 ; e 0 ) 2 w 0 ^ (e 0 ; e 2 ) 2 w 0 ^ (e 0 2 [q 0 i _ e 0 2 hq 0 ]) ^ (]p; q 0 [ _ p = q 0 ) (1) We can instantiate the expression for nsb(p; e 1 ; e 2 ; w) with these values too. The resulting formula is: e 0 = e 1 _ e 0 = e 2 _ (e 0 ; e 1 ) 2 w _ (e 2 ; e 0 ) 2 w (e 0 2 [q 0 i ^ e 0 2 hq 0 ] ) :]p; q 0 [ ^ p 6= q 0 ): (2) We must show that none of the alternatives in formula (2) applies. Since w is a strict order, the validity of (1) implies that e 0 can be neither e 1 nor e 2. Analogously, by monotonicity of extensions, either (e 0 ; e 1 ) 2 w or (e 2 ; e 0 ) 2 w would violate the antisymmetry of w 0. Finally, the choice of q 0 contradicts the last alternative, i.e. that (e 0 2 [q 0 i _ e 0 2 hq 0 ] ) :]p; q 0 [ ^ p 6= q 0 ). This concludes this direction of the proof. ()) We will again proceed by contradiction. Clearly, if e 1 62 [pi or e 2 62 hp], then we cannot obtain w 0 j= p(e 1 ; e 2 ) in any state of knowledge w 0.

8 If (e 1 ; e 2 ) 62 w, then there exist extensions of w containing (e 2 ; e 1 ). Because of antisymmetry, these extensions cannot contain (e 1 ; e 2 ), thus, p(e 1 ; e 2 ) cannot be valid in them. Assume now that nsb(p; e 1 ; e 2 ; w) does not hold. Therefore, there are an event e 0 and a property q 0 such that: e 0 6= e 1 ^ e 0 6= e 2 ^ (e 0 ; e 1 ) 62 w ^ (e 2 ; e 0 ) 62 w ^ ^ (e 0 2 [q 0 i _ e 0 2 hq 0 ]) ^ (]p; q 0 [ _ p = q 0 ): Since (e 1 ; e 2 ) 2 w, there exists at least one extension w 0 (e 1 ; e 0 ) 2 w 0 and (e 0 ; e 2 ) 2 w 0. Therefore, of w such that (e 1 ; e 0 ) 2 w 0 ^ (e 0 ; e 2 ) 2 w 0 ^ (e 0 2 [q 0 i _ e 0 2 hq 0 ]) ^ (]p; q 0 [ _ p = q 0 ) hence nb(p; e 1 ; e 2 ; w 0 ) does not hold. This contradicts the hypothesis that w j= 2p(e 1 ; e 2 ). 2 Notice that, unlike nb(p; e 1 ; e 2 ; w), nsb(p; e 1 ; e 2 ; w) requires that there is no e 2 E such that (e; e 1 ) 62 w and not only that (e 1 ; e) 2 w; similarly for (e 2 ; e). Lemma 4.2 (Pointwise condition for possibility) Let H = (E; P; [i; h]; ];[) be an EC structure. Then for any e 1 ; e 2 2 E, p 2 P and w 2 W, w j= 3p(e 1 ; e 2 ) i the following conditions are satised: e 1 2 [pi; e 2 2 hp]; (e 2 ; e 1 ) 62 w; and nb(p; e 1 ; e 2 ; w): Proof: (() Let us construct an extension w 0 of w such that w 0 j= p(e 1 ; e 2 ). Let w 0 be (w [ f(e 1 ; e 2 )g) +. First notice that w 0 is consistent since w is consistent and (e 2 ; e 1 ) 62 w. Then observe that nb(p; e 1 ; e 2 ; w 0 ) holds by the denition of w 0 and the monotonicity of extensions. Otherwise, we should be able to conclude that there is an event e 2 E such that (e 1 ; e) 2 w 0, (e; e 2 ) 2 w 0 and e 2 [qi or e 2 hq] for some property q 2 P with ]p; q[ and p 6= q, but in that case, (e 1 ; e) 2 w and (e; e 2 ) 2 w contradicting the assumption that nb(p; e 1 ; e 2 ; w). Therefore, conditions (i-ii) are satised w.r.t. w 0, hence w 0 j= p(e 1 ; e 2 ), thus w j= 3p(e 1 ; e 2 ). ()) We proceed by contradiction. Clearly, if e 1 62 [pi or e 2 62 hp], then we cannot obtain w 0 j= p(e 1 ; e 2 ) in any state of knowledge w 0. Analogously, if (e 2 ; e 1 ) 2 w, then (e 2 ; e 1 ) belongs to every extension of w, forbidding in this way condition (i) of the denition of valuation to be satised. Finally, if nb(p; e 1 ; e 2 ; w) does not hold, then, by monotonicity of extensions, the same condition would apply to every extension w 0 as well, thus nb(p; e 1 ; e 2 ; w 0 ) would not hold in any extension w 0 of w Soundness and Completeness results In this section we prove the soundness and completeness results that relate the clausal representation of EC, SKEC and CREC introduced in Sections 2 and 3 to the formal system described above. For this purpose, we need to

9 refer to the provability relation built in the inference engine of Prolog. Given a program P and a goal formula g, we will denote this relation as P `sldnf g, meaning that the goal g is provable by SLDNF-resolution from program P. In the following, we will need a couple of basic results about negation-asfailure. See [9] for more detail. Specically, we have that, if P is a denite program and g is a goal, the following statements hold: P `sldnf not g ) P 6`sldnf g; P 6`sldnf g but P `sldnf g terminates ) P `sldnf not g: (NAF{A) (NAF{B) We begin with two lemmas referring to the properties of before. Lemma 4.3 (Soundness/completeness of before w.r.t. transitive closure) Let H = (E; P; [i; h]; ];[) be an EC structure and o a state of knowledge, then for any e 1 ; e 1 2 E O; H ; o `sldnf before( e 1 ; e 2 ) i (e 1 ; e 2 ) 2 o +. Proof: ()) We will prove the statement by induction on the height of a resolution tree for O; H ; o `sldnf before( e 1 ; e 2 ). If the height is 1, then clause (1) must have been used. Thus O; H ; o `sldnf beforefact( e 1 ; e 2 ) and therefore, (e 1 ; e 2 ) 2 o o +. Otherwise, let us assume that this tree has height h + 1. The rst rule applied must be clause (2). By unfolding, we obtain that O; H ; o `sldnf beforefact( e 1 ; e ) and O; H ; o `sldnf before( e ; e 2 ) for some event e, where the latter has a derivation tree of height h. Thus, (e 1 ; e) 2 o and, by induction, (e; e 2 ) 2 o +. Now, by the denition of transitive closure, (e 1 ; e 2 ) 2 o +. (() Let = e 0 1 ; : : :; e0 l, with e0 1 = e 1 and e 0 l = e 2 be a sequence of events such that for i = 1 : : :l? 1 (e 0 i ; e0 i+1 ) 2 o, proving in this way that (e 1; e 2 ) 2 o +. We conduce the proof by induction on the length l of this sequence. If l = 1, then (e 1 ; e 2 ) 2 o, thus O; H ; o `sldnf beforefact( e 1 ; e 2 ) and, by clause (1), O; H ; o `sldnf before( e 1 ; e 2 ). Otherwise, = e 1 ; e 0 ; : : :; e 2 with (e 1 ; e 0 ) 2 o and (e 0 ; e 2 ) 2 o +. Thus O; H ; o `sldnf beforefact( e 1 ; e 0 ) and, by induction, O; H ; o `sldnf before( e 0 ; e 2 ). Finally, by applying clause (2), we obtain O; H ; o `sldnf before( e 1 ; e 2 ). 2 Lemma 4.4 (Soundness/completeness of not before) Let H = (E; P; [i; h]; ];[) be an EC structure and o a state of knowledge, then, for any e 1 ; e 1 2 E, O; H ; o `sldnf not before( e 1 ; e 2 ) i (e 1 ; e 2 ) 62 o +. Proof: By lemma 4.3, we reduce this statement to O; H ; o `sldnf not before( e 1 ; e 2 ) i O; H ; o 6`sldnf before( e 1 ; e 2 ):

10 In order to prove this relation, we need to rely on the properties of negationas-failure stated at the beginning of the section. The proof proceeds as follows: ()) Immediate from (NAF{A). (() We must prove that O; H ; o `sldnf before( e 1 ; e 2 ) has only (possibly failed) nite computations (by property (NAF{A)). Assume by absurdum that the goal before( e 1 ; e 2 ) leads to an innite computation w.r.t. the program O; H ; o. Hence, clause (2) has been applied innitely many times. In particular, we have that O; H ; o `sldnf beforefact( ^e i ; ^e i+1 ) for an innite sequence of events f^e i g i2! (with ^e 0 = e 1 ). Thus (^e i ; ^e i+1 ) 2 o for all i 2!. At this point, we must remember that E is nite. Therefore, there must be two distinct indices i; j with i < j such that ^e i = ^e j. Then, by transitivity, we have that (^e i ; ^e j ) 2 o +, but this violates the irreexivity of o +. 2 Lemma 4.5 (Correspondence between broken (sbroken) and nb (nsb)) Let H = (E; P; [i; h]; ];[) be an EC structure and o a state of knowledge, then a. EC+; H ; o `sldnf broken( e 1 ; p ; e 2 ) i :nb(p; e 1 ; e 2 ; o + ) holds in H; b. EC+; H ; o `sldnf sbroken( e 1 ; p ; e 2 )i :nsb(p; e 1 ; e 2 ; o + ) holds in H. Proof: (a )) Assume that EC+; H ; o `sldnf broken( e 1 ; p ; e 2 ). After unfolding clause (4), we obtain the following relations. The left column shows the single subgoals. The central column gives a formal counterpart (in the sense of logical equivalence) of the corresponding clausal relation in the left column. Finally, the right column justies the deduction step on that row. EC+; H ; o `sldnf happens( e ) e 2 E by def. of E EC+; H ; o `sldnf before( e 1 ; e ) (e 1 ; e) 2 o + by lemma 4.3 EC+; H ; o `sldnf before( e ; e 2 ) (e; e 2 ) 2 o + by lemma 4.3 EC+; H ; o `sldnf initiates( e ; q ); (e 2 [qi _ by def. of [i terminates( e ; q ) e 2 hq]) and of h] EC+; H ; o `sldnf exclusive( p ; q ); (e 2]p; q[ _ by def. of ];[ p = q p = q) We can put the single pieces together in order to obtain a statement equivalent to EC+; H ; o `sldnf broken( e 1 ; p ; e 2 ): (e 1 ; e) 2 o + ^ (e; e 2 ) 2 o + ^ (e 2 [qi _ e 2 hq]) ^ (]p; q[ _ p = q): We now abstract over the event e and the property q and obtain the formula 9e 2 E: q 2 P: ((e 1 ; e) 2 o + ^ (e; e 2 ) 2 o + ^ (e 2 [qi _ e 2 hq]) ^ (]p; q[ _ p = q))

11 that is equivalent, after some logical manipulations, to nb(p; e 1 ; e 2 ; o + ). (a () Assume now that :nb(p; e 1 ; e 2 ; o + ) is valid in H, i.e. that 9e 2 E: ((e 1 ; e) 2 o + ^ (e; e 2 ) 2 o + ^ 9q 2 P: ((e 2 [qi _ e 2 hq]) ^ (]p; q[ _ p = q))): Let e 0 and q 0 be such e and q respectively. Then, by instantiation, we obtain: (e 1 ; e 0 ) 2 o + ^ (e 0 ; e 2 ) 2 o + ^ (e 0 2 [q 0 i _ e 0 2 hq 0 ]) ^ (]p; q 0 [ _ p = q 0 ): By the denition of E and since e 0 2 E, happens( e 0 ) 2 H. This implies that EC+; H ; o `sldnf happens( e 0 ) Consider the rst conjunct of the previous formula. By lemma 4.3, we have that EC+; H ; o `sldnf before( e 1 ; e 0 ) Similarly, we obtain that EC+; H ; o `sldnf before( e ; e 2 ) EC+; H ; o `sldnf initiates( e ; q ); terminates( e ; q ) EC+; H ; o `sldnf exclusive( p ; q ); p = q We have proved in this way every goal in the body of clause (4). Thus the head of this clause is valid, i.e. EC+; H ; o `sldnf broken( e 1 ; p ; e 2 ): (b )) We proceed as in (a (), with the only complication that we have to deal with negated goals. Assume that EC+; H ; o `sldnf sbroken( e 1 ; p ; e 2 ). By unfolding clause (4), we obtain the following relations: EC+; H ; o `sldnf happens( e ) e 2 E by def. of E EC+; H ; o `sldnf e n== e 1 e 6= e 1 by def. of E EC+; H ; o `sldnf e n== e 1 e 6= e 2 by def. of E EC+; H ; o `sldnf not before( e ; e 1 ) (e; e 1 ) 62 o + by lemma 4.4 EC+; H ; o `sldnf not before( e 2 ; e ) (e 2 ; e) 62 o + by lemma 4.4 EC+; H ; o `sldnf initiates( e ; q ); (e 2 [qi _ by def. of [i terminates( e ; q ) e 2 hq]) and of h] EC+; H ; o `sldnf exclusive( p ; q ); (e 2]p; q[ _ by def. of ];[ p = q p = q) As in (a )), we now consider the conjunction of the formulae displayed on the right-hand side: e 6= e 1 ^ e 6= e 2 ^ (e; e 1 ) 62 o + ^ ^ (e 2 ; e) 62 o + ^ (e 2 [qi _ e 2 hq]) ^ (]p; q[ _ p = q) By abstracting over e and q, obtain 9e 2 E: 9q 2 P: e 6= e 1 ^ e 6= e 2 ^ (e; e 1 ) 62 o + ^ (e 2 ; e) 62 o + ^ (e 2 [qi _ e 2 hq]) ^ (]p; q[ _ p = q)) that is equivalent, after some logical manipulations, to nsb(p; e 1 ; e 2 ; o + ).

12 (b () The proof follows the pattern of (a (). If :nsb(p; e 1 ; e 2 ; o + ), then there exist an event e 0 and a property p 0 such that e 0 6= e 1 ^ e 0 6= e 2 ^ (e 0 ; e 1 ) 62 o + ^ (e 2 ; e 0 ) 62 o + ^ ^ (e 0 2 [q 0 i _ e 0 2 hq 0 ]) ^ (]p; q 0 [ _ p = q 0 ): By the denition of E, happens( e 0 ) 2 H. Thus EC+; H ; o `sldnf happens( e 0 ) By considering all the conjuncts in the last formula and applying the denition of and lemma 4.4, we have that EC+; H ; o `sldnf e 0 n== e 1 EC+; H ; o `sldnf e 0 n== e 1 EC+; H ; o `sldnf not before( e 0 ; e 1 ) EC+; H ; o `sldnf not before( e 2 ; e 0 ) EC+; H ; o `sldnf initiates( e ; q ); terminates( e ; q ) EC+; H ; o `sldnf exclusive( p ; q ); p = q Therefore, the head of clause (6) is provable and we have that EC+; H ; o `sldnf sbroken( e 1 ; p ; e 2 ): 2 Lemma 4.6 (Soundness/completeness of not broken and not sbroken) Let H = (E; P; [i; h]; ];[) be an EC structure and o a state of knowledge, then a. EC+; H ; o `sldnf not broken( e 1 ; p ; e 2 ) i nb(p; e 1 ; e 2 ; o + ) holds in H; b. EC+; H ; o `sldnf not sbroken( e 1 ; p ; e 2 )i nsb(p; e 1 ; e 2 ; o + ) holds in H. Proof: (a) Given lemma 4.5, this statement can be reduced to proving that EC+; H ; o `sldnf not broken( e 1 ; p ; e 2 ) if and only if EC+; H ; o 6`sldnf broken( e 1 ; p ; e 2 ). For this purpose, we can apply the technique used in the proof of lemma 4.4. ()) Immediate from (NAF{A). (() We prove that EC+; H ; o `sldnf broken( e 1 ; p ; e 2 ) has only (possibly failed) nite computations (by property (NAF{B)). To this end, we need to examine the denition of broken in clause (4). This clause is nonrecursive and moreover its body only contains lookups to the factual knowledge, which terminate since factual knowledge is represented by atomic facts, and to before, which, from lemmas 4.3 and 4.4, has nite derivations only. (b) Similar. 2 We can now state the major result of this paper. Theorem 4.7 (Soundness/completeness of EC, SKEC and CREC w.r.t. the EC-frame semantics) Let H = (E; P; [i; h]; ];[) be an EC structure and o a state of knowledge, then

13 a. EC+; H ; o `sldnf holds(period( e 1 ; p ; e 2 )) i o + j= p(e 1 ; e 2 ); b. EC+; H ; o `sldnf sholds(period( e 1 ; p ; e 2 )) i o + j= 2p(e 1 ; e 2 ); c. EC+; H ; o `sldnf cholds(period( e 1 ; p ; e 2 )) i o + j= 3p(e 1 ; e 2 ). Proof: (a )) Let EC+; H ; o `sldnf holds(period( e 1 ; p ; e 2 )). We rst prove that, with this hypothesis, (p(e 1 ; e 2 ); o + ) = true; the thesis will follow by the denition of validity. By unfolding clause (3) we obtain the following relations: EC+; H ; o `sldnf happens( e 1 ) e 1 2 E by def. of E EC+; H ; o `sldnf initiates( e 1 ; p ) e 1 2 [pi by def. of [i EC+; H ; o `sldnf happens( e 2 ) e 2 2 E by def. of E EC+; H ; o `sldnf terminates( e 2 ; p ) e 2 2 hp] by def. of h] EC+; H ; o `sldnf before( e 1 ; e 2 ) (e 1 ; e 2 ) 2 o + by lemma 4.3 EC+; H ; o `sldnf not broken( e 1 ; p ; e 2 ) nb(p; e 1 ; e 2 ; o + ) by lemma 4.6 Now, it suces to notice that the rst ve relations on the right-hand side correspond to condition (i) of the denition of valuation and that the sixth corresponds to condition (ii). Therefore (p(e 1 ; e 2 ); o + ) = true and thus o + j= p(e 1 ; e 2 ). (a () Apply the technique used to prove the (() direction in lemma 4.5. (b )) Assume that EC+; H ; o `sldnf sholds(period( e 1 ; p ; e 2 )). We will prove that, from this hypothesis, e 1 2 [pi, e 2 2 hp], (e 1 ; e 2 ) 2 o + and nsb(p; e 1 ; e 2 ; o + ); the thesis will follow by lemma 4.1. By unfolding clause (5) we obtain the rst ve relations of case (a )) plus the following one: EC+; H ; o `sldnf not sbroken( e 1 ; p ; e 2 ) nsb(p; e 1 ; e 2 ; o + ) by lemma 4.6 (b () The same as in (a (). (c )) Assume that EC+; H ; o `sldnf cholds(period( e 1 ; p ; e 2 )). Let us prove that, with this hypothesis, e 1 2 [pi, e 2 2 hp], (e 2 ; e 1 ) 62 o + and nb(p; e 1 ; e 2 ; o + ); the thesis will follow by lemma 4.2. By unfolding clause (7) we obtain the rst four relations of case (a )) plus the following ones: EC+; H ; o `sldnf not before( e 2 ; e 1 ) (e 2 ; e 1 ) 62 o + by lemma 4.4 EC+; H ; o `sldnf not broken( e 1 ; p ; e 2 ) nb(p; e 1 ; e 2 ; o + ) by lemma 4.6 (c () The same as in (a (). 2 These results are the formal counterpart of the intuitive description of the behavior of holds, sholds and cholds presented in the previous sections. The relative cardinalities of the sets of values satisfying these predicates are related in the following corollary, which, again, agrees with our intuition. Corollary 4.8 (SKEC and CREC are a lower and an upper bound on EC)

14 Let H = (E; P; [i; h]; ];[) be an EC structure and o a state of knowledge, then a: if EC+; H ; o `sldnf sholds(period( e 1 ; p ; e 2 )) then EC+; H ; o `sldnf holds(period( e 1 ; p ; e 2 )); b: if EC+; H ; o `sldnf holds(period( e 1 ; p ; e 2 )) then EC+; H ; o `sldnf cholds(period( e 1 ; p ; e 2 )). Proof: By the previous theorem, these relations can be rewritten as: a: if o + j= 2p(e 1 ; e 2 ), then o + j= p(e 1 ; e 2 ), and b: if o + j= p(e 1 ; e 2 ), then o + j= 3p(e 1 ; e 2 ). The validity of these expressions is a direct consequence of the reexivity of the accessibility relation of EC-frames. Indeed, o + j= 2p(e 1 ; e 2 ) i p(e 1 ; e 2 ) is valid in every extension of o +, in particular in o + itself. Analogously, if o + j= p(e 1 ; e 2 ), then o + j= 3p(e 1 ; e 2 ). 2 We can restate this corollary in a form closer to the Event Calculus terminology. Let MV I EC (o), MV I SKEC (o) and MV I CREC (o) denote the sets of MVIs derivable from EC, SKEC and CREC, respectively, in a given state of knowledge o. Then MV I SKEC (o) MV I EC (o) MV I CREC (o): Corollary 4.9 (Monotonicity of SKEC and CREC) Let H = (E; P; [i; h]; ];[) be an EC structure and o and o 0 two states of knowledge such that o o 0, then a: if EC+; H ; o `sldnf sholds(period( e 1 ; p ; e 2 )), then EC+; H ; o 0 `sldnf sholds(period( e 1 ; p ; e 2 )); b: if EC+; H ; o 0 `sldnf cholds(period( e 1 ; p ; e 2 )), then EC+; H ; o `sldnf cholds(period( e 1 ; p ; e 2 )). Proof: By theorem 4.7, we can rewrite this statement as follows: given o o 0, then a: if o + j= 2p(e 1 ; e 2 ), then o 0+ j= 2p(e 1 ; e 2 ), and b: if o 0+ j= 3p(e 1 ; e 2 ), then o + j= 3p(e 1 ; e 2 ). Given the denition of EC-frame, these relations hold trivially: if o + j= 2p(e 1 ; e 2 ), then p(e 1 ; e 2 ) is valid in all the extensions of o +, which comprise all the extensions of o 0+, and thus o 0+ j= 2p(e 1 ; e 2 ); similarly, if o 0+ j= 3p(e 1 ; e 2 ) then p(e 1 ; e 2 ) holds in an extension o of o 0+, but since o o 0 and is transitive, o is an extension of o + as well, and thus o + j= 3p(e 1 ; e 2 ). 2 Again, we can restate this corollary in terms of sets of MVIs. We obtain that a: if o o 0, then MV I SKEC (o) MV I SKEC (o 0 ); b: if o o 0, then MV I CREC (o 0 ) MV I CREC (o). This corresponds to saying that SKEC is a monotonic version of EC while CREC is anti-monotonic.

15 5 Conclusions In this paper, we have studied SKEC and CREC, two extensions of Kowalski and Sergot's Event Calculus proposed in [3]. A formal description of EC is presented in propositional logic and is proved sound and complete w.r.t. the clausal formulation of the calculus. It is then shown how a simple extension of this description in a modal setting models SKEC and CREC. The interpretation of necessity-moded formulae coincides with the set of intervals derivable in SKEC. Similarly, the semantics of the possibility operators is caught by the clausal representation of CREC. A soundness and completeness result for the extended system is presented. The axiomatizability of the proposed modal formalization is currently under investigation. Acknowledgments This work has been partially supported by the P.A.O.L.A. Consortium and by the Italian National Research Council. References [1] I. Cervesato, L. Chittaro, A. Montanari: \Modal Event Calculus in Lolli", Technical Report, CMU-CS , School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October [2] I. Cervesato, A. Montanari, A. Provetti: \On the Non-Monotonic Behavior of Event Calculus for Deriving Maximal Time Intervals", in The International Journal of Interval Computations, Vol. 2, [3] L. Chittaro, A. Montanari, A. Provetti: \Skeptical and Credulous Event Calculi for Supporting Modal Queries", in Proc. ECAI'94, A. Cohn (ed.), John Wiley & Sons, [4] T. Dean, M. Boddy: \Reasoning about partially ordered events", in Articial Intelligence, Vol. 36, [5] M. Denecker, L. Missiaen, M. Bruynooghe: \Temporal reasoning with abductive Event Calculus", in Proc. ECAI'92, B. Neumann (ed.), John Wiley & Sons, [6] G. Hughes, M. Cresswell: \A Companion to Modal Logic", Methuen, London, [7] R. Kowalski: \Database Updates in the Event Calculus", in Journal of Logic Programming, Vol. 12, June [8] R. Kowalski, M. Sergot: \A Logic-based Calculus of Events", in New Generation Computing, Vol. 4, Ohmsha Ltd and Springer-Verlag, [9] J.W. Lloyd: \Foundations of Logic Programming" (second edition), Springer- Verlag, [10] D.C. Moat, G.D. Ritchie: \Modal Queries about Partially-ordered Plans", in Journal of Expt. Theor. Articial Intelligence, Vol. 2, 1990.