Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
EXPTIME
OpenAlex ID:
C56049555
Pushing the EL Envelope
2005
·
Institut für Theoretische Informatik TU Dresden
, Franz Baader
, et al.
·
1,085
Reasoning on UML class diagrams
2005
·
Daniela Berardi
, Diego Calvanese
, et al.
·
Artificial Intelligence
·
625
PDF
Approximating clique is almost NP-complete
2002
·
U. Feige
, S. Goldwasser
, et al.
·
Annual Symposium on Foundations of Computer Science
·
438
Hierarchies of memory limited computations
1965
·
R. E. Stearns
, J. Hartmanis
, et al.
·
Annual Symposium on Switching Circuit Theory and Logical Design (SWCT)
·
418
The complexity of two-player games of incomplete information
1984
·
John H. Reif
·
Journal of Computer and System Sciences
·
329
PDF
Memory bounds for recognition of context-free and context-sensitive languages
1965
·
P. M. Lewis
, R. E. Stearns
, et al.
·
Annual Symposium on Switching Circuit Theory and Logical Design (SWCT)
·
265
Pushdown Processes: Games and Model-Checking
2001
·
Igor Walukiewicz
·
Information and Computation
·
256
PDF
Data complexity of reasoning in very expressive description logics
2005
·
Ullrich Hustadt
, Boris Motik
, et al.
·
Research Explorer (The University of Manchester)
·
250
TBox and ABox Reasoning in Expressive Description Logics.
1996
·
Giuseppe De Giacomo
, Maurizio Lenzerini
·
IRIS Research product catalog (Sapienza University of Rome)
·
211
The Complexity of Conjunctive Query Answering in Expressive Description Logics
2008
·
Carsten Lutz
·
Lecture notes in computer science
·
190
Deciding inseparability and conservative extensions in the description logic EL
2009
·
Carsten Lutz
, Frank Wolter
·
Journal of Symbolic Computation
·
160
PDF
Lower bounds for multiplayer noncooperative games of incomplete information
2001
·
G. Peterson
, J. Reif
, et al.
·
Computers & Mathematics with Applications
·
156
Deterministic generators and games for Ltl fragments
2004
·
Rajeev Alur
, Salvatore La Torre
·
ACM Transactions on Computational Logic
·
154
EXPtime tableaux for ALC
2000
·
Francesco M. Donini
, Fabio Massacci
·
Artificial Intelligence
·
145
PDF
Probabilistic propositional planning: representations and complexity
1997
·
Michael L. Littman
·
National Conference on Artificial Intelligence
·
144
On parallelism in turing machines
1976
·
Dexter Kozen
·
Annual Symposium on Foundations of Computer Science
·
142
Guarded fixed point logic
2003
·
E. Gradel
, I. Walukiewicz
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
137
Sparse sets in NP-P: EXPTIME versus NEXPTIME
1985
·
J. Hartmanis
, N. Immerman
, et al.
·
Information and Control
·
132
Extending dependencies with conditions
2007
·
Loreto Bravo
, Wenfei Fan
, et al.
·
Edinburgh Research Explorer (University of Edinburgh)
·
129
PDF
The computational complexity of hybrid temporal logics
2000
·
C Areces
·
Logic Journal of IGPL
·
129
N by N Checkers is Exptime Complete
1984
·
J. M. Robson
·
SIAM Journal on Computing
·
129
Choiceless polynomial time
1999
·
Andreas Blass
, Yuri Gurevich
, et al.
·
Annals of Pure and Applied Logic
·
127
Probabilistic Description Logics for Subjective Uncertainty
2017
·
Victor Gutierrez-Basulto
, Jean Christoph Jung
, et al.
·
Journal of Artificial Intelligence Research
·
125
PDF
The complexity of pursuit on a graph
1995
·
Arthur S. Goldstein
, Edward M. Reingold
·
Theoretical Computer Science
·
116
PDF
Query answering in the horn fragments of the description logics SHOIQ and SROIQ
2011
·
Magdalena Ortiz
, Sebastian Rudolph
, et al.
·
International Joint Conference on Artificial Intelligence
·
114
Show more works
View as search
Works count:
1,007
Citation count:
17,340
Year
Topic
Type