Automated reasoning in quantified modal and temporal logics

Authors:
Claudio Castellini
Affiliations:
LIRA-Lab/DIST, University of Genova, Italy
Venue:
AI Communications
Year:
2006

Citing 6
Cited 0

Labelled Modal Logics: Quantifiers

Journal of Logic, Language and Information
Feature interaction: a critical review and considered forecast

Computer Networks: The International Journal of Computer and Telecommunications Networking
A New Method for Bounding the Complexity of Modal Logics

KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
System Description: Proof Planning in Higher-Order Logic with Lambda-Clam

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Automatic Verification of any Number of Concurrent, Communicating Processes

Proceedings of the 17th IEEE international conference on Automated software engineering
Proof planning for first-order temporal logic

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a summary of the author's PhD thesis, concerned with automated reasoning in quantified modal and temporal logics. The relevant contributions are: (i) a sound and complete set of sequent calculi for quantified modal logics is devised; (ii) the approach is extended to the quantified temporal logic of linear, discrete time and a framework for doing automated reasoning via Proof Planning in it is developed; (iii) a set of promising experimental results is shown, obtained by applying the framework to the problem of Feature Interactions in telecommunication systems.