Query automata over finite trees
Theoretical Computer Science
A Road-Map on Complexity for Hybrid Logics
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Frontiers of tractability for typechecking simple XML transformations
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Complexity Issues in Multiagent Logics
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
The complexity of reasoning about pattern-based XML schemas
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Centralized asynchronous broadcast in radio networks
Theoretical Computer Science
Extending dependencies with conditions
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Reducing the complexity of logics for multiagent systems
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
XPath satisfiability in the presence of DTDs
Journal of the ACM (JACM)
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Satisfiability of downward XPath with data equality tests
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
The Complexity of Hybrid Logics over Equivalence Relations
Journal of Logic, Language and Information
Combining spatial and temporal logics: expressiveness vs. complexity
Journal of Artificial Intelligence Research
Approximability of Edge Matching Puzzles
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Playing savitch and cooking games
Concurrency, Compositionality, and Correctness
Turing machines for dummies: why representations do matter
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Complexity Issues in Multiagent Logics
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Extending inclusion dependencies with conditions
Theoretical Computer Science
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.04 |