The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Potassco: The Potsdam Answer Set Solving Collection
Abstract
Answer Set Programming (ASP; [5]) has become a popular approach to declarative problem solving in the field of Knowledge Representation and Reasoning (KRR; [79]). This is mainly due to its appealing combination
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
Cites
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
(1988) · Cited by 3,452
Chaff: engineering an efficient SAT solver
Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., & Malik, S. (2001) · Proceedings of the 38th conference on Design automation - DAC '01 · doi:10.1145/378239.379017 · Cited by 2,940
Eén, N., & Sörensson, N. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24605-3_37 · Cited by 2,629
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Dechter, R. (2003) · Cited by 1,518
Knowledge Representation, Reasoning and Declarative Problem Solving
Baral, C. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511543357 · Cited by 1,413
The DLV system for knowledge representation and reasoning
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006) · ACM Transactions on Computational Logic · doi:10.1145/1149114.1149117 · Cited by 1,151
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
The computational complexity of propositional STRIPS planning
Bylander, T. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90081-7 · Cited by 865
Cited by
Conflict-driven answer set solving: From theory to practice
Gebser, M., Kaufmann, B., & Schaub, T. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.04.001 · Cited by 327
Self-citationFormalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco
Moritz, D., Wang, C., Nelson, G. L., Lin, H., Smith, A. M., Howe, B., & Heer, J. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2865240 · Cited by 317
Multi-shot ASP solving with clingo
GEBSER, M., KAMINSKI, R., KAUFMANN, B., & SCHAUB, T. (2019) · Theory and Practice of Logic Programming · doi:10.1017/s1471068418000054 · Cited by 309
Self-citationClingo = 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
Metadata
- Authors
- Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., & Schneider, M.
- Venue
- AI Communications
- Publisher
- SAGE Publications
- Published
- 2011
- Volume
- 24
- Issue
- 2
- Pages
- 107-124
- ISSN
- 0921-7126 (ISSN-L)
- OpenAlex
- W1482532598
- Cited by
- 456
- References
- 44
- FWCI
- 42.28
- 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: Potassco: The Potsdam Answer Set Solving Collection. https://app.cochat.ai/papers/10.3233/aic-2011-0491
- The paper
- Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., & Schneider, M. (2011). Potassco: The Potsdam Answer Set Solving Collection. AI Communications. https://doi.org/10.3233/aic-2011-0491
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.