Fair Derivations in Monodic Temporal Reasoning
Ordered fine-grained resolution with selection is a sound and complete resolution-based calculus for monodic first-order temporal logic. The inference rules of the calculus are based on standard resolution between different types of temporal clauses on one hand and inference rules with semi-decidable applicability conditions that handle eventualities on the other hand. In this paper we illustrate how the combination of these two different types of inference rules can lead to unfair derivations in practice. We also present an inference procedure that allows us to construct fair derivations and prove its refutational completeness. We conclude with some experimental results obtained with the implementation of the new procedure in the theorem prover TSPASS.
Unable to display preview. Download preview PDF.
- 2.Behdenna, A., Dixon, C., Fisher, M.: Deductive verification of simple foraging robotic behaviours (under review)Google Scholar
- 5.Emerson, E.A.: Temporal and modal logic. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 995–1072 (1990)Google Scholar
- 11.Konev, B., Degtyarev, A., Dixon, C., Fisher, M., Hustadt, U.: Towards the implementation of first-order temporal resolution: the expanding domain case. In: Proc. TIME-ICTL 2003, pp. 72–82. IEEE Computer Society, Los Alamitos (2003)Google Scholar
- 13.Ludwig, M., Hustadt, U.: Implementing a fair monodic temporal logic prover. AI Communications (to appear)Google Scholar