Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,442,325 papers from all fields of science
Search
Sign In
Create Free Account
2-EXPTIME
Known as:
2-EXP
, 2EXPTIME
In computational complexity theory, the complexity class 2-EXPTIME (sometimes called 2-EXP) is the set of all decision problems solvable by a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Alternating Turing machine
Complexity class
Computational complexity theory
DTIME
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic
Benjamin Zarrieß
International Conference on Principles of…
2018
Corpus ID: 53015371
We consider an action language extended with quantitative notions of uncertainty. In our setting, the initial beliefs of an agent…
Expand
2016
2016
Query-Based Entailment and Inseparability for ALC Ontologies
E. Botoeva
,
C. Lutz
,
V. Ryzhikov
,
F. Wolter
,
M. Zakharyaschev
International Joint Conference on Artificial…
2016
Corpus ID: 9931234
We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give…
Expand
2016
2016
Conjunctive query containment over trees using schema information
Henrik Björklund
,
W. Martens
,
T. Schwentick
Acta Informatica
2016
Corpus ID: 21258144
We study the containment, satisfiability, and validity problems for conjunctive queries over trees with respect to a schema. We…
Expand
2014
2014
Revisiting the Hardness of Query Answering in Expressive Description Logics
Magdalena Ortiz
,
M. Šimkus
International Conference on Web Reasoning and…
2014
Corpus ID: 41998773
Answering conjunctive queries over Description Logic (DL) knowledge bases is known to be 2ExpTime-hard for the DLs \(\mathcal…
Expand
2009
2009
Branching-Time Logics Repeatedly Referring to States
Volker Weber
Journal of Logic, Language and Information
2009
Corpus ID: 26934170
While classical temporal logics lose track of a state as soon as a temporal operator is applied, several branching-time logics…
Expand
2009
2009
A 2EXPTIME Complete Varietal Membership Problem
M. Kozik
SIAM journal on computing (Print)
2009
Corpus ID: 487632
We construct a finite algebra generating a variety with 2EXPTIME complete membership problem. This proves that the universal…
Expand
2007
2007
Hybrid Branching-Time Logics
Volker Weber
arXiv.org
2007
Corpus ID: 9344022
Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder…
Expand
2004
2004
Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard
Richard Mayr
International Workshop on Expressiveness in…
2004
Corpus ID: 2285264
2004
2004
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection
M. Lange
Advances in Modal Logic
2004
Corpus ID: 9875446
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a…
Expand
2003
2003
Playing Games with Boxes and Diamonds
R. Alur
,
S. L. Torre
,
P. Madhusudan
International Conference on Concurrency Theory
2003
Corpus ID: 1479704
Deciding infinite two-player games on finite graphs with the winning condition specified by a linear temporal logic (Ltl) formula…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE