Computing Facts in Non-Horn Deductive Systems
Summary: Transforms arbitrary Horn/non-Horn clause sets into singleton-head rules (SH(S)). For an atomic query, only a relevant Horn subset needs evaluation, yielding a sound-and-complete reduction for computing all entailed ground facts. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Eliezer L. Lozinskii (The Hebrew University)
BibTeX Citation
@article{lozinskii_vldb88,
title = {{Computing Facts in Non-Horn Deductive Systems}},
author = {Lozinskii, Eliezer L.},
journal = {PVLDB},
series = {{VLDB} '88},
pages = {273},
year = {1988}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 18 | MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) | 1986 | PODS | 0.00059023577 |
| 349 | A Message Passing Framework for Logical Query Evaluation | 1986 | SIGMOD | 0.00020255174 |
| 352 | On the Power of Magic | 1987 | PODS | 0.00020223279 |
| 440 | On the Implementation of a Simple Class of Logic Queries for Databases | 1986 | PODS | 0.00018227953 |
| 2,099 | Evaluation Of Database Recursive Logic Programs As Recurrent Function Series | 1986 | SIGMOD | 9.0515975e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,087 | Negation and Minimality in Non-Horn Databases | 1993 | PODS |
| 2 | 3,083 | An Axiomatic Approach to Deciding Query Safety in Deductive Databases | 1988 | PODS |
| 3 | 4,326 | Relational Specifications of Infinite Query Answers | 1989 | SIGMOD |
| 4 | 1,534 | Safety of Recursive Horn Clauses With Infinite Relations | 1987 | PODS |
| 5 | 5,725 | Hypothetical Datalog: Negation and Linear Recursion | 1989 | PODS |
| 6 | 5,283 | Rewriting of Rules Containing Set Terms in a Logic Data Language (LDL) | 1988 | PODS |
| 7 | 913 | Horn Clauses and the Fixpoint Query Hierarchy | 1982 | PODS |
| 8 | 2,965 | Horn Tables - An Efficient Tool For Handling Incomplete Information In Databases | 1989 | PODS |
| 9 | 3,582 | Query Processing in Deductive Databases with Incomplete Information | 1986 | SIGMOD |
| 10 | 863 | The Representation and Deductive Retrieval of Complex Objects | 1985 | VLDB |