Safety of Recursive Horn Clauses With Infinite Relations

Summary: Decidability: safety of recursive pure Horn-clause queries becomes decidable when function-symbol terms are modeled as distinct uninterpreted infinite predicates constrained by finiteness dependencies. Also gives a sufficient safety criterion under monotonicity constraints. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 807
Venue: PODS
Year: 1987
Pagerank: 0.00014426218
Overall Rank: 1,049 | 92.72%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,687	Automata Theory for Database Theoreticians	1989	PODS	0.0001090256
2,343	Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract)	1989	PODS	8.9968717e-05
2,790	An Axiomatic Approach to Deciding Query Safety in Deductive Databases	1988	PODS	8.1203289e-05
3,012	A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract)	1988	SIGMOD	7.7129076e-05
3,318	Temporal Deductive Databases and Infinite Objects	1988	PODS	7.2227559e-05
3,440	Inference of Inequality Constraints in Logic Programs (Extended Abstract)	1991	PODS	7.0897313e-05
3,856	Relational Specifications of Infinite Query Answers	1989	SIGMOD	6.6938945e-05
4,138	Safety of Datalog Queries over Infinite Databases	1989	PODS	6.4127061e-05
4,376	Safe Constraint Queries	1998	PODS	6.233754e-05
5,946	Safety and Translation of Calculus Queries with Scalar Functions (Extended Abstract)	1993	PODS	5.2578843e-05
6,412	Optimizing Existential Datalog Queries	1988	PODS	5.0668361e-05
6,449	Reasoning about Strings in Databases	1994	PODS	5.0526628e-05

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
459	CONVERGENCE OF SIDEWAYS QUERY EVALUATION (Extended Abstract)	1986	PODS	0.00022684266

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,352	Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases	1989	PODS	8.9815852e-05
2,715	Query Processing in Deductive Databases with Incomplete Information	1986	SIGMOD	8.2411079e-05
359	On the Power of Magic	1987	PODS	0.00025830228
7,066	On the Decidability of Containment of Recursive Datalog Queries - Preliminary report	2004	PODS	4.8389293e-05
79	An Amateur's Introduction to Recursive Query Processing Strategies	1986	SIGMOD	0.00056010993
4,376	Safe Constraint Queries	1998	PODS	6.233754e-05
6,380	Finite Queries do not Have Effective Syntax	1995	PODS	5.0841675e-05
4,138	Safety of Datalog Queries over Infinite Databases	1989	PODS	6.4127061e-05
3,856	Relational Specifications of Infinite Query Answers	1989	SIGMOD	6.6938945e-05
2,790	An Axiomatic Approach to Deciding Query Safety in Deductive Databases	1988	PODS	8.1203289e-05