Database Paper Browser

Back to papers

Logic Programming as Constructivism: A Formalization and its Application to Databases

Summary: Develops a constructivist proof theory for non-Horn logic programming, reinterpreting stratification and introducing the larger classes of ‘loosely stratified’ and ‘constructively consistent’ programs. Provides DB‑focused consequences: defines ‘constructively domain independent’ quantified formulas and extends Generalized Magic Sets to these larger classes via a conditional‑fixpoint procedure. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
849
Venue
PODS
Year
1989
Pagerank
9.8794371e-05
Overall Rank
1,979 | 86.24%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

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