Logical Foundations for Question Answering [PhD Thesis]

Cover ......Page 1
Table of contents ......Page 6
Preface ......Page 9
1. Introduction ......Page 11
2. Artificial Intelligence ......Page 12
3. Model-Theoretic Semantics vs. Procedural Semantics ......Page 13
4. Limitations of Predicate Calculus ......Page 14
5. Conclusion ......Page 15
1. Introduction ......Page 17
2.1. Hamblin: Questions as Sets of Possible Answers ......Page 19
2.2. Karttunen: Questions as Properties of True Answers ......Page 20
2.3. Answer-Propositions in Context ......Page 21
2.4. Groenendijk and Stokhof: Exhaustiveness ......Page 23
2.5. Problems with Rigid Designators ......Page 24
3. Against the Primacy of Full-Sentence Answers ......Page 26
4. Hausser: Answers as Noun Phrases ......Page 27
5.1. Introduction ......Page 30
5.2. Questions ......Page 31
5.3. Answers ......Page 32
5.4. Indefinite Answers ......Page 35
5.5. Full-Sentence Answers ......Page 37
6.1. Introduction ......Page 38
6.2. The \"Compound Speech Act\" Analysis ......Page 39
6.3. A Proposal by Groenendijk and Stokhof ......Page 40
6.4. The PHLIQA1 Treatment ......Page 41
7.1. Categories of Answers ......Page 44
7.2. Pragmatic Strategies ......Page 46
8. Conclusion ......Page 49
2. External Requirements for a Question Answering System ......Page 50
3. The Top Level Design of PHLIQA1 ......Page 54
4. An English-oriented Level of Meaning Representation ......Page 55
5. The World Model Language ......Page 58
6. The Data Base Language ......Page 62
7. Translations ......Page 65
8. The Control Structure of the PHLIQA1 Program ......Page 67
9. The Behaviour of the PHLIQA1 System ......Page 69
1. Introduction ......Page 72
2. Value Specifications ......Page 73
3. Relational Data Bases Viewed as Value Specifications ......Page 76
4. CODASYL Data Bases Viewed as Value Specifications ......Page 79
5. Data Bases as Axiom Sets ......Page 81
1. Conceptual Information: the Bridge between Different Levels of Meaning Representation ......Page 83
2.1. Translation Rules ......Page 86
2.2. Type Constraints ......Page 87
3. Translation between Languages with Different Type Systems ......Page 88
4.1. The Problem of Compound Attributes ......Page 92
4.2. More Complex Examples ......Page 96
4.3. The Definition of Identification Translations ......Page 97
5. Simplification Transformations ......Page 100
6. Extending the Data Base Language ......Page 104
1. Introduction ......Page 107
2.2. Rule Schemes for First-Order Languages ......Page 108
2.3. An Example of the Use of Global Rule Schemes ......Page 110
2.4. Theoretical and Practical Aspects of the Use of Global Rule Schemes ......Page 112
3.1. Introduction ......Page 113
3.2. Translation and Evaluation ......Page 114
3.3. Interweaving Translation and Evaluation ......Page 116
4. Representing Knowledge by Means of Axiom Collections ......Page 117
5. The Closed World Assumption ......Page 119
6.1. Introduction ......Page 121
6.2. Reiter’s Proposal ......Page 123
6.3. The Exhaustiveness of the Answers in Reiter’s System ......Page 126
6.4. The Closed World Assumption ......Page 128
6.5. A Comparison with the Translation Specification Approach ......Page 130
7. Knowledge Representation for Question Answering: Conclusion ......Page 132
Chapter VII. Conclusion: Design Styles ......Page 134
References ......Page 137
2. The Type System of the PHLIQA1 Languages ......Page 144
3. The Definition of the Expressions of a PHLIQA1 Language ......Page 146
4. The Semantics of the PHLIQA1 Languages ......Page 149
5. Semantic Anomaly ......Page 153
6. Additions and Abbreviations ......Page 155
Nederlandstalige Samenvatting ......Page 158
Stellingen behorende bij bet proefschrift \"Logical Foundations for Question Answering\" van Remko J.H. Scha ......Page 160