TRP++ 2.0: A Temporal Resolution Prover

Hustadt, Ullrich; Konev, Boris

doi:10.1007/978-3-540-45085-6_21

Cited by 57 publications

(71 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This technique is showing impressively fast results via the implementation Aalta v2.0. The timings presented in the appendix of [12] show that this is much faster on most of the benchmarks than LS4 [20], TRP++ [7], NuXmv-BMCINC [6], and the tableaux/automata reasoner Aalta v1.2 from [9]. Aalta 2.0 does seem to perform significantly faster than the other tools almost across the benchmarks so it will be interesting to see in future work whether the speed-ups that we are seeing in parallel tableaux techniques can challenge this in any way.…”

Section: Parallel Tableaux As Contributor To Portfolio Reasonersmentioning

confidence: 95%

See 1 more Smart Citation

A Parallel Linear Temporal Logic Tableau

McCabe-Dansted¹,

Reynolds

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

For many applications, we are unable to take full advantage of the potential massive parallelisation offered by supercomputers or cloud computing because it is too hard to work out how to divide up the computation task between processors in such a way to minimise the need for communication. However, a recently developed branch-independent tableaux for the common LTL temporal logic should intuitively be easy to parallelise as each branch can be developed independently. Here we describe a simple technique for partitioning such a tableau such that each partition can be processed independently without need for interprocess communication. We investigate the extent to which this technique improves the performance of the LTL tableau on standard benchmarks and random formulas.

show abstract

Section: Parallel Tableaux As Contributor To Portfolio Reasonersmentioning

confidence: 95%

“…They include tableaux pltl [19], resolution TRP++ [7], resolution LS4 [20], symbolic model verification NuSMV [2], and automata Aalta [11]. Surprisingly (or is it unsurprisingly?…”

Section: A New One-pass Embarrassingly Parallel Ltl Tableaumentioning

confidence: 99%

A Parallel Linear Temporal Logic Tableau

McCabe-Dansted¹,

Reynolds

2017

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…For each problem and for both calculi we report the number of clauses in the input, the number of derived 3 clauses and literals, and the number of subsumed clauses. For comparison, we also include in the last two columns clause data obtained by running the temporal prover TRP++ [17] 4 , which also implements the CTR calculus, to provide evidence that our experimental results are not biased. We used the default mode (no extra options) for running TRP++ and collected the information on the number of generated and subsumed clauses from the output the prover by default provides.…”

Section: Methodsmentioning

confidence: 99%

Labelled Superposition for PLTL

Suda

Weidenbach

2012

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Publication NotesThis report is an extended version of an article published elsewhere. AbstractThis 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.

show abstract

“…In general, first order temporal problems are very complex, but there are automatic methods for both propositional [72,97] and significant fragments of first-order [47,105,98] temporal logics. While individual modal, temporal, or description logics have been studied extensively in the past, much less is known about combinations of modal logics and, in particular, about practical proof methods for such combinations [22].…”

Section: • Temporal Logicsmentioning

confidence: 99%

Computational Logics and Agents: A Road Map of Current Technologies and Future Trends

Fisher

Bordini

Hirsch

et al. 2007

Computational Intelligence

View full text Add to dashboard Cite

The concept of an agent is increasingly used in contemporary software applications, particularly those involving the Internet, autonomous systems, or cooperation. However, with dependability and safety in mind, it is vital that the mechanisms for representing and implementing agents are clear and consistent. Hence there has been a strong research effort directed at using formal logic as the basis for agent descriptions and agent implementation. Such a logical basis not only presents the clarity and consistency required but also allows for important techniques such as logical verification to be applied.We present a roadmap of research into the use of computational logic in agent-based systems and survey much of the recent work in these areas. Even though, with such a rapidly changing field, it is impossible to cover every development, we aim to give the reader sufficient background to understand the current research problems and potential future developments in this maturing area.

show abstract

TRP++ 2.0: A Temporal Resolution Prover

Cited by 57 publications

References 7 publications

A Parallel Linear Temporal Logic Tableau

A Parallel Linear Temporal Logic Tableau

Labelled Superposition for PLTL

Computational Logics and Agents: A Road Map of Current Technologies and Future Trends

Contact Info

Product

Resources

About