3914 search results - page 490 / 783 » Automating SLA modeling |
200
click to vote
NIL
1991
15 years 10 months ago
1991
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
197
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. There has been an increased interest in recent years to incorporate uncertainty in Description Logics (DLs), and a number of proposals have been put forward for modeling ...
166
click to vote
DLOG
2007
15 years 9 months ago
2007
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
184
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
207
click to vote
CSL
2008
Springer
15 years 8 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...