phone +7 (3412) 91 60 92

Archive of Issues


Russia Izhevsk
Year
2015
Volume
25
Issue
1
Pages
117-125
<<
>>
Section Computer science
Title Systems of relational transformations: rules and realizability criterion
Author(-s) Kuchuganov M.V.a
Affiliations Udmurt State Universitya
Abstract 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, situation calculus
UDC 519.682
MSC 03B70, 68T27, 68T30
DOI 10.20537/vm150113
Received 28 February 2015
Language Russian
Citation Kuchuganov M.V. Systems of relational transformations: rules and realizability criterion, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2015, vol. 25, issue 1, pp. 117-125.
References
  1. Classen J., Lakemeyer G. A Semantics for ADL as progression in the situation calculus, Proceedings of the 11th Workshop on Nonmonotonic Reasoning, 2006, pp. 334-341.
  2. Dijkstra E.W. A discipline of programming, 1976.
  3. Fikes R., Nilsson N. STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, 1971, vol. 2, issue 3-4, pp. 189-208.
  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, 1998, vol. 2, issue 3-4, pp. 195-210.
  6. Gerevini A., Long D. BNF description of PDDL3.0, 2005. http://zeus.ing.unibs.it/ipc-5/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, pp. 324-332.
  8. Pednault E.P.D. ADL and the state-transition model of action, Journal of Logic and Computation, 1994, vol. 4, no. 5, pp. 467-512.
  9. Trofimov I.V. A languages of problem domain definitions, 2006 (in Russian). http://ai-center.botik.ru/planning/materials/03languages.htm
Full text
<< Previous article
Next article >>