Modality in dialogue: planning, pragmatics and computation

Natural language generation (NLG) is first and foremost a reasoning task. In this reasoning, a system plans a communicative act that will signal key facts about the domain to the hearer. In generating action descriptions, this reasoning draws on characterizations both of the causal properties of the domain and the states of knowledge of the participants in the conversation. This dissertation shows how such characterizations can be specified declaratively and accessed efficiently in NLG. The heart of this dissertation is a study of logical statements about knowledge and action in modal logic. By investigating the proof-theory of modal logic from a logic programming point of view, I show how many kinds of modal statements can be seen as straightforward instructions for computationally manageable search, just as Prolog clauses can. These modal statements provide sufficient expressive resources for an NLG system to represent the effects of actions in the world or to model an addressee whose knowledge in some respects exceeds and in other respects falls short of its own. To illustrate the use of such statements, I describe how the SPUD sentence planner exploits a modal knowledge base to assess the interpretation of a sentence as it is constructed incrementally.

[1]  S. A. Sherman,et al.  Providence , 1906 .

[2]  N. Malcolm On Knowledge and Belief , 1954 .

[3]  Günter Asser,et al.  Zeitschrift für mathematische Logik und Grundlagen der Mathematik , 1955 .

[4]  Kazuo Matsumoto,et al.  Gentzen method in modal calculi. II , 1957 .

[5]  J. Davenport Editor , 1960 .

[6]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[7]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[8]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[9]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[10]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[11]  J. Hintikka Semantics for Propositional Attitudes , 1969 .

[12]  R. Kirk CONVENTION: A PHILOSOPHICAL STUDY , 1970 .

[13]  David Lewis Convention: A Philosophical Study , 1986 .

[14]  A. Goldman Theory of Human Action , 1970 .

[15]  James Wong COMPUTER SCIENCE DEPARTMENT , 1971 .

[16]  Melvin Fitting,et al.  Tableau methods of proof for modal logics , 1972, Notre Dame J. Formal Log..

[17]  Raymond M. Smullyan,et al.  A Generalization of Intuitionistic and Modal Logics , 1973 .

[18]  Jeffrey D. Ullman,et al.  Set Merging Algorithms , 1973, SIAM J. Comput..

[19]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[20]  Earl D. Sacerdoti,et al.  The Nonlinear Nature of Plans , 1975, IJCAI.

[21]  Aravind K. Joshi,et al.  Tree Adjunct Grammars , 1975, J. Comput. Syst. Sci..

[22]  Krister Segerberg,et al.  An Introduction to Modal Logic , 1977 .

[23]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[24]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Brian F. Chellas Modal Logic: Normal systems of modal logic , 1980 .

[27]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[28]  Herbert H. Clark,et al.  Definite reference and mutual knowledge In Aravind K. Joshi, Bonnie L. Webber, and Ivan A. Sag, editors , 1981 .

[29]  Peter B. Andrews Theorem Proving via General Matings , 1981, JACM.

[30]  Ellen F. Prince,et al.  Toward a taxonomy of given-new information , 1981 .

[31]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[32]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[33]  Irene Heim,et al.  The semantics of definite and indefinite noun phrases : a dissertation , 1982 .

[34]  Robert C. Moore Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[35]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[36]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[37]  James F. Allen Maintaining knowledge about temporal intervals , 1983, CACM.

[38]  Robert C. Moore A Formal Theory of Knowledge and Action , 1984 .

[39]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[40]  Joseph Y. Halpern,et al.  A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft , 1985, IJCAI.

[41]  Jerry R. Hobbs Ontological Promiscuity , 1985, ACL.

[42]  Alan K. Mackworth Constraint Satisfaction , 1985 .

[43]  Candace L. Sidner,et al.  Attention, Intentions, and the Structure of Discourse , 1986, CL.

[44]  Editors , 1986, Brain Research Bulletin.

[45]  Journal of automated reasoning , 1986 .

[46]  Paliath Narendran,et al.  NP-Completeness of the Set Unification and Matching Problems , 1986, CADE.

[47]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

[48]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[49]  Leora Morgenstern,et al.  Knowledge Preconditions for Actions and Plans , 1988, IJCAI.

[50]  V. Lifschitz Formal theories of action , 1987 .

[51]  John McCarthy,et al.  Generality in artificial intelligence , 1987, Resonance.

[52]  Aravind K. Joshi,et al.  The Relevance of Tree Adjoining Grammar to Generation , 1987 .

[53]  Peter Jackson,et al.  A General Proof Method for First-Order Modal Logic , 1987, IJCAI.

[54]  Michael E. Bratman,et al.  Intention, Plans, and Practical Reason , 1991 .

[55]  Jerry R. Hobbs,et al.  Interpretation as Abduction , 1988, ACL.

