#### DMCA

## A Graph-Based Approach To Resolution In Temporal Logic (1994)

Venue: | In Temporal Logic, First International Conference, ICTL '94, Proceedings |

Citations: | 5 - 3 self |

### Citations

2894 | The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974 |

1651 | The temporal logic of programs - Pnueli - 1977 |

857 | M.J.: An Introduction to Modal Logic - Hughes, Creswell |

808 | The semantics of predicate logic as a programming language. - Emden, Kowalski - 1976 |

679 | Principles of artificial intelligence - Nilsson - 1982 |

439 | Logic for Problem Solving, - Kowalski - 1979 |

302 | Symbolic Logic and Mechanical Theorem Proving, - Chang - 1973 |

240 | Automated Theorem Proving: A Logical Basis - Loveland - 1978 |

240 | Temporal logic can be more expressive - Wolper - 1983 |

219 | A structure-preserving clause form translation. - Plaisted, Greenbaum - 1986 |

179 | The temporal semantics of concurrent programs. - Pnueli - 1981 |

161 | Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends. - Pnueli - 1986 |

135 | Directed hypergraphs and applications - Gallo, Longo, et al. - 1993 |

101 | First Order Logic, - Smullyan - 1968 |

92 | Verification of the concurrent programs: the temporal framework. In - Manna, Pnueli - 1981 |

91 | Sometimes" and "not never" revisited: On branching versus linear time temporal logic - Emerson, Halpern - 1986 |

91 | The declarative past and imperative future. Executable temporal logic for interactive systems,” - Gabbay - 1989 |

89 | A Resolution Calculus for Modal Logics - Ohlbach - 1988 |

83 | A Resolution Method for Temporal Logic.
- Fisher
- 1991
(Show Context)
Citation Context ...ter M1 5GD, UK. michael@sun.com.mmu.ac.uk Abstract. In this paper, we present algorithms developed in order to implement a clausal resolution method for discrete, linear temporal logics, presented in =-=[Fis91]-=-. As part of this method, temporal formulae are rewritten into a normal form and both `non-temporal' and `temporal' inference rules are applied. Through the use of a graph-based representation for the... |

80 | Automated Reasoning: Introduction and Applications, - Wos, Overbeek, et al. - 1992 |

54 | The power of temporal proofs - Abadi - 1989 |

43 |
Modal Theorem Proving
- Abadi, Manna
- 1986
(Show Context)
Citation Context ...mporal resolution rule. So far the theorem prover has been developed for PTL only, but extensions for first order logic are being investigated. Although full First-Order Temporal Logic is undecidable =-=[Aba87]-=-, it is conjectured that there are useful subsets of First-Order Temporal Logic to which this form of temporal resolution can be successfully applied. The need to combine rules in SNF together into SN... |

36 | Nonclausal deduction in first-order temporal logic - Abadi, Manna - 1990 |

29 | A Normal Form for First-Order Temporal Formulae - Fisher - 1992 |

29 |
Decision procedures for temporal logic
- Gough
- 1984
(Show Context)
Citation Context ...n mentioned in 6.1, as it deals with past-time, future-time and a wider range of temporal operators directly and has been automated successfully. A comparison of the resolution theorem prover and DP, =-=[Gou84]-=-, an automated decision procedure for temporal logics based on the tableau method has been carried out. For the results of the comparison and further details of the full theorem-prover, see [Dix92]. R... |

28 | On w-automata and temporal logic, in - Safra, Vardi - 1989 |

28 | Using temporal logic in the compositional specification of concurrent systems - Barringer - 1986 |

26 | Completely non-clausal theorem proving, - Murray - 1982 |

20 | Gentzen-type systems and resolution rules - Mints |

17 |
SICStus Prolog User’s Manual. Swedish
- Carlsson, Wid´en
- 1993
(Show Context)
Citation Context ...n of formulae into SNF and non temporal resolution to produce a complete resolution theorem prover for PTL. The resolution theorem prover has been implemented on Sun Workstations using SICSTUS PROLOG =-=[CW91]-=-. 5 Formal Analysis of the Algorithm In this section, we provide outline proofs exhibiting the correctness of the algorithm. Full versions of the proofs are available, but are omitted due to space res... |

14 | Transformation and Synthesis in METATEM. Part I: Propositional METATEM
- Fisher, Noël
- 1992
(Show Context)
Citation Context ...PTL can be transformed to a normal form, Separated Normal Form (SNF), which is the basis of the resolution method used in this paper. SNF was introduced first in [Fis91] and has been extended both in =-=[FN92]-=- and [Fis92]. While the translation from an arbitrary temporal formula to SNF will not be described here, we note that such a transformation preserves satisfiability and so any contradiction generated... |

13 | Cerro. A decision method for linear temporal logic - Cavalli, del - 1984 |

12 | A Decision Method for Temporal Logic based on Resolution - Venkatesh - 1986 |

10 | L.Farinas del Cerro, Modal Resolution - Enjalbert - 1989 |

7 |
Propositional Temporal Resolution Over Labelled Transition Systems. Unpublished
- Peim
- 1994
(Show Context)
Citation Context ...y of the A i are satisfied then p will be always be satisfied, i.e., ccdeeffg n k=0 A ksp. 4 In its original presentation [Fis91] there was a third side condition but this was found to be unnecessary =-=[Pei94]-=-. Such a set of rules are known as a loop in p. Thus, the first of the new resolvents ensures that none of the rules which form a loop in p can occur at the same time as a Q occurs, so none of the lef... |

4 | The use of renaming to improve the efficiency of clausal theorem proving - Tour, T, et al. - 1990 |

2 | A Resolution Method for Temporal Logic. (Notes provided for the Fourth European - Fisher - 1992 |

2 | A Machine Based Logic Based on the Resolution Principle - Robinson - 1965 |

1 | A Clausal Resolution Method for Propositional Temporal Logic. (Submitted to the - Fisher - 1993 |

1 | Decidability in Temporal Presburger Arithmetic - Hussak - 1987 |