3914 search results - page 482 / 783 » Automating SLA modeling |
158
Voted
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...
206
Voted
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
192
Voted
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
g Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 ...
171
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
187
Voted
ECSQARU
2001
Springer
15 years 11 months ago
2001
Springer
New semantics for numerical values given to possibility measures are provided. For epistemic possibilities, the new approach is based on the semantics of the transferable belief m...