Sciweavers

744 search results - page 4 / 149
» Observations on the Decidability of Transitions
Sort
View
DLOG
2009
13 years 6 months ago
Terminating Tableaux for SOQ with Number Restrictions on Transitive Roles
Abstract. We show that the description logic SOQ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus i...
Mark Kaminski, Gert Smolka
DLT
2004
13 years 10 months ago
Relating Tree Series Transducers and Weighted Tree Automata
Bottom-up tree series transducers (tst) over the semiring A are implemented with the help of bottom-up weighted tree automata (wta) over an extension of A. Therefore bottom-up D-w...
Andreas Maletti
FSTTCS
2004
Springer
14 years 2 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
IANDC
2010
79views more  IANDC 2010»
13 years 7 months ago
Complexity of deciding bisimilarity between normed BPA and normed BPP
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
Petr Jancar, Martin Kot, Zdenek Sawa
CSDA
2008
122views more  CSDA 2008»
13 years 9 months ago
Bayesian inference for nonlinear multivariate diffusion models observed with error
Diffusion processes governed by stochastic differential equations (SDEs) are a well established tool for modelling continuous time data from a wide range of areas. Consequently, t...
Andrew Golightly, Darren J. Wilkinson