Skip to main content
SpringerLink
Log in

Plan inferences in dialogue under Dynamical Constraint Programming

  • Special Feature
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Flexible dialogues involve various inferences on plans. Inferring an agent’s intentions can be regarded as reasoning from both utterances and behavior. Since plan generation and plan recognition involve various inference patterns, which encompass both deduction and abduction, reasoning control raises various problems. To implement control of inferences on plans in a domain-independent fashion, we employ a computational architecture called Dynamical Constraint Programming. Dynamical Constraint Programming accounts for the semantics of first-order clausal programs in terms of dynamics, with potential energy and field of force, from which various heuristics for control of inferences emerge on the basis of the energy minimization principle. We introduce a computational treatment of verbal communication and account for both plan inference and generation in a dialogue.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agre, P. E. and Chapman, D., “Pengi: An Implementation of a Theory of Activity,” inProceedings of AAAI’ 87 pp. 268–272, 1987.

  2. Appelt, D. E. and Konolige, K., “A Nomonotonic Logic for Reasoning about Speech Acts and Belief Revision,” inProceedings of International Workshop on Nonmonotonic Reasoning, pp. 164–175, 1988.

  3. Carberry, S.,Plan Recognition in Natural Language Dialogue, MIT Press, 1990.

  4. Hasida, K., “Dynamics of Symbol Systems,”New Generation Computing, 12, 3, pp. 285–310, 1994.

    Article  MATH  Google Scholar 

  5. Hasida, K. “Emergent Parsing and Generation with Generalized Chart,” inProceedings of the Fifteenth International Conference on Computational Linguistics, 1994.

  6. Hasida, K., Nagao, K., and Miyata, T., “Joint Utterance: Intrasentential Speaker/ Hearer Switch as an Emergent Phenomenon,” inProceedings of IJCAI’93, pp. 1193–1199, 1993.

  7. Hobbs, J. R., Stickel, M., Martin, P., and Edwards, D., “Interpretation as Abduction,” inProceedings of the Twenty-Sixth Annual Meeting of the Association for Computational Linguistics, pp. 95–103, 1988.

  8. Nagao, K., Hasida, K., and Miyata, T., “Understanding Spoken Natural Language with Omni-Directional Information Flow,” inProceedings of IJCAI’93, pp. 1268–1274, 1993.

  9. Norvig, P., “Marker Passing as a Weak Method for Text Inferencing,”Cognitive Science, 13, pp. 569–620, 1989.

    Article  Google Scholar 

  10. Pearl, J.,Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, Los Altos, CA, 1988.

    Google Scholar 

  11. Pereira, F. C. N. and Warren, D. H. D., “Parsing as Deduction,” inProceedings of the 21st Annual Meeting of ACL, pp. 137–144, 1983.

  12. Perrault, C. R. and Allen, J. F., “A Plan-Based Analysis of Indirect Speech Acts,”American Journal of Computational Linguistics (ACL), 6, 3-4, pp. 167–182, July-December 1980.

    Google Scholar 

  13. Shabes, Y., “Stochastic Lexicalized Tree-Adjoining Grammars,” inProceedings of the Fourteenth International Conference on Computational Linguistics (C. Boitet, ed.), pp. 426–432, Nantes, 1992.

  14. Wright, J. H. and Wrigley, E. N., “GLR Parsing with Probability,” inGeneralized LR Parsing (M. Tomita, ed.), Kluwer Academic Publishers, 1991.

  15. Xuang, X., Ariki, Y., and Jack, M. A.,Hidden Markov Models for Speech Recognition, Edinburgh University Press, 1990.

Download references

Author information

Authors and Affiliations

  1. University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113, Tokyo, Japan

    Takashi Miyata

  2. Electrotechnical Laboratory, 1-1-4 Umezono, 305, Tukuba, Japan

    Kôiti Hasida

Authors
  1. Takashi Miyata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kôiti Hasida
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Takashi Miyata: He is currently a graduate student in doctoral program of Department of Information Science, The University of Tokyo. He received the B. S. and the M. S. degrees from the University of Tokyo in 1991 and 1993, respectively. His research interests encompass natural language processing in general, and in particular mechanism and framework of discourse understanding and their implementation on computers.

Kôiti Hasida: He received the D. S. degree from the University of Tokyo in 1986. He has been affiliated with Electrotechnical Laboratory since 1986, and also with Institute of New Generation Computer Technology (ICOT) for 4 years from 1988. His research interest includes linguistic theories, natural language processing, intelligent agent architecture, multi-agent cooperation/communication, cognitive modeling, and so forth.

About this article

Cite this article

Miyata, T., Hasida, K. Plan inferences in dialogue under Dynamical Constraint Programming. New Gener Comput 14, 111–129 (1996). https://doi.org/10.1007/BF03037496

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037496

Keywords

Search

Navigation