156 search results - page 5 / 32 » Decidability and Undecidability in Probability Logic |
ENTCS
2010
13 years 7 months ago
2010
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
CSL
2008
Springer
13 years 9 months ago
2008
Springer
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
RTA
1998
Springer
13 years 11 months ago
1998
Springer
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
FORMATS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metr...