Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
IEEE Intelligent Systems
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
A Dynamic Description Logic for Semantic Web Service
SKG '07 Proceedings of the Third International Conference on Semantics, Knowledge and Grid
Integrating description logics and action formalisms: first results
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Semantic Filtering for DDL-Based Service Composition
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Adopting context awareness in service composition
Proceedings of the First Asia-Pacific Symposium on Internetware
A description logic based situation calculus
Annals of Mathematics and Artificial Intelligence
Multi-granularity context model for dynamic Web service composition
Journal of Network and Computer Applications
Journal of Network and Computer Applications
Dynamic description logics based semantic web services composition
AICI'11 Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II
Foundations of instance level updates in expressive description logics
Artificial Intelligence
Hi-index | 0.00 |
We present a dynamic description logic for representation and reasoning about actions, with an approach that embrace actions into the description logic ALCO@. With this logic, description logic concepts can be used for describing the state of the world, and the preconditions and effects of atomic actions; Complex actions can be modeled with the help of standard action operators, such as the test, sequence, choice, and iteration operators; And both atomic actions and complex actions can be used as modal operators to construct formulas. We develop a terminable and correct algorithm for checking the satisfiability of formulas. Based on the algorithm, many reasoning tasks on actions are effectively carried out, including the realizability, executability, projection and planning problems.