2584 search results - page 486 / 517 » On the Forward Checking Algorithm |
FORMATS
2006
Springer
14 years 22 days ago
2006
Springer
Current numerical model checkers for stochastic systems can efficiently analyse stochastic models. However, the fact that they are unable to provide debugging information constrain...
HYBRID
2000
Springer
14 years 20 days ago
2000
Springer
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
AIPS
2010
13 years 10 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
AI
2010
Springer
13 years 9 months ago
2010
Springer
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
FUIN
2008
13 years 9 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...