1650 search results - page 106 / 330 » The HOM problem is decidable |
MKM
2009
Springer
14 years 4 months ago
2009
Springer
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
ITNG
2006
IEEE
14 years 4 months ago
2006
IEEE
Alice holds a secret integer a while Bob holds a secret integer b, they want to decide on the predicate a > b with no information revealed other than the result. This is the we...
CSL
2004
Springer
14 years 3 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
KGC
1993
Springer
14 years 2 months ago
1993
Springer
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
SEBD
2001
13 years 11 months ago
2001
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...