English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Labelled Superposition for PLTL

Suda, M., & Weidenbach, C. (2012). Labelled Superposition for PLTL. In N. Bjørner, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 391-405). Berlin: Springer.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Labelled Superposition for {PLTL}

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Suda, Martin1, Author           
Weidenbach, Christoph1, Author           
Affiliations:
1Automation of Logic, MPI for Informatics, Max Planck Society, ou_1116545              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 2012
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1007/978-3-642-28717-6_31
BibTex Citekey: SudaWeidenbachLPAR2012
Other: Local-ID: CA616B5FF5079264C1257AD10036F1E5-SudaWeidenbachLPAR2012
 Degree: -

Event

show
hide
Title: 18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Place of Event: Mérida, Venezuela
Start-/End Date: 2012-03-11 - 2012-03-15

Legal Case

show

Project information

show

Source 1

show
hide
Title: Logic for Programming, Artificial Intelligence, and Reasoning
  Subtitle : 18th International Conference, LPAR-18, Mérida, Venezuela, March 11-15, 2012. Proceedings
  Abbreviation : LPAR 2012
Source Genre: Proceedings
 Creator(s):
Bjørner, Nikolaj1, Editor
Voronkov, Andrei1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 391 - 405 Identifier: ISBN: 978-3-642-28716-9

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 7180 Sequence Number: - Start / End Page: - Identifier: ISSN: 0302-9743