Sciweavers

780 search results - page 86 / 156
» Compositional Quantitative Reasoning
Sort
View
95
Voted
PLDI
2010
ACM
15 years 10 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
EDBT
2004
ACM
142views Database» more  EDBT 2004»
15 years 6 months ago
Computing and Handling Cardinal Direction Information
Qualitative spatial reasoning forms an important part of the commonsense reasoning required for building intelligent Geographical Information Systems (GIS). Previous research has c...
Spiros Skiadopoulos, Christos Giannoukos, Panos Va...
CLIMA
2009
14 years 10 months ago
Argumentation-Based Preference Modelling with Incomplete Information
Abstract. No intelligent decision support system functions even remotely without knowing the preferences of the user. A major problem is that the way average users think about and ...
Wietske Visser, Koen V. Hindriks, Catholijn M. Jon...
99
Voted
ICSOC
2009
Springer
15 years 7 months ago
An Automatic Approach to Enable Replacement of Conversational Services
Abstract. In Service Oriented Architectures (SOAs) services invoked in a composition can be replaced by other services, which are possibly discovered and bound at runtime. Most of ...
Luca Cavallaro, Elisabetta Di Nitto, Matteo Pradel...
QEST
2008
IEEE
15 years 7 months ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...