181 search results - page 17 / 37 » Effective characterizations of tree logics |
105
click to vote
LPNMR
1999
Springer
15 years 6 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
116
click to vote
VLDB
2000
ACM
15 years 5 months ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
98
Voted
IPPS
1997
IEEE
15 years 6 months ago
1997
IEEE
Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language)can re...
144
Voted
CACM
1998
15 years 1 months ago
1998
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
161
Voted
SPLC
2000
15 years 3 months ago
2000
The evolution tree model is a two-dimensional model that describes how the versions of the artifacts of a software product evolve. The propagation graph is a data structure that c...