DBScholar

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
848
Venue
PODS
Year
1989
Pagerank
8.5305658e-05
Overall Rank
2,474 | 83.03%
DOI
10.1145/73721.73725

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bry_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{Logic Programming as Constructivism: A Formalization and its Application to Databases}},
        url = {https://dl.acm.org/doi/10.1145/73721.73725},
        doi = {10.1145/73721.73725},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bry, Franois},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Rank Citing Paper Year Venue Pagerank
1,419 Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model 1989 PODS 0.00010830412
1,714 Modular Stratification and Magic Sets for DATALOG Programs with Negation 1990 PODS 9.9404301e-05
8,295 The Expressive Powers of the Logic Programming Semantics 1990 PODS 5.4574671e-05
8,621 Three-Valued Formalization of Logic Programming: Is It Needed? 1990 PODS 5.3986999e-05
12,810 Soft Stratification for Magic Set Based Query Evaluation in Deductive Databases 2003 PODS 5.093636e-05
13,117 Backward chaining evaluation in stratified disjunctive theories 1990 PODS 5.093636e-05
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.

Rank Cited Paper Year Venue Pagerank
16 MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) 1986 PODS 0.00060089598
344 On the Power of Magic 1987 PODS 0.00020659405
1,419 Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model 1989 PODS 0.00010830412
3,730 Safety and Correct Translation of Relational Calculus Formulas 1987 PODS 7.1668598e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 16 MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) 1986 PODS
2 174 Decidability And Expressiveness Aspects Of Logic Queries 1987 PODS
3 799 Logic Programming With Sets 1987 PODS
4 544 A New Approach to Database Logic 1984 PODS
5 4,263 Explicit Control of Logic Programs Through Rule Algebra 1988 PODS
6 12,991 Structural Totality and Constraint Stratification 1995 PODS
7 1,714 Modular Stratification and Magic Sets for DATALOG Programs with Negation 1990 PODS
8 5,210 On the Expressive Power of Logic Programming Languages with Sets 1988 PODS
9 7,536 Database Updates in Logic Programming 1988 PODS
10 1,419 Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model 1989 PODS