DBScholar

Back to papers

The Expressiveness of a Family of Finite Set Languages

Summary: Exactly characterizes SRL, a set-based queries+updates language, showing simple syntactic restrictions capture precisely P and LOGSPACE. Investigates ordering, proving Machiavelli's hom operator fails for some order-independent properties and advocating tractable finite-set reasoning. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
922
Venue
PODS
Year
1991
Pagerank
9.5928463e-05
Overall Rank
1,864 | 87.22%
DOI
10.1145/113413.113417

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{immerman_pods91,
        address = {New York, NY, USA},
        series = {{PODS} '91},
        title = {{The Expressiveness of a Family of Finite Set Languages}},
        url = {https://dl.acm.org/doi/10.1145/113413.113417},
        doi = {10.1145/113413.113417},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Immerman, Neil and Patnaik, Sushant and Stemple, David},
        year = {1991}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers