Title: Automaton-Descriptions and Theorem-Proving: A Marriage made in Heaven?
Authors: Maria Aretoulaki and Bernd Ludwig
Series: Linkping Electronic Articles in Computer and Information Science
ISSN 1401-9841
Issue: Vol. 4 (1999), No. 022
URL: http://www.ep.liu.se/ea/cis/1999/022/

Abstract: In this paper, Finite-State-Automata (FSA) and theorem-proving approaches to spoken dialogue systems (SLDS) are contrasted to each other. FSA are too rigid to deal with unpredictable user reactions, such as corrections or counter-questions, whereas plan-based approaches are usually too complex to be effectively used, given the unreliability of word recognition and the elliptical and unconventional nature of spontaneous speech. As an alternative, a Dialogue Manager architecture is proposed which uses knowledge on both the possible sequences of dialogue acts and the dynamic representation of the task and requirements for its fulfillment. The behaviour of the specific user is taken into consideration, including their expectations about the system and the service offered, as are instances of miscommunication and disagreement in the course of the dialogue, and the successful completion of sub-plans relevant to the task and the dialogue flow.

Original publication 1999-12-30 Postscript part I -- Checksum
Checksum (old) Information about recalculation of checksum
Postscript part II -- Checksum II
Checksum II (old) Information about recalculation of checksum