92 search results - page 11 / 19 » Decidable Reasoning over Timestamped Conceptual Models |
140
click to vote
TABLEAUX
2000
Springer
15 years 3 months ago
2000
Springer
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
108
click to vote
CSL
2008
Springer
15 years 1 months ago
2008
Springer
Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computat...
101
click to vote
FOSSACS
2005
Springer
15 years 5 months ago
2005
Springer
Separation logic is a spatial logic for reasoning locally about heap structures. A decidable fragment of its assertion language was presented in [1], based on a bounded model prope...
BIB
2006
14 years 11 months ago
2006
This article is a critical review of computational techniques used to model, analyse and simulate signalling networks. We propose a conceptual framework, and discuss the role of s...