846 search results - page 39 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
73
Voted
WOLLIC
2009
Springer
15 years 5 months ago
2009
Springer
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
MST
2011
14 years 6 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
CSL
2003
Springer
15 years 4 months ago
2003
Springer
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
167
Voted
POPL
2008
ACM
15 years 11 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
TARK
2007
Springer
15 years 5 months ago
2007
Springer
We introduce ATLES – a variant of ATL with explicit names for strategies in the object language. ATLES makes it possible to refer to the same strategy in different occurrences o...