Clausal Temporal Resolution

07/21/1999
by   Michael Fisher, et al.
0

In this article, we examine how clausal resolution can be applied to a specific, but widely used, non-classical logic, namely discrete linear temporal logic. Thus, we first define a normal form for temporal formulae and show how arbitrary temporal formulae can be translated into the normal form, while preserving satisfiability. We then introduce novel resolution rules that can be applied to formulae in this normal form, provide a range of examples and examine the correctness and complexity of this approach is examined and. This clausal resolution approach. Finally, we describe related work and future developments concerning this work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/03/2014

A Resolution Prover for Coalition Logic

We present a prototype tool for automated reasoning for Coalition Logic,...
research
04/14/2022

On the Expressive Power of the Normal Form for Branching-Time Temporal Logics

With the emerging applications that involve complex distributed systems ...
research
05/20/2021

Generalizing Non-Punctuality for Timed Temporal Logic with Freeze Quantifiers

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL...
research
04/08/2021

Analysis of Normal-Form Algorithms for Solving Systems of Polynomial Equations

We examine several of the normal-form multivariate polynomial rootfindin...
research
09/26/2011

Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas

Resolution is the rule of inference at the basis of most procedures for ...
research
11/15/2021

The Possibilistic Horn Non-Clausal Knowledge Bases

Posibilistic logic is the most extended approach to handle uncertain and...
research
08/08/2023

Explorations in Subexponential Non-associative Non-commutative Linear Logic

In a previous work we introduced a non-associative non-commutative logic...

Please sign up or login with your details

Forgot password? Click here to reset