DBScholar

Back to papers

The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract)

Summary: Introduces the alternating fixpoint: a monotonic two-pass (underestimate→overestimate→underestimate) transformation for logic programs with negation whose fixpoint equals the well-founded partial model. Provides translations showing alternating-fixpoint programs capture least-fixpoint semantics of fixpoint logic and are expressively equivalent on finite structures. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
845
Venue
PODS
Year
1989
Pagerank
0.0001126031
Overall Rank
1,297 | 91.11%
DOI
10.1145/73721.73722

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{gelder_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/73721.73722},
        doi = {10.1145/73721.73722},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Van Gelder, Allen},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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