Handbook of theoretical computer science (vol. B)
ACM Transactions on Computational Logic (TOCL)
Algorithms for Guiding Clausal Temporal Resolution
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
ACM Transactions on Computational Logic (TOCL)
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Implementing a fair monodic temporal logic prover
AI Communications - Practical Aspects of Automated Reasoning
Deciding monodic fragments by temporal resolution
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Evaluating LTL satisfiability solvers
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Labelled superposition for PLTL
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Towards temporal verification of swarm robotic systems
Robotics and Autonomous Systems
Hi-index | 0.00 |
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.