Temporal propositions as regular languages
- Temporal propositions are mapped to sets of strings that witness (in a precise sense) the propositions over discrete linear Kripke frames. The strings are collected into regular languages to ensure the decidability of entailments given by inclusions between languages. (Various notions of bounded entailment are shown to be expressible as language inclusions.) The languages unwind computations implicit in the logical (and temporal) connectives via a system of finite-state constraints adapted from finite-state morphology. Applications to Hybrid Logic and non-monotonic inertial reasoning are briefly considered.
| Author details: | Tim Fernando |
|---|---|
| URN: | urn:nbn:de:kobv:517-opus-27194 |
| Publication type: | Conference Proceeding |
| Language: | English |
| Publication year: | 2008 |
| Publishing institution: | Universität Potsdam |
| Release date: | 2008/12/11 |
| Organizational units: | Extern / Extern |
| DDC classification: | 4 Sprache / 40 Sprache / 400 Sprache |
| Collection(s): | Universität Potsdam / Tagungsbände/Proceedings (nicht fortlaufend) / Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 / II Regular Papers |
| License (German): |  Keine öffentliche Lizenz: Unter Urheberrechtsschutz |
| External remark: | The complete edition of the proceedings "Finite-state methods and natural language processing : 6th International Workshop, FSMNLP 2007 ; Revised Papers" is available: URN urn:nbn:de:kobv:517-opus-23812 |
