144 search results - page 22 / 29 » On meta complexity of propositional formulas and proposition... |
107
Voted
CONCUR
1998
Springer
15 years 6 months ago
1998
Springer
This paper presents a complete axiomatization of two decidable propositional realtime linear temporal logics: Event Clock Logic (EventClockTL) and Metric Interval Temporal Logic w...
122
Voted
BIRTHDAY
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this survey on implicit induction I recollect some memories on the history of implicit induction as it is relevant for future research on computer-assisted theorem pro...
122
Voted
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
118
Voted
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
133
click to vote
JDCTA
2010
14 years 8 months ago
2010
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...