9 search results - page 1 / 2 » Deciding kCFA is complete for EXPTIME |
51
Voted
ICFP
2008
ACM
15 years 10 months ago
2008
ACM
DLOG
2008
15 years 1 months ago
2008
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...
TABLEAUX
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
CADE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability for propositional dynamic logic. Our main contribution is a sound meth...
LICS
2008
IEEE
15 years 5 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...