Notes on Oct. 13, 2003 Class: Reasoning about Action and Change, Study notes of Computer Science

Download Notes on Oct. 13, 2003 Class: Reasoning about Action and Change and more Study notes Computer Science in PDF only on Docsity! Notes from class of Oct. 13, 2003 Written by Thomas Styles Dr. Baral began the class by speaking with students individually about their projects. The domain D has rules of the form D : a causes f if p1, p2, …pn, ~q1, ~q2, …~qm The observations O have the form O : initially f The queries have the form f after a1, a2, … an Define a transition function  : state x action  state. 0 is initial state. The problem is to define the conditions under which the query is true. We proceed as follows. Define the transition function as follows. Note that P is the set of fluents added by positive effect propositions, while N is the set of fluents subtracted by negative effect propositions. (, a) = ( u P) – N if P and N are disjoint P = {f : “a causes f if p1, p2, …pn, ~q1, ~q2, …~qm” is in D, p1, p2, …pn are in , none of q1, q2, …qm are in } N = {f : “a causes ~f if p1, p2, …pn, ~q1, ~q2, …~qm” is in D, p1, p2, …pn are in , none of q1, q2, …qm are in } 0 is initial state for (D, O) if: (i) for each “initially f” in O, f is in 0 and (ii) for each “initially ~f” in O, f is not in 0 (D, O) entails “f after after a1, a2, … an” iff for all initial states 0 of (D, O), f is true in (a1), a2,… an). Assume the observation set O is complete. We make the closed world assumption. We want to convert the following to AnsProlog.