| Preface | p. v |
| Acknowledgments | p. vii |
| Introduction | p. 1 |
| The plan of the book | p. 4 |
| The book in context | p. 6 |
| Preliminaries | p. 9 |
| The original approach: Classical default logic | p. 11 |
| Formal properties | p. 13 |
| Restricted default theories | p. 18 |
| A semantics for classical default logic | p. 20 |
| An alternative approach: Constrained default logic | p. 23 |
| Motivation | p. 23 |
| Constrained default logic | p. 24 |
| Formal properties | p. 26 |
| The focused models semantics | p. 28 |
| Variations of constrained default logic | p. 30 |
| Conclusion | p. 32 |
| Putting default logics into perspective | p. 33 |
| Variants modifying the notion of consistency | p. 33 |
| A guiding example | p. 33 |
| Justified default logic | p. 34 |
| Constrained default logic: Revisited | p. 37 |
| Rational default logic | p. 40 |
| Variants recording consistency assumptions | p. 41 |
| Cumulative default logic | p. 42 |
| Variants of cumulative default logic | p. 47 |
| Other Variants | p. 50 |
| Conclusion | p. 51 |
| A context-based framework for default logics | p. 53 |
| Motivation | p. 53 |
| Contextual default logic | p. 55 |
| Embedding existing default logics | p. 58 |
| Formal properties | p. 61 |
| Conclusion | p. 62 |
| Possible worlds semantics for default logics | p. 63 |
| Motivation | p. 63 |
| Possible worlds semantics for constrained default logic | p. 65 |
| Possible worlds semantics for classical default logic | p. 67 |
| Possible worlds semantics for justified default logic | p. 69 |
| Possible worlds semantics for contextual default logic | p. 72 |
| Conclusion | p. 74 |
| Adding specificity to default logics | p. 75 |
| Motivation | p. 75 |
| Determination of specificity information | p. 76 |
| Compiling specificity into default theories | p. 80 |
| Conclusion | p. 82 |
| Adding lemma handling to default logics | p. 85 |
| Motivation | p. 85 |
| Lemma handling in constrained default logic | p. 86 |
| Lemma handling in classical default logic | p. 90 |
| Conclusion | p. 90 |
| Query-answering in default logics | p. 93 |
| Motivation | p. 93 |
| Computational characterizations | p. 96 |
| A method for query-answering in default logics | p. 98 |
| The connection method | p. 99 |
| Complementarity | p. 100 |
| Admissibility | p. 102 |
| Compatibility | p. 103 |
| Characterizing default proofs | p. 105 |
| Implementing the approach | p. 106 |
| An algorithm | p. 107 |
| A preliminary case-study | p. 111 |
| An incremental approach | p. 112 |
| An alternative characterization of extensions | p. 113 |
| Incremental compatibility | p. 114 |
| An incremental algorithm | p. 116 |
| Discussion | p. 119 |
| Experiments | p. 121 |
| A straightforward implementation | p. 121 |
| Implementations separating compatibility | p. 123 |
| Implementations integrating compatibility | p. 125 |
| Extensions | p. 127 |
| Integration of lemma handling | p. 128 |
| Model-based consistency-checking | p. 129 |
| Skeptical query-answering | p. 131 |
| Conclusion | p. 132 |
| A Prolog-technology compiler for query-answering 135 | |
| Motivation | p. 135 |
| Implementing query-answering | p. 136 |
| Extensions and implementation | p. 140 |
| Conclusion | p. 141 |
| Conclusions and perspectives | p. 143 |
| Appendix | p. 147 |
| Original definition of rational extensions | p. 147 |
| Modal logic | p. 148 |
| References | p. 149 |
| Table of Contents provided by Publisher. All Rights Reserved. |