Labelled superposition for PLTL

  • Authors:

  • Martin Suda;Christoph Weidenbach

  • Affiliations:

  • Max-Planck-Institut für Informatik, Saarbrücken, Germany and Saarland University, Saarbrücken, Germany and Charles University, Prague, Czech Republic;Max-Planck-Institut für Informatik, Saarbrücken, Germany

  • Venue:
  • LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces a new decision procedure for PLTL based on labelled superposition. Its main idea is to treat temporal formulas as infinite sets of purely propositional clauses over an extended signature. These infinite sets are then represented by finite sets of labelled propositional clauses. The new representation enables the replacement of the complex temporal resolution rule, suggested by existing resolution calculi for PLTL, by a fine grained repetition check of finitely saturated labelled clause sets followed by a simple inference. The completeness argument is based on the standard model building idea from superposition. It inherently justifies ordering restrictions, redundancy elimination and effective partial model building. The latter can be directly used to effectively generate counterexamples of non-valid PLTL conjectures out of saturated labelled clause sets in a straightforward way.