Horn Clauses and the Fixpoint Query Hierarchy
Summary: Horn-clause logic programs exactly capture YE+ — queries obtained by applying a fixpoint to positive-existential formulas — hence they are not generally first-order nor do they subsume all FO queries. With a proposed negation semantics, clausal queries = FP, i.e., FO closed under fixpoints and negation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ashok K. Chandra
- 2. David Harel
Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 299 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00028555103 |
| 541 | Parallel Evaluation of Recursive Rule Queries | 1986 | PODS | 0.00020586706 |
| 1,329 | Data Constructors: On the Integration of Rules and Relations | 1985 | VLDB | 0.00012563614 |
| 1,552 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD | 0.00011393892 |
| 1,833 | The Expressiveness of a Family of Finite Set Languages | 1991 | PODS | 0.00010365844 |
| 2,715 | Query Processing in Deductive Databases with Incomplete Information | 1986 | SIGMOD | 8.2411079e-05 |
| 2,808 | On the Expressive Power of Database Queries with Intermediate Types | 1988 | PODS | 8.0939851e-05 |
| 4,884 | Translation And Optimization Of Logic Queries: The Algebraic Approach | 1986 | VLDB | 5.8511369e-05 |
| 9,833 | Magic Functions : A Technique To Optimize Extended Datalog Recursive Programs | 1987 | VLDB | 4.2710095e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,856 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD | 6.6938945e-05 |
| 12,980 | Computing Facts In Non-Horn Deductive Systems. | 1988 | VLDB | 4.1905499e-05 |
| 5,102 | On the Expressive Power of Logic Programming Languages with Sets | 1988 | PODS | 5.6936517e-05 |
| 3,855 | Negation and Minimality in Non-Horn Databases | 1993 | PODS | 6.6953111e-05 |
| 1,983 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS | 9.8694826e-05 |
| 4,754 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS | 5.9377721e-05 |
| 3,739 | Towards a Real Horn Clause Language | 1988 | VLDB | 6.7979486e-05 |
| 8,328 | Negation as Failure for First-Order Queries (Extended Abstract) | 1986 | PODS | 4.5392079e-05 |
| 1,208 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS | 0.00013272698 |
| 173 | Decidability And Expressiveness Aspects Of Logic Queries | 1987 | PODS | 0.00038731283 |