The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Answer Set Solving in Practice
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652
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
Slaney, J., & Thiébaux, S. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00079-5 · Cited by 226
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
Cited by
Clingo = ASP + Control: Preliminary Report
Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014) · arXiv · doi:10.48550/arxiv.1405.3694 · Cited by 230
Self-citationInductive Learning of Answer Set Programs
Law, M., Russo, A., & Broda, K. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-11558-0_22 · Cited by 133
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83
“Most ASP solvers (Gebser et al., 2012), in principle, always terminates (unlike Prolog query evaluation, which may lead to an infinite loop).”
BackgroundEvans, R., Hernández-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2020.103438 · Cited by 58
Metadata
- Authors
- Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T.
- Venue
- Synthesis Lectures on Artificial Intelligence and Machine Learning
- Publisher
- Springer International Publishing
- Published
- 2013
- ISSN
- 1939-4608 (ISSN-L)
- 1939-4616
- OpenAlex
- W2071784417
- Cited by
- 195
- References
- 5
- FWCI
- 7.82
- Type
- book
- 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: Answer Set Solving in Practice. https://app.cochat.ai/papers/10.1007/978-3-031-01561-8
- The paper
- Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2013). Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. https://doi.org/10.1007/978-3-031-01561-8
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.