Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL

Authors:
Regimantas Pliuskevicius
Affiliations:
-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 6
Cited 1

A complete axiomatic characterization of first-order temporal logic of linear time

Theoretical Computer Science
Concerning the semantic consequence relation in first-order temporal logic

Theoretical Computer Science
Clausal temporal resolution

ACM Transactions on Computational Logic (TOCL)
On Saturated Calculi for a Linear Temporal Logic

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
On an omega-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL

CL '00 Proceedings of the First International Conference on Computational Logic
A resolution method for temporal logic

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1

Decision Procedure for Temporal Logic of Belief and Actions

Informatica

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple decision deductive-based procedure for the so-called clausal miniscoped fragment of a first-order linear temporal logic with temporal operators Next and Always is presented. The soundness and completeness of the proposed decision procedure is proved.