Geodesic
Systems of relational transformations: rules and realizability criterion
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 25 (2015) no. 1, pp. 117-125
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The paper describes and investigates basic constructions and semantics of an action description language developed to analyze transformations of relations between situation models (relational transformations). The main difference between KSL (Knowledge Specification Language) and traditional languages (STRIPS, ADL, PDDL, etc.) is the exploitation of not only traditional (STRIPS-like) rules but also their set-theoretic compositions. This greatly increases the expressiveness of a language. A clear first order logic characterization of relational transformations (without using additional constructions of a situation calculus) makes it possible to formulate and prove a natural criterion of realizability (consistency) of the system of relational transformations and, consequently, to describe and fix the logical contradictions of the given system.
Keywords: action description languages, STRIPS, ADL
Mots-clés : situation calculus. 
@article{VUU_2015_25_1_a12,
     author = {M. V. Kuchuganov},
     title = {Systems of relational transformations: rules and realizability criterion},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {117--125},
     year = {2015},
     volume = {25},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2015_25_1_a12/}
}
TY  - JOUR
AU  - M. V. Kuchuganov
TI  - Systems of relational transformations: rules and realizability criterion
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2015
SP  - 117
EP  - 125
VL  - 25
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VUU_2015_25_1_a12/
LA  - ru
ID  - VUU_2015_25_1_a12
ER  - 
%0 Journal Article
%A M. V. Kuchuganov
%T Systems of relational transformations: rules and realizability criterion
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2015
%P 117-125
%V 25
%N 1
%U http://geodesic.mathdoc.fr/item/VUU_2015_25_1_a12/
%G ru
%F VUU_2015_25_1_a12
M. V. Kuchuganov. Systems of relational transformations: rules and realizability criterion. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 25 (2015) no. 1, pp. 117-125. http://geodesic.mathdoc.fr/item/VUU_2015_25_1_a12/

[1] Classen J., Lakemeyer G., “A Semantics for ADL as progression in the situation calculus”, Proceedings of the 11th Workshop on Nonmonotonic Reasoning, 2006, 334–341

[2] Dijkstra E. W., A discipline of programming, 1976 | MR

[3] Fikes R., Nilsson N., “STRIPS: A new approach to the application of theorem proving to problem solving”, Artificial Intelligence, 2:3–4 (1971), 189–208 | DOI | Zbl

[4] Ghallab M., Howe A., Knoblock C., McDermott D., Ram A., Veloso M., Weld D., Wilkins D., PDDL – the planning domain definition language, , 1998 ftp://ftp.cs.yale.edu/pub/mcdermott/software/pddl.tar.gz

[5] Gelfond M., Lifschitz V., “Action languages”, Electronic Transactions on Artificial Intelligence, 2:3–4 (1998), 195–210 | MR

[6] Gerevini A., Long D., BNF description of PDDL 3.0, , 2005 http://www.cs.yale.edu/homes/dvm/papers/pddl-bnf.pdf

[7] Pednault E. P. D., “ADL: Exploring the middle ground between STRIPS and the situation calculus”, Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89), Toronto, Canada, 1989, 324–332 | MR

[8] Pednault E. P. D., “ADL and the state-transition model of action”, Journal of Logic and Computation, 4:5 (1994), 467–512 | DOI | MR | Zbl

[9] Trofimov I. V., Yazyki opisaniya domenov i zadach planirovaniya, , 2006 http://ai-center.botik.ru/planning/materials/03languages.htm