| |
Browse All Reviews > Information Systems (H) > Database Management (H.2) > Languages (H.2.3) > Datalog (H.2.3...)
|
|
 |
|
|
| |
|
|
| |
1-7 of 7
Reviews about "Datalog (H.2.3...)":
|
Date Reviewed |
| |
Complexity and expressive power of deterministic semantics for DATALOG
Greco S., Saccá D. Information and Computation 153(1): 81-98, 1999. Type: Article
Logic programs without function symbols are known as Datalog programs (with negation, but this qualification will be understood in what follows). A Datalog program, viewed as a logic formula, may have many models. Various special kinds...
|
Oct 1 1999 |
| |
Disjunctive datalog
Eiter T., Gottlob G., Mannila H. ACM Transactions on Database Systems 22(3): 364-418, 1997. Type: Article
Disjunctive Datalog is a variant of Datalog in which disjunctions may appear in the rule heads. The authors also allow negations in the rule bodies. This paper studies the properties of disjunctive logic programming in the context of d...
|
Aug 1 1998 |
| |
Modular stratification and magic sets for Datalog programs with negation
Ross K. Journal of the ACM 41(6): 1216-1266, 1994. Type: Article
Several semantics have been developed to handle rules in Datalog that contain negated atoms in their bodies. Prominent among these are the well-founded and the stable semantics. Both of these semantics permit rules that have recursion ...
|
Mar 1 1996 |
| |
On the complexity of equivalence between recursive and nonrecursive Datalog programs
Chaudhuri S., Vardi M. Principles of database systems (, Minneapolis, MN, May 24-26, 1994) 1161994. Type: Proceedings
First-order database query languages are lacking in expressive power. Datalog, the language of logic programs (Horn-clause programs), is essentially a fragment of fixpoint logic. In this paper, the authors study the effect of reasonabl...
|
Aug 1 1995 |
| |
Low-complexity aggregation in GraphLog and Datalog
Consens M., Mendelzon A. Theoretical Computer Science 116(1): 95-116, 1993. Type: Article
Constructs for computing aggregate functions along paths, as in an object-oriented system, or over sets of tuples, as in a homogeneous or set-oriented data model, are created. Aggregate functions such as count, sum, and <...
|
Dec 1 1994 |
| |
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
Revesz P. Theoretical Computer Science 116(1): 117-149, 1993. Type: Article
Revesz examines Datalog, generalized so that tuples can have associated integer order constraints. Such generalized tuples denote a possibly infinite set of ground tuples. For example, let R be a binary relation over...
|
Nov 1 1994 |
| |
Fundamental properties of deterministic and nondeterministic extensions of Datalog
Abiteboul S., Simon E. Theoretical Computer Science 78(1): 137-158, 1991. Type: Article
Datalog is described by the authors as a pure Horn clause “toy representative of logic-based query languages.” This paper presents extensions to Datalog that will allow negative literals to appear in rules, thus lay...
|
Jan 1 1992 |
| |
|
|
| |
|
|
