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.00014440736
Overall Rank: 1,051 | 92.70%
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,688	Automata Theory for Database Theoreticians	1989	PODS	0.00010913301
2,339	Inference of Monotonicity Constraints in Datalog Programs (Extended Abstract)	1989	PODS	9.005745e-05
2,786	An Axiomatic Approach to Deciding Query Safety in Deductive Databases	1988	PODS	8.1283801e-05
3,010	A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract)	1988	SIGMOD	7.7205569e-05
3,316	Temporal Deductive Databases and Infinite Objects	1988	PODS	7.2298413e-05
3,435	Inference of Inequality Constraints in Logic Programs (Extended Abstract)	1991	PODS	7.0966834e-05
3,853	Relational Specifications of Infinite Query Answers	1989	SIGMOD	6.7004022e-05
4,136	Safety of Datalog Queries over Infinite Databases	1989	PODS	6.4188795e-05
4,379	Safe Constraint Queries	1998	PODS	6.2397591e-05
5,943	Safety and Translation of Calculus Queries with Scalar Functions (Extended Abstract)	1993	PODS	5.2629428e-05
6,417	Optimizing Existential Datalog Queries	1988	PODS	5.0717071e-05
6,452	Reasoning about Strings in Databases	1994	PODS	5.0575385e-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
452	CONVERGENCE OF SIDEWAYS QUERY EVALUATION (Extended Abstract)	1986	PODS	0.00022799064

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
2,712	Query Processing in Deductive Databases with Incomplete Information	1986	SIGMOD	8.2488274e-05
2,347	Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases	1989	PODS	8.9890664e-05
365	On the Power of Magic	1987	PODS	0.00025585898
7,070	On the Decidability of Containment of Recursive Datalog Queries - Preliminary report	2004	PODS	4.843579e-05
77	An Amateur's Introduction to Recursive Query Processing Strategies	1986	SIGMOD	0.00057043861
4,379	Safe Constraint Queries	1998	PODS	6.2397591e-05
6,382	Finite Queries do not Have Effective Syntax	1995	PODS	5.0890445e-05
4,136	Safety of Datalog Queries over Infinite Databases	1989	PODS	6.4188795e-05
3,853	Relational Specifications of Infinite Query Answers	1989	SIGMOD	6.7004022e-05
2,786	An Axiomatic Approach to Deciding Query Safety in Deductive Databases	1988	PODS	8.1283801e-05