A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance

Suda, Martin; Weidenbach, Christoph

doi:10.1007/978-3-642-31365-3_42

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1857503_5

DetailsSummary

Released

Conference Paper

A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance

MPS-Authors

/persons/resource/persons45573

Suda, Martin
Automation of Logic, MPI for Informatics, Max Planck Society;

/persons/resource/persons45719

Weidenbach, Christoph
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Suda, M., & Weidenbach, C. (2012). A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance. In B. Gramlich, D. Miller, & U. Sattler (Eds.), Automated Reasoning (pp. 537-543). Berlin: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-B7CC-2

Abstract

Labelled superposition (LPSup) is a new calculus for PLTL. One of its distinguishing features, in comparison to other resolution-based approaches, is its ability to construct partial models on the fly. We use this feature to design a new decision procedure for the logic, where the models are effectively used to guide the search. On a representative set of benchmarks, our implementation is then shown to considerably advance the state of the art.