Asset Details
Do you wish to reserve the book?
A Family of Dynamic Description Logics for Representing and Reasoning About Actions
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Family of Dynamic Description Logics for Representing and Reasoning About Actions
Do you wish to request the book?
A Family of Dynamic Description Logics for Representing and Reasoning About Actions
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
A Family of Dynamic Description Logics for Representing and Reasoning About Actions
2012
Overview
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 logics
DDL
(
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.
Publisher
Springer Netherlands,Springer Nature B.V
