D. Zhang and N. Y. Foo, `EPDL: A logic for causal reasoning', in Proc. 17th Int. Joint Conf. on Artificial Intelligence (IJCAI'01), ed., B. Nebel, pp. 131--138, Seattle, (2001). Morgan Kaufmann Publishers.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....relation [ 15 ] Lin s Caused predicate [ 10 ] and McCain and Turner s causal laws [ 12 ] However, as pointed out in [ 2 ] there are some subtleties that cannot be captured by these approaches without stating non change information in the domain description. More recently, Zhang and Foo [ 16 ] have proposed a base logic similar to ours and have de ned causality in terms of modal operators. But they fail to derive implicit quali cations. We propose a new dependence relation that does not oblige us to write down any kind of non change statement. We do this by adding a parameter to each ....

Dongmo Zhang and Norman Y. Foo. EPDL: A logic for causal reasoning. In Proceedings of the IJCAI'2001, pages 131-138, 2001. 12

....expression of compound actions (i.e. generated from primitive actions by the program connectives ; non deterministic e ects and quali cations of actions. It has also been extended to represent concurrent actions [24, 11] non execution of actions [9] indirect e ects of actions [12, 29]. Second, dynamic logic features a sound and complete axiomatic deductive system and a well developed Kripkean semantics. Its proof and model theory have reached a high degree of sophistication through the development of theoretical computer science. Some features, such as decidability and the ....

....loaded is true, Shoot must cause :alive. In the situation calculus this is written as 8s(loaded(s) alive(do(Shoot; s) instead of loaded(s) alive(do(Shoot; s) for some particular situation s. However, we cannot quantify over situations or actions in dynamic logic. A simple approach in [29] is to treat an action description as a set of extra axioms of PDL. De nition 1 [29] An action description is a set of formulas. A formula A is provable, written A, if it belongs to the smallest set of formulas which contains all theorems of PDL all elements of ; and is closed under ....

[Article contains additional citation context not shown here]

D. Zhang and N. Foo, EPDL: a logic for causal reasoning, In University of New South Wales, Technical Report, UNSW-TR-0006, available at: http:// www.cse.unsw.edu.au/school/research/tr.html. 12

No context found.

D. Zhang and N. Foo, EPDL: a logic for causal reasoning, IJCAI-01, 131-136, 2001.

....and filtration, are well understood. Within Artificial Intelligence, dynamic logic has been used to investigate computational properties of formalisms such as features logics, description logics and conditional logics. With this in mind, we exploit an extended propositional dynamic logic, EPDL [27]. This system offers a unified treatment of reasoning about direct and indirect effects of actions, thus enabling a representation of action effects and causal ramifications. We introduce techniques for consistency analysis of action descriptions in EPDL frameworks. Three different levels of ....

....for a measure of ramification. Addressing the issue of consistency of action descriptions provides an alternative approach to thinking about classical problems in reasoning about action. 2 EPDL Preliminaries We summarize some basic facts of the extended propositional dynamic logic (EPDL) see [27] for more details) In propositional dynamic logic (PDL) a causal relation between an action # (primitive or compound) and a property A is expressed by the modal formula: #]A, meaning # (always) causes A if # is feasible . For example, T urn off ]light says that turning off the switch causes ....

[Article contains additional citation context not shown here]

D. Zhang and N. Foo, EPDL: a logic for causal reasoning, Proceedings of IJCAI-01, 131136, 2001.

....[ any] loaded [Shoot] alive; such a modality is an S 5 modality. Introducing the any modality formally would involve adding all S 5 axioms and an extra axiom ( any]A [ A) However, rather than introducing extra modalities which would make the system more cumbersome, we use the techniques of [25], in which an action description is treated as a set of axioms. These then function much like domain axioms do in the situation calculus. This lets us de ne the notion of provability. De nition 1 Let be an action description. A formula A is a theorem, denoted A if it belongs to the ....

D. Zhang and N. Foo. EPDL: A logic for causal reasoning. UNSW Technical Report CSETR -0006. 10

....built in expression of compound actions (i.e. generated from primitive actions by the program connectives ; non deterministic e ects and quali cations of actions. It has also been extended to represent concurrent actions [10] non execution of actions [8] indirect e ects of actions [11, 26]. Second, dynamic logic features a sound and complete axiomatic deductive system and a well developed Kripkean semantics. Its proof and model theory have reached a high degree of sophistication through the development of theoretical computer science. Some features, such as decidability and the ....

....states that whenever loaded is true, Shoot must cause :alive. In the situation calculus this is written as 8s(loaded(s) alive(do(Shoot; s) instead of loaded(s) alive(do(Shoot; s) for some particular situation s. A simple approach to the problem in dynamic logic, which was introduced in [26], is to treat an action description as a set of extra axioms of PDL. De nition 1 [26] An action description is a set of formulas. A formula A is provable, written A, if it belongs to the smallest set of formulas which contains all theorems of PDL all elements of ; and is closed under ....

[Article contains additional citation context not shown here]

D. Zhang and N. Foo, EPDL: a logic for causal reasoning, to appear in Proceedings of IJCAI-01.

No context found.

D. Zhang and N. Y. Foo, `EPDL: A logic for causal reasoning', in Proc. 17th Int. Joint Conf. on Artificial Intelligence (IJCAI'01), ed., B. Nebel, pp. 131--138, Seattle, (2001). Morgan Kaufmann Publishers.

No context found.

ZHANG D., FOO N. Y., "EPDL: A Logic for Causal Reasoning", Proc. of IJCAI '

No context found.

D. Zhang and N. Y. Foo. EPDL: A logic for causal reasoning. In B. Nebel, editor, Proc. 17th Int. Joint Conf. on Artificial Intelligence (IJCAI'01), pages 131--138, Seattle, 2001. Morgan Kaufmann Publishers. 9

No context found.

D. Zhang and N. Y. Foo. EPDL: A logic for causal reasoning. In B. Nebel, editor, Proc. 17th Int. Joint Conf. on Arti cial Intelligence (IJCAI'01), pages 131-138, Seattle, 2001. Morgan Kaufmann Publishers. 22

No context found.

D. Zhang and N. Y. Foo. EPDL: A logic for causal reasoning. In B. Nebel, editor, Proc. 17th Int. Joint Conf. on Artificial Intelligence (IJCAI'01), pages 131--138, Seattle, 2001. Morgan Kaufmann Publishers. 23

No context found.

Zhang, D., and Foo, N. Y. 2001. EPDL: A logic for causal reasoning. In Proc. IJCAI'01, 131--138. Seattle: Morgan Kaufmann.

No context found.

Dongmo Zhang and Norman Y. Foo. EPDL: A logic for causal reasoning. In Proc. of IJCAI'2001.

No context found.

Zhang, D., and Foo, N. Y. 2001. EPDL: A logic for causal reasoning. In Proc. IJCAI'01, 131--138. Morgan Kaufmann. Zhang, D.; Chopra, S.; and Foo, N. Y. 2002. Consistency of action descriptions. In PRICAI'02, Topics in Artificial Intelligence. Springer-Verlag.

No context found.

Zhang, D., and Foo, N. Y. 2001. EPDL: A logic for causal reasoning. In Nebel, B., ed., Proc. 17th Int. Joint Conf. on Artificial Intelligence (IJCAI'01), 131--138. Seattle: Morgan Kaufmann Publishers.

No context found.

Dongmo Zhang and Norman Y. Foo. EPDL: A logic for causal reasoning. In Proc. IJCAI'2001.

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