DCPP: Knowledge Representation for Planning Processes

  • Takushi Tanaka
  • Koki Tanaka
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3214)

Abstract

We have developed a language called DCPP (Definite Clauses for Planning Processes) to represent knowledge concerning situations changing due to a process. The knowledge coded by DCPP is translated into definite clauses and forms a logic program that simulates the situation changes. Since data flows are bilateral in logic programming, the program works not only as a symbolic simulator for changing situations, but also as a planner for generating a process to achieve the required situation. As an example of knowledge encoding, we will show the start-up process for an electric power plant.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intell. 2, 189–208 (1971)MATHCrossRefGoogle Scholar
  2. 2.
    Levesque, H., Reiter, R., Lesperance, Y., Lin, F., Scherl, R.B.: GOLOG: A Logic Programming Language for Dynamic Domains. J. Logic Programming 31, 59–84 (1997)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence 4, pp. 463–502. Edinburgh Univ. Press (1969)Google Scholar
  4. 4.
    McDermott, D.: The Current State of AI Planning Research. In: Proc. The Ninth International Conf. of Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, pp. 25–34. Gordon and Breach Pub. (1996)Google Scholar
  5. 5.
    Pereira, F.C.N., Warren, D.H.D.: Definite Clause Grammars for Language Analysis. Artificial Intell. 13, 231–278 (1980)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Tanaka, T.: Definite Clause Set Grammars: A Formalism for Problem Solving. J. Logic Programming 10, 1–17 (1991)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Tanaka, T.: Parsing Circuit Topology in A Logic Grammar. IEEE-Trans. Knowledge and Data Eng. 5(2), 225–239 (1993)CrossRefGoogle Scholar
  8. 8.
    Tanaka, T., Bartenstein, O.: DCSG-Converters in Yacc/Lex and Prolog. In: Proc. 12th International Conference on Applications of Prolog, pp. 44–49 (1999)Google Scholar
  9. 9.
    Tanaka, T.: Knowledge Representation for Structure and Function of Electronic Circuits. In: Proc. 7th International Conference, KES 2003, pp. 707–714 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Takushi Tanaka
    • 1
  • Koki Tanaka
    • 2
  1. 1.Department of Computer Science and EngineeringFukuoka Institute of TechnologyFukuokaJapan
  2. 2.Community Technology Research Co. Ltd.FukuokaJapan

Personalised recommendations