[1]HAO Guo-shun,MA Shi-long,SUI Yue-fei.An extended dynamic description logic language and?? its Tableau algorithm[J].CAAI Transactions on Intelligent Systems,2009,4(3):226-233.
Copy

An extended dynamic description logic language  and?? its Tableau algorithm

CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume: 4 Number of periods: 2009 3 Page number: 226-233 Column: 学术论文—人工智能基础 Public date: 2009-06-25
Title:
An extended dynamic description logic language  and?? its Tableau algorithm
Author(s):
HAO Guo-shun1; MA Shi-long1; SUI Yue-fei2
1.National Laboratory of Software Development Environment, Beihang University, Beijing 100191, China;
2.Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China
Keywords:
dynamic description logic;  modal logic;  dynamic logic;  Tableau algorithm
CLC:
TP301
DOI:
-
Abstract:
Accurate descriptions of actions in a dynamic system are essential, yet dynamic description logic languages presently available cannot meet that need because they use indivisible symbols representing atomic actions. This results in action classes and action instances being indistinguishable, with relationships between different action instances similarly inexpressible. An extended dynamic description logic language was proposed by extending the form of atomic modal operators within a parameter set. With the parameter set enabled, an atomic modal operator can represent a class of actions; by assigning concrete values to a parameter, a subclass of actions could be generated; a special subclass of actions containing only one action instance could be generated when all parameters are assigned. Hierarchy trees of actions could be developed like the concept tree. The action behaviors of the special modal operators were defined in a different manner, not merely two arbitrary possible words but those satisfying certain limitations could be reachable, and the limitations denote action behaviors. Representing actions with hierarchy trees has important meanings in action description. A sound Tableau algorithm was also provided which demonstrates the practical value of the proposed language.
References:
［1］BAADER F, CALVANESE D, MCGUINNESS D, et al. The description logic handbook: theory, implementation, and applications［M］.Cambrige,UK: Cambridge University Press, 2003.
?［2］EMERSON E A. Temporal and modal logic［M］.Van LEEUWEN J. Handbook of theoretical computer science, Volume B: formal models and sematics. Amsterdam: Elsevier and MIT Press, 1990: 9951072.
［3］GABBAY D, GUENTHER F. Handbook of philosophical logic, Volume II: extensions of classical logic［M］. Dordrecht, The Netherlands: Kluwer Academic Publishers, 1984.
［4］WOLTER F, ZAKHARYASCHEV M. Modal description logics: modalizing roles［J］. Fundamenta Informaticae, 1999, 39(4): 411438.
［5］WOLTER F, ZAKHARYASCHEV M. Dynamic description logics［J］. Advances in Modal Logic, 2000, 2: 449463.
［6］FITTING M, MENDELSOHN R L.Firstorder modal logic［M］. Norwell, USA: Kluwer Academic Publishers, 1999. 
［7］BAADER F, SATTLER U. Expressive number restrictions in description logics［J］. Journal of Logic and Computation, 1999, 9(3): 319350.
?［8］FRANCESCO M D, MAURIZIO L, DANIELE N, et al. The complexity of concept languages［J］. Information and Computation, 1997, 134(1): 158.
［9］NUTT W. Algorithms for constraints in deduction and knowledge representation［D］. Saarbrücken, Germany: University of Saarland, 1993.
Similar References:

Memo

-

Last Update: 2009-08-31

Copyright © CAAI Transactions on Intelligent Systems