148 search results - page 30 / 30 » On the Complexity of Elementary Modal Logics |
STACS
2010
Springer
14 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
DOCENG
2006
ACM
14 years 8 days ago
2006
ACM
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
DLOG
2009
13 years 4 months ago
2009
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...