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.
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
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
SATzilla: Portfolio-based Algorithm Selection for SAT
Xu, L., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2490 · Cited by 857
Extending and implementing the stable model semantics
Simons, P., Niemelä, I., & Soininen, T. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00187-x · Cited by 841
(2021) · Artificial Intelligence · doi:10.1142/9789811223723_0002 · Cited by 813
(2024) · Multivariate Biomarker Discovery · doi:10.1017/9781009006767.012 · Cited by 809
Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006) · Journal of the ACM · doi:10.1145/1217856.1217859 · Cited by 783
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
Biere, A., Heule, M. J. H., van Maaren, H., & Walsh, T. (2021) · Cited by 486
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., & Turner, H. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2002.12.001 · Cited by 454
Answer set programming and plan generation
Lifschitz, V. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00186-8 · Cited by 442
Temporal Induction by Incremental SAT Solving
Eén, N., & Sörensson, N. (2003) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)82542-3 · Cited by 382
Conflict-Driven Clause Learning SAT Solvers
Joao, M.-S., Ines, L., & Sharad, M. (2009) · Frontiers in Artificial Intelligence and Applications · doi:10.3233/978-1-58603-929-5-131 · Cited by 324
Consistency of Clark's completion and existence of stable models.
Fages, F. (1994) · Cited by 317
Conflict-driven answer set solving
Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. H. (2007) · Cited by 301
Self-citationclasp: A Conflict-Driven Answer Set Solver
Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. H. (2007) · Springer eBooks · doi:10.1007/978-3-540-72200-7_23 · Cited by 286
Self-citationImprovements to propositional satisfiability search algorithms
Freeman, J. (1995) · Cited by 265
An A-Prolog Decision Support System for the Space Shuttle
Nogueira, M. L., Balduccini, M., Gelfond, M., et al. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45241-9_12 · Cited by 232
A Lightweight Component Caching Scheme for Satisfiability Solvers
Pipatsrisawat, K., & Darwiche, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72788-0_28 · Cited by 220
Answer Set Programming Based on Propositional Satisfiability
Giunchiglia, E., Lierler, Y., & Marco Maratea, A. (2006) · Journal of Automated Reasoning · doi:10.1007/s10817-006-9033-2 · Cited by 159
Gebser, M., Kaminski, R., König, A., & Schaub, T. H. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20895-9_39 · Cited by 149
Self-citationThe Expressive Powers of the Logic Programming Semantics
Schlipf, J. S. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1053 · Cited by 132
Integrating answer set programming and constraint logic programming
Mellarkod, V. S., Gelfond, M., & Zhang, Y. (2008) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-009-9116-y · Cited by 124
Engineering an Incremental ASP Solver
Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T. H., & Thiele, S. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89982-2_23 · Cited by 121
Self-citationNear-Uniform Sampling of Combinatorial Spaces Using XOR Constraints
Gomes, C. P., Sabharwal, A., & Selman, B. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7503.003.0065 · Cited by 105
Detecting inconsistencies in large biological networks with answer set programming
Gebser, M., Schaub, T. H., Thiele, S., & Veber, P. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068410000554 · Cited by 90
Self-citationTowards an Integration of Answer Set and Constraint Solving
Baselice, S., Bonatti, P. A., & Gelfond, M. (2005) · Lecture notes in computer science · doi:10.1007/11562931_7 · Cited by 78
Conflict-driven disjunctive answer set solving
Drescher, C., Gebser, M., Grote, T., Kaufmann, B., König, A., Ostrowski, M., & Schaub, T. H. (2008) · Cited by 74
Self-citationReactive Answer Set Programming
Gebser, M., Grote, T., Kaminski, R., & Schaub, T. H. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20895-9_7 · Cited by 70
Self-citationDomain-dependent knowledge in answer set planning
Son, T. C., Baral, C. R., Tran, N., & McIlraith, S. A. (2006) · ACM Transactions on Computational Logic · doi:10.1145/1183278.1183279 · Cited by 59
Modeling Biological Networks by Action Languages via Answer Set Programming
Dworschak, S., Grell, S., Nikiforova, V. J., Schaub, T. H., & Selbig, J. (2008) · Constraints · doi:10.1007/s10601-007-9031-y · Cited by 57
Self-citationPlatypus: A Platform for Distributed Answer Set Solving
Gressmann, J., Janhunen, T., Mercer, R. E., Schaub, T. H., Thiele, S., & Tichy, R. (2005) · Lecture notes in computer science · doi:10.1007/11546207_18 · Cited by 35
Self-citationA translational approach to constraint answer set solving
Drescher, C., & Walsh, T. (2010) · Theory and Practice of Logic Programming · doi:10.1017/s1471068410000220 · Cited by 35
Issues in parallel execution of non-monotonic reasoning systems
Balduccini, M., Pontelli, E., Elkhatib, O., & Le, H. V. (2005) · Parallel Computing · doi:10.1016/j.parco.2005.03.004 · Cited by 33
Advanced Preprocessing for Answer Set Solving
Gebser, M., Kaufmann, B., André, N., & Schaub, T. H. (2008) · Frontiers in artificial intelligence and applications · doi:10.3233/978-1-58603-891-5-15 · Cited by 30
Self-citationIshebabi, H., Mahr, P., Bobda, C., Gebser, M., & Schaub, T. H. (2009) · International Journal of Reconfigurable Computing · doi:10.1155/2009/863630 · Cited by 21
Self-citation
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
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.