10997 search results - page 126 / 2200 » On the Structure of Complete Sets |
139
click to vote
DEBU
2010
15 years 6 months ago
2010
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
158
click to vote
TABLEAUX
2007
Springer
16 years 8 days ago
2007
Springer
We construct a sound, complete, and terminating tableau system for the interval temporal logic D · interpreted in interval structures over dense linear orderings endowed with stri...
175
click to vote
JAIR
2008
15 years 6 months ago
2008
Multi-robot path planning is difficult due to the combinatorial explosion of the search space with every new robot added. Complete search of the combined state-space soon intracta...
146
click to vote
TCS
2002
15 years 5 months ago
2002
We study proof systems for reasoning about logical consequences and refinement of structured specifications, based on similar systems proposed earlier in the literature [ST 88, Wi...
153
click to vote
VMCAI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present an analysis to verify abstract set specifications for programs that use object field values to determine the membership of objects in abstract sets. In our a...