Sciweavers

2981 search results - page 117 / 597
» Answer Set Planning
Sort
View
150
Voted
SOFSEM
2007
Springer
15 years 9 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
121
Voted
PODS
2003
ACM
114views Database» more  PODS 2003»
16 years 3 months ago
Soft stratification for magic set based query evaluation in deductive databases
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
Andreas Behrend
105
Voted
CIE
2005
Springer
15 years 9 months ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
ECSQARU
2001
Springer
15 years 8 months ago
Reasoning about Knowledge Using Rough Sets
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
Weiru Liu
116
Voted
WCRE
2007
IEEE
15 years 9 months ago
Visualizing Software Architecture Evolution Using Change-Sets
When trying to understand the evolution of a software system it can be useful to visualize the evolution of the system’s architecture. Existing tools for viewing architectural e...
Andrew McNair, Daniel M. Germán, Jens H. We...