Database Paper Browser

Back to papers

Query Evaluation under the Well Founded Semantics (Extended Abstract)

Summary: SLG: a goal-directed extension of SLDNF that tables transformations to avoid positive/negative loops and repeated evaluation, ensuring termination for bounded-term-size programs. Sound and ideally complete for non‑floundering queries under three‑valued (incl. well‑founded) semantics, polytime data complexity for well‑founded negation, and Prolog-compatible. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
997
Venue
PODS
Year
1993
Pagerank
4.1945683e-05
Overall Rank
12,856 | 10.57%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
12,838 XSB as an Efficient Deductive Database Engine 1994 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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