846 search results - page 148 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
103
click to vote
AGP
1999
IEEE
15 years 3 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
DBPL
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
ECAI
1994
Springer
15 years 3 months ago
1994
Springer
For large problems the ATMS often becomes the main resource consumer in any reasoning system. We propose an architecture (the 2vATMS) that combines the advantages of two techniques...
ATVA
2004
Springer
15 years 2 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
ACSD
2008
IEEE
15 years 1 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...