2519 search results - page 278 / 504 » Reasoning with Textual Cases |
211
click to vote
DLOG
2007
15 years 9 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
213
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present decision procedures for logical constraints involving collections such as sets, multisets, and fuzzy sets. Element membership in our collections is given by ch...
177
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
136
click to vote
CSL
2008
Springer
15 years 8 months ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
159
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...