Sciweavers

1188 search results - page 58 / 238
» Testing Semantics: Connecting Processes and Process Logics
Sort
View
SSDBM
2002
IEEE
128views Database» more  SSDBM 2002»
15 years 8 months ago
Compressing Bitmap Indexes for Faster Search Operations
In this paper, we study the effects of compression on bitmap indexes. The main operations on the bitmaps during query processing are bitwise logical operations such as AND, OR, N...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
SEMWEB
2001
Springer
15 years 8 months ago
Utilizing Host-Formalisms to Extend RDF-Semantics
Abstract. RDF may be considered as an application of XML intended to interoperably exchange semantics between Web applications. In its current form, this objective may be hard to r...
Wolfram Conen, Reinhold Klapsing
137
Voted
PPDP
2004
Springer
15 years 9 months ago
A semantics for tracing declarative multi-paradigm programs
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...
Bernd Brassel, Michael Hanus, Frank Huch, Germ&aac...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 7 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
IJCAI
2007
15 years 5 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...