Sciweavers

1058 search results - page 110 / 212
» Fault-Tolerant Resource 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
95
Voted
CDVE
2004
Springer
120views Visualization» more  CDVE 2004»
15 years 6 months ago
Constructing a Global and Integral Model of Business Management Using a CBR System
Abstract. Knowledge has become the most strategic resource in the new business environment. A case-based reasoning system, which incorporates a novel clustering and retrieval metho...
Emilio Corchado, Juan M. Corchado, Lourdes S&aacut...
104
Voted
JELIA
1998
Springer
15 years 5 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
133
Voted
LICS
1993
IEEE
15 years 4 months ago
Verifying Programs with Unreliable Channels
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...
Parosh Aziz Abdulla, Bengt Jonsson
107
Voted
ESWS
2006
Springer
15 years 4 months ago
Encoding Classifications into Lightweight Ontologies
Classifications have been used for centuries with the goal of cataloguing and searching large sets of objects. In the early days it was mainly books; lately it has also become Web ...
Fausto Giunchiglia, Maurizio Marchese, Ilya Zaihra...