6167 search results - page 282 / 1234 » Can Refinement be Automated |
218
click to vote
FTP
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
175
click to vote
DLOG
2003
15 years 8 months ago
2003
We consider the problem of automated index selection for embedded control programs (ECPs). Such systems have the property that the transaction types, which can consist of queries ...
231
click to vote
ECSQARU
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
214
Voted
ECSQARU
1993
Springer
15 years 11 months ago
1993
Springer
Abstract. This paper discusses the relationship between incidence calculus and the ATMS. It shows that managing labels for statements in an ATMS is similar to producing the inciden...
184
click to vote
LOPSTR
1994
Springer
15 years 11 months ago
1994
Springer
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...