Incremental Answer Set Programming with Overgrounding
- DOI
- 10.1017/s1471068419000292
- Published
- 2019-09
- Container
- Theory and Practice of Logic Programming
- Publisher
- Cambridge University Press (CUP)
- Open access
- unknown
Credibility signals
uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.1017/s1471068419000292,
title = {Incremental Answer Set Programming with Overgrounding},
author = {FRANCESCO CALIMERI and GIOVAMBATTISTA IANNI and FRANCESCO PACENZA and SIMONA PERRI and JESSICA ZANGARI},
year = {2019},
journal = {Theory and Practice of Logic Programming},
doi = {10.1017/s1471068419000292},
url = {https://doi.org/10.1017/s1471068419000292}
}RIS
TY - JOUR TI - Incremental Answer Set Programming with Overgrounding AU - FRANCESCO CALIMERI AU - GIOVAMBATTISTA IANNI AU - FRANCESCO PACENZA AU - SIMONA PERRI AU - JESSICA ZANGARI PY - 2019 JO - Theory and Practice of Logic Programming DO - 10.1017/s1471068419000292 UR - https://doi.org/10.1017/s1471068419000292 ER -
APA
CALIMERI, F., IANNI, G., PACENZA, F., PERRI, S., & ZANGARI, J. (2019). Incremental Answer Set Programming with Overgrounding. Theory and Practice of Logic Programming. https://doi.org/10.1017/s1471068419000292
Source records
- crossref · retrieved 2026-09-25T12:54:06.085Z