DBScholar

Back to papers

Horn Clauses and the Fixpoint Query Hierarchy

Summary: Horn-clause logic programs exactly capture YE+ — queries obtained by applying a fixpoint to positive-existential formulas — hence they are not generally first-order nor do they subsume all FO queries. With a proposed negation semantics, clausal queries = FP, i.e., FO closed under fixpoints and negation. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
621
Venue
PODS
Year
1982
Pagerank
0.00013402577
Overall Rank
888 | 93.91%
DOI
10.1145/588111.588137

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chandra_pods82,
        address = {New York, NY, USA},
        series = {{PODS} '82},
        title = {{Horn Clauses and the Fixpoint Query Hierarchy}},
        url = {https://dl.acm.org/doi/10.1145/588111.588137},
        doi = {10.1145/588111.588137},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Chandra, Ashok K. and Harel, David},
        year = {1982}
}

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers