M. Ludwig and U. Hustadt (2009c)Proceedings of the 22nd International Conference on Automated Deduction (CADE-22) [Montreal, Canada, 2-7 August 2009], pp. 261-276. LNAI 5663, Spinger.
Abstract, BibTeX, Abstract + PDF (Springer).

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.

Logic and Computation Group at the Department of Computer Science, University of Liverpool
Maintained by Ullrich Hustadt, U.Hustadt@csc.liv.ac.uk, last updated Friday, 16-Aug-2013 14:47:37 BST © 1998-2004 by Ullrich Hustadt.