Attributive concept descriptions with complements
Artificial Intelligence
Artificial Intelligence
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Simulation, verification and automated composition of web services
Proceedings of the 11th international conference on World Wide Web
IEEE Intelligent Systems
A Road-Map on Complexity for Hybrid Logics
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
PDL-based framework for reasoning about actions
AI*IA '95 Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence
Tableaux and Algorithms for Propositional Dynamic Logic with Converse
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Complexity of Two-Variable Logic with Counting
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Two-variable logic with counting is decidable
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A practical decision method for propositional dynamic logic (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Bringing Semantics to Web Services with OWL-S
World Wide Web
A Tableau Decision Procedure for $\mathcal{SHOIQ}$
Journal of Automated Reasoning
Integrating Action Calculi and Description Logics
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Integrating description logics and action formalisms: first results
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
A temporal description logic for reasoning about actions and plans
Journal of Artificial Intelligence Research
Decidable reasoning in a modified situation calculus
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Complexity of planning in action formalisms based on description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Reasoning about actions using description logics with general TBoxes
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Mining frequent agent action patterns for effective multi-agent-based web service composition
ADMI'11 Proceedings of the 7th international conference on Agents and Data Mining Interaction
Hi-index | 0.00 |
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.