The DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
Conflict-driven answer set solving: From theory to practice
Open accessOverview
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
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
(1988) · Cited by 3,452
A machine program for theorem-proving
Davis, M., Logemann, G., & Loveland, D. (1962) · Communications of the ACM · doi:10.1145/368273.368557 · Cited by 3,220
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
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
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
Classical negation in logic programs and disjunctive databases
Gelfond, M., & Lifschitz, V. (1991) · New Generation Computing · doi:10.1007/bf03037169 · Cited by 2,259
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
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
Dechter, R. (2003) · Cited by 1,518
Cited by
Meneco, a Topology-Based Gap-Filling Tool Applicable to Degraded Genome-Wide Metabolic Networks
Prigent, S., Frioux, C., Dittami, S. M., Thiele, S., Larhlimi, A., Collet, G., Gutknecht, F., Got, J., Eveillard, D., Bourdon, J., et al. (2017) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1005276 · Cited by 88
“Minimize This combinatorial problem, expressed as a logic encoding, is solved by the ASP solver clasp 3.0.5 [39] with domain specific heuristics i.e. search space exploration strategies, preserving correctness and completeness of the search procedure.”
InfluentialInductive 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).”
BackgroundInductive logic programming at 30
Cropper, A., Dumančić, S., Evans, R., & Muggleton, S. H. (2022) · Machine Learning · doi:10.1007/s10994-021-06089-1 · Cited by 61
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
Schüller, P., & Benz, M. (2018) · Machine Learning · doi:10.1007/s10994-018-5708-2 · Cited by 21
Metadata
- Authors
- Gebser, M., Kaufmann, B., & Schaub, T.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2012-08
- Volume
- 187-188
- Pages
- 52-89
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2049791401
- Cited by
- 327
- References
- 72
- FWCI
- 26.28
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Conflict-driven answer set solving: From theory to practice. https://app.cochat.ai/papers/10.1016/j.artint.2012.04.001
- The paper
- Gebser, M., Kaufmann, B., & Schaub, T. (2012). Conflict-driven answer set solving: From theory to practice. Artificial Intelligence. https://doi.org/10.1016/j.artint.2012.04.001
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.