On the power of rule-based languages with sets

@inproceedings{Vadaparty1991OnTP,
  title={On the power of rule-based languages with sets},
  author={K. Vadaparty},
  booktitle={PODS '91},
  year={1991}
}
of Rule-Based Languages with Sets Kumar Vadaparty Department of Computer Science, Rutgers University, New Brunswick, NJ08903 (kumarv@paul.rutgers. edu) This paper studies the data complem”ty and expressibility of COL and the “finite versions” of LDL, ELPS and IQL. We distinguish between different “levels” of each of these languages and show that the data complem-ty of each k-level language is complete for the k ‘th level of the hyper-exponential time. We also show that with a given dom~”n order… Expand
Expressive Power and Data Complexity of Nonrecursive Logic Programming
Matching of Bounded Set Terms in the Logic Language LDL++
Complexity of Query Answering in Logic Databases with Complex Values
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
Towards a unified visual database access
Querying Design and Planning Databases
Set-Term Matching in Logic Programming
Complexity and expressive power of logic programming
Reflective programming in the relational algebra
...
1
2
...

References

SHOWING 1-2 OF 2 REFERENCES
The complexity of relational query languages (Extended Abstract)
Theory of database queries