Database Paper Browser

Back to papers

Explicit Control of Logic Programs Through Rule Algebra

Summary: Shows syntax alone can't fix intended models in logic programs; introduces a rule algebra for explicit user control of execution. Gives a translation from algebraic specs to locally stratified programs with a homomorphism guaranteeing faithful, implementable control. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
820
Venue
PODS
Year
1988
Pagerank
6.4076785e-05
Overall Rank
4,145 | 71.20%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
2,748 On Implementing a Language for Specifying Active Database Execution Models 1993 VLDB 8.180685e-05
3,210 Integrating Object-Oriented Data Modeling with a Rule-Based Programming Paradigm 1990 SIGMOD 7.378759e-05
4,744 Semantics and Expressiveness Issues in Active Databases 1995 PODS 5.9487921e-05
5,278 Managing Conflicts between Rules 1996 PODS 5.5857593e-05
12,898 Knowledgebase Transformations 1992 PODS 4.1905499e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
552 Why Not Negation By Fixpoint? 1988 PODS 0.00020309855
Previous Page 1 / 1 Next

Semantically Similar Papers