7 search results - page 2 / 2 » Memoization and DPLL: Formula Caching Proof Systems |
ASE
2005
13 years 5 months ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
BIRTHDAY
2006
Springer
13 years 9 months ago
2006
Springer
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...