437 search results - page 67 / 88 » Proving Termination by Divergence |
173
click to vote
TABLEAUX
2007
Springer
16 years 24 days ago
2007
Springer
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
203
click to vote
ISSAC
2004
Springer
16 years 1 days ago
2004
Springer
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...
250
click to vote
CDB
1997
Springer
15 years 10 months ago
1997
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
172
click to vote
DLOG
2008
15 years 9 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
157
click to vote
ENTCS
2000
15 years 6 months ago
2000
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...