The DOI matches its Crossref record.
Classical negation in logic programs and disjunctive databases
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Computable Functions in ASP: Theory and Implementation
Calimeri, F., Cozza, S., Ianni, G., & Leone, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89982-2_37 · Cited by 120
Constraint Answer Set Programming without Grounding
ARIAS, J., CARRO, M., SALAZAR, E., MARPLE, K., & GUPTA, G. (2018) · Theory and Practice of Logic Programming · doi:10.1017/s1471068418000285 · Cited by 88
Exploiting Answer Set Programming with External Sources for Meta-Interpretive Learning
KAMINSKI, T., EITER, T., & INOUE, K. (2018) · Theory and Practice of Logic Programming · doi:10.1017/s1471068418000261 · Cited by 29
Learning higher-order logic programs
Cropper, A., Morel, R., & Muggleton, S. (2020) · Machine Learning · doi:10.1007/s10994-019-05862-7 · Cited by 11
“ng these constraints. ASP solvers typically work in two phases: (1) a grounding phase, where rules are grounded, and (2) a solving phase, where reasoning on (propositional) rules leads to answer sets [19]. A straightforward ASP encoding of the MIL problem is infeasible in many cases, for reasons such as the grounding…”
Background
Metadata
- Authors
- Gelfond, M., & Lifschitz, V.
- Venue
- New Generation Computing
- Published
- 1991-08
- Volume
- 9
- Issue
- 3-4
- Pages
- 365-385
- ISSN
- 0288-3635 (ISSN-L)
- 1882-7055
- OpenAlex
- W2076698873
- Cited by
- 2,259
- References
- 0
- FWCI
- 19.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Classical negation in logic programs and disjunctive databases. https://app.cochat.ai/papers/10.1007/bf03037169
- The paper
- Gelfond, M., & Lifschitz, V. (1991). Classical negation in logic programs and disjunctive databases. New Generation Computing. https://doi.org/10.1007/bf03037169
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
