Stem exp$ (all stems)

6 papers:

LICS-CSL-2014-Haase #subclass

Subclasses of presburger arithmetic and the weak EXP hierarchy (CH), p. 10.

RTA-TLCA-2014-Schmitz #logic

Implicational Relevance Logic is 2-ExpTime-Complete (SS), pp. 395–409.

FoSSaCS-2007-GollerLL

PDL with Intersection and Converse Is 2 EXP-Complete (SG, ML, CL), pp. 198–212.

FoSSaCS-2006-ZuninoD #analysis #protocol

Handling exp, × (and Timestamps) in Protocol Analysis (RZ, PD), pp. 413–427.

IFM-2005-Lang #composition #flexibility #on the fly #partial order #verification

Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods (FL), pp. 70–88.

CSL-1999-Tobies #logic #strict

A NExpTime-Complete Description Logic Strictly Contained in C2 (ST), pp. 292–306.