[56]  Mark Steedman,et al.  Temporal Ontology and Temporal Reference , 1988, CL.

[57]  Douglas E. Appelt,et al.  Planning English Sentences , 1988, Cogn. Sci..

[58]  K. Jon Barwise,et al.  Three Views of Common Knowledge , 1988, TARK.

[59]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[60]  R. Lathe Phd by thesis , 1988, Nature.

[61]  Kurt Konolige,et al.  Defeasible Argumentation in Reasoning About Events , 1988, ISMIS.

[62]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[63]  Roger C. Schank,et al.  SCRIPTS, PLANS, GOALS, AND UNDERSTANDING , 1988 .

[64]  David J. Israel,et al.  Plans and resource‐bounded practical reasoning , 1988, Comput. Intell..

[65]  Kave Eshghi,et al.  Abductive Planning with Event Calculus , 1988, ICLP/SLP.

[66]  Michael A. McRobbie,et al.  Automated theorem proving for non-classical logics , 1988, Research Notes in Theoretical Computer Science.

[67]  Robert Dale,et al.  Generating referring expressions in a domain of objects and processes (language representation) , 1988 .

[68]  Fangzhen Lin,et al.  Argument Systems: A Uniform Basis for Nonmonotonic Reasoning , 1989, KR.

[69]  Patrice Enjalbert,et al.  Modal Theorem Proving: An Equational Viewpoint , 1989, IJCAI.

[70]  Patrick J. Hayes,et al.  Moments and points in an interval‐based temporal logic , 1989, Comput. Intell..

[71]  Dale Miller,et al.  A Logical Analysis of Modules in Logic Programming , 1989, J. Log. Program..

[72]  Murray Shanahan,et al.  Prediction is Deduction but Explanation is Abduction , 1989, IJCAI.

[73]  Lenhart K. Schubert Monotonic Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds wi , 1990 .

[74]  Lincoln A. Wallen,et al.  Automated proof search in non-classical logics - efficient matrix proof methods for modal and intuitionistic logics , 1990, MIT Press series in artificial intelligence.

[75]  Gertjan van Noord,et al.  Semantic-Head-Driven Generation , 1990, Comput. Linguistics.

[76]  Max I. Kanovich Efficient Program Synthesis in Computational Models , 1990, J. Log. Program..

[77]  Ramanathan V. Guha,et al.  CYC: A Midterm Report , 1990, AI Mag..

[78]  Qiang Yang,et al.  Formalizing planning knowledge for hierarchical planning , 1990, Comput. Intell..

[79]  Jeroen Groenendijk,et al.  Dynamic Montague grammar , 1990 .

[80]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[81]  Fangzhen Lin,et al.  Provably Correct Theories of Action (Preliminary Report) , 1991, AAAI.

[82]  Y. Wilks,et al.  Belief Ascription, Metaphor, and Intensional Identification , 1991, Cogn. Sci..

[83]  Vladimir Lifschitz,et al.  Artificial intelligence and mathematical theory of computation: papers in honor of John McCarthy , 1991 .

[84]  M. Meteer Bridging the generation gap between text planning and linguistic realization , 1991 .

[85]  David W. Reed,et al.  The Near-Horn Approach to Disjunctive Logic Programming , 1991, ELP.

[86]  R. Dale,et al.  Content determination in the generation of referring expressions , 1991 .

[87]  Hans Jürgen Ohlbach,et al.  Semantics-Based Translation Methods for Modal Logics , 1991, J. Log. Comput..

[88]  Gopalan Nadathur,et al.  Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..

[89]  Richard B. Scherl,et al.  A General Framework for Modal Deduction , 1991, KR.

[90]  Alan M. Frisch The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning , 1991, Artif. Intell..

[91]  Jeroen Groenendijk,et al.  Dynamic predicate logic , 1991 .

[92]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[93]  Kathleen F. McCoy,et al.  From functional specification to syntactic structures: systemic grammar and tree adjoining grammar , 1991 .

[94]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[95]  Martha E. Pollack,et al.  Overloading Intentions for Efficient Practical Reasoning , 1991 .

[96]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[97]  Yoav Shoham,et al.  Varieties of Context , 1991, Artificial and Mathematical Theory of Computation.

[98]  John L. Pollock,et al.  How to Reason Defeasibly , 1992, Artif. Intell..

[99]  Rob A. van der Sandt,et al.  Presupposition Projection as Anaphora Resolution , 1992, J. Semant..

[100]  Owen Rambow,et al.  Applied Text Generation , 1992, ANLP.

[101]  Seif Haridi,et al.  An Intuitionistic Predicate Logic Theorem Prover , 1989, J. Log. Comput..

[102]  Roy Dyckhoff,et al.  Contraction-free sequent calculi for intuitionistic logic , 1992, Journal of Symbolic Logic.

[103]  Martha E. Pollack,et al.  The Uses of Plans , 1992, Artif. Intell..

[104]  Guillermo Ricardo Simari,et al.  A Mathematical Treatment of Defeasible Reasoning and its Implementation , 1992, Artif. Intell..

[105]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[106]  Matthew Stone,et al.  'Or' and Anaphora , 1992 .

[107]  Patrice Enjalbert,et al.  Multimodal Logic Programming Using Equational and Order-Sorted Logic , 1992, Theor. Comput. Sci..

[108]  Oren Etzioni,et al.  An Approach to Planning with Incomplete Information , 1992, KR.

[109]  Robert A. Kowalski,et al.  Database Updates in the Event Calculus , 1992, J. Log. Program..

[110]  Marcello D'Agostino,et al.  Are tableaux an improvement on truth-tables? , 1992, J. Log. Lang. Inf..

[111]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[112]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..

[113]  Jerry R. Hobbs,et al.  Interpretation as Abduction , 1993, Artif. Intell..

[114]  John McCarthy,et al.  Notes on Formalizing Context , 1993, IJCAI.

[115]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming , 1993, IJCAI.

[116]  Wolfgang Bibel,et al.  Deduction - automated logic , 1993 .

[117]  Laura Giordano,et al.  A Multimodal Logic to Define Modules in Logic Programming , 1993, ILPS.

[118]  Jean Gallier,et al.  Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi , 1993, Theor. Comput. Sci..

[119]  Chitta Baral,et al.  Representing Concurrent Actions in Extended Logic Programming , 1993, IJCAI.

[120]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[121]  Alan W. Biermann,et al.  Efficient Collaborative Discourse: A Theory and Its Implementation , 1993, HLT.

[122]  Hans Jürgen Ohlbach,et al.  Optimized Translation of Multi Modal Logic into Predicate Logic , 1993, LPAR.

[123]  Marilyn A. Walker,et al.  Informational redundancy and resource bounds in dialogue , 1993 .

[124]  Uwe Reyle,et al.  From Discourse to Logic - Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory , 1993, Studies in linguistics and philosophy.

[125]  Hector J. Levesque,et al.  The Frame Problem and Knowledge-Producing Actions , 1993, AAAI.

[126]  Matthew Stone,et al.  Modeling the Interaction between Speech and Gesture. , 1994 .

[127]  Mark Steedman,et al.  Animated conversation: rule-based generation of facial expression, gesture & spoken intonation for multiple conversational agents , 1994, SIGGRAPH.

[128]  Dale Miller,et al.  Logic Programming in a Fragment of Intuitionistic Linear Logic , 1994, Inf. Comput..

[129]  Johanna D. Moore,et al.  Decomposition and Causality in Partial-order Planning , 1994, AIPS.

[130]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[131]  Erik Sandewall,et al.  The Range of Applicability of Some Non-monotonic Logics for Strict Inertia , 1994, J. Log. Comput..

[132]  Anthony Barrett,et al.  Task-Decomposition via Plan Parsing , 1994, AAAI.

[133]  Nigel G. Ward A connectionist language generator , 1994, Ablex series in artificial intelligence.

[134]  James F. Allen,et al.  Arguing about Plans: Plan Representation and Reasoning for Mixed-initiative Planning , 1994, AIPS.

[135]  J. McCarthy,et al.  Formalizing Context (Expanded Notes) , 1994 .

[136]  James F. Allen,et al.  Actions and Events in Interval Temporal Logic , 1994 .

[137]  Natarajan Shankar,et al.  Proof search in first-order linear logic and other cut-free sequent calculi , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[138]  Manuela M. Veloso,et al.  Planning and Learning by Analogical Reasoning , 1994, Lecture Notes in Computer Science.

[139]  Dale Miller,et al.  A multiple-conclusion meta-logic , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[140]  Jana Koehler,et al.  Avoiding Pitfalls in Case-based Planning , 1994, AIPS.

[141]  Erik Sandewall Features and fluents : representation of knowledge about dynamical systems , 1994 .

[142]  Ernest Davis,et al.  Knowledge Preconditions for Plans , 1993, J. Log. Comput..

[143]  Laura Giordano,et al.  Structuring Logic Programs: A Modal Approach , 1994, J. Log. Program..

[144]  John Levine,et al.  Automatic generation of technical documentation , 1994, Appl. Artif. Intell..

[145]  Maurice Bruynooghe,et al.  CHICA, an Abductive Planning System Based on Event Calculus , 1995, J. Log. Comput..

[146]  Scott Weinstein,et al.  Centering: A Framework for Modeling the Local Coherence of Discourse , 1995, CL.

[147]  Ian A. Mason,et al.  Metamathematics of Contexts , 1995, Fundam. Informaticae.

[148]  Bonnie L. Webber,et al.  Instructing Animated Agents: Viewing Language in Behavioral Terms , 1995, Multimodal Human-Computer Communication.

[149]  George Ferguson,et al.  Knowledge representation and reasoning for mixed-initiative planning , 1995 .

[150]  Gopalan Nadathur,et al.  Uniform proofs and disjunctive logic programming , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[151]  Matthew L. Ginsberg,et al.  Approximate Planning , 1995, Artif. Intell..

[152]  Mark Steedman,et al.  Dynamic Semantics for Tense and Aspect , 1995, IJCAI.

[153]  Branimir Boguraev,et al.  Natural Language Engineering , 1995 .

[154]  Norman I. Badler,et al.  Instructions, Intentions and Expectations , 1995, Artif. Intell..

[155]  Jennifer Chu-Carroll,et al.  Response Generation in Collaborative Negotiation , 1995, ACL.

[156]  Daniel S. Weld,et al.  A Domain-Independent Algorithm for Plan Adaptation , 1994, J. Artif. Intell. Res..

[157]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[158]  Keith Golden,et al.  Representing Sensing Actions: The Middle Ground Revisited , 1996, KR.

[159]  Christoph Kreitz,et al.  T-String Unification: Unifying Prefixes in Non-classical Proof Methods , 1996, TABLEAUX.

[160]  J. Carletta,et al.  Combining Power With Tractability in Belief Models , 1996 .

[161]  Raymond Reiter,et al.  Natural Actions, Concurrency and Continuous Time in the Situation Calculus , 1996, KR.

[162]  Norman I. Badler,et al.  Task-Level Object Grasping for Simulated Agents , 1996, Presence: Teleoperators & Virtual Environments.

[163]  Robert P. Goldman,et al.  Expressive Planning and Explicit Knowledge , 1996, AIPS.

[164]  Hector J. Levesque,et al.  What Is Planning in the Presence of Sensing? , 1996, AAAI/IAAI, Vol. 2.

[165]  Renate A. Schmidt,et al.  Resolution is a Decision Procedure for Many Propositional Modal Logics , 1996, Advances in Modal Logic.

[166]  Matthew Stone,et al.  Paying Heed to Collocations , 1996, INLG.

[167]  Libby Levison,et al.  Connecting planning and acting via object-specific reasoning , 1996 .

[168]  Alistair Knott,et al.  A data-driven methodology for motivating a set of coherence relations , 1996 .

[169]  Reinhard Muskens,et al.  Combining Montague semantics and discourse representation , 1996 .

[170]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K , 1996, CADE.

[171]  Laura Giordano,et al.  A Framework for a Modal Logic Programming , 1996, JICSLP.

[172]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[173]  Robert Dale,et al.  Building applied natural language generation systems , 1997, Natural Language Engineering.

[174]  Matthew Stone,et al.  Sentence Planning as Description Using Tree Adjoining Grammar , 1997, ACL.

[175]  Murray Shanahan Event Calculus Planning Revisited , 1997, ECP.

[176]  Fausto Giunchiglia,et al.  A New Method for Testing Decision Procedures in Modal Logics , 1997, CADE.

[177]  A. Thomason,et al.  Interrelating Interpretation and Generation in an Abductive Framework Relating Interpretation and Generation , 1997 .

[178]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.

[179]  M. Stone Partial Order Reasoning for a Nonmonotonic Theory of Action , 1997 .

[180]  Chitta Baral,et al.  Reasoning About Effects of Concurrent Actions , 1997, J. Log. Program..

[181]  Jorge Lobo,et al.  Adding Knowledge to the Action Description Language A , 1997, AAAI/IAAI.

[182]  Michael O'Donnell , 1997, The Lancet.

[183]  Richmond H. Thomason Intra-Agent Modality and Nonmonotonic Epistemic Logic , 1998, TARK.

[184]  Fausto Giunchiglia,et al.  More Evaluation of Decision Procedures for Modal Logics , 1998, KR.

[185]  Renate A. Schmidt E-Unification for Subsystems of S4 , 1998, RTA.

[186]  J. Peregrin LINGUISTICS AND PHILOSOPHY , 1998 .

[187]  S. Crawford,et al.  Volume 1 , 2012, Journal of Diabetes Investigation.

[188]  Matthew Stone,et al.  Textual Economy Through Close Coupling of Syntax and Semantics , 1998, INLG.

[189]  Bonnie L. Webber,et al.  TraumaTIQ: Online Decision Support for Trauma Management , 1998, IEEE Intell. Syst..

[190]  Chris Mellish,et al.  An Architecture for Opportunistic Text Generation , 1998, INLG.

[191]  Juliet C Bourne,et al.  Generating Effective Instructions: Knowing When to Stop , 1998 .

[192]  Matthew Stone,et al.  Abductive Planning with Sensing , 1998, AAAI/IAAI.