DBScholar

Back to papers

Negation and Minimality in Non-Horn Databases

Summary: Combines constructive rule-based failure-to-prove reasoning with syntax-independent closed-world inference to generalize negation semantics for non-Horn databases, enforcing minimal negative consequences. Proposes well-founded, computationally tractable semantics as a principled alternative to classic CWA. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
994
Venue
PODS
Year
1993
Pagerank
6.0262735e-05
Overall Rank
5,964 | 59.09%
DOI
10.1145/153850.153863

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{schaerf_pods93,
        address = {New York, NY, USA},
        series = {{PODS} '93},
        title = {{Negation and Minimality in Non-Horn Databases}},
        url = {https://dl.acm.org/doi/10.1145/153850.153863},
        doi = {10.1145/153850.153863},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Schaerf, Marco},
        year = {1993}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,563 Complexity Aspects of Various Semantics for Disjunctive Databases 1993 PODS 5.5958254e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers