124 search results - page 10 / 25 » Automata can show PSpace results for description logics |
AAAI
2010
13 years 9 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
ACRI
2008
Springer
14 years 2 months ago
2008
Springer
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
STACS
2010
Springer
14 years 2 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...