محبوبترین نویسندگان :
نویسندگان مقالات پربازدید :
مجله استدلال خودکار 2013
جزئیات رویداد
اینستاگرام تی پی بین
همایش ، رویداد ، ژورنال

  • a family of dynamic description logics for representing and reasoning about actions

    نویسندگان :
    کلمات کلیدی :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 1069
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     description logics provide powerful languages for representing and reasoning about knowledge of static application domains. the main strength of description logics is that they offer considerable expressive power going far beyond propositional logic, while reasoning is still decidable. there is a demand to bring the power and character of description logics into the description and reasoning of dynamic application domains which are characterized by actions. in this paper, based on a combination of the propositional dynamic logic pdl, a family of description logics and an action formalism constructed over description logics, we propose a family of dynamic description logicsddl(x @) for representing and reasoning about actions, where x represents well-studied description logics ranging from the  to the  , and x @ denotes the extension of x with the @ constructor. the representation power of ddl(x @) is reflected in four aspects. firstly, the static knowledge of application domains is represented as rboxes and acyclic tboxes of the description logic x. secondly, the states of the world and the pre-conditions of atomic actions are described by abox assertions of the description logic x @, and the post-conditions of atomic actions are described by primitive literals of x @. thirdly, starting with atomic actions and abox assertions of x@, complex actions are constructed with regular program constructors of pdl, so that various control structures on actions such as the “sequence”, “choice”, “any-order”, “iterate”, “if-then-else”, “repeat-while” and “repeat-until” can be represented. finally, both atomic actions and complex actions are used as modal operators for the construction of formulas, so that many properties on actions can be explicitly stated by formulas. a tableau-algorithm is provided for deciding the satisfiability of ddl(x @)-formulas; based on this algorithm, reasoning tasks such as the realizability, executability and projection of actions can be effectively carried out. as a result, ddl(x@) not only offers considerable expressive power going beyond many action formalisms which are propositional, but also provides decidable reasoning services for actions described by it.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها