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.
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
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
Knowledge Representation, Reasoning and Declarative Problem Solving
Baral, C. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511543357 · Cited by 1,413
GRASP: a search algorithm for propositional satisfiability
Marques-Silva, J. P., & Sakallah, K. A. (1999) · IEEE Transactions on Computers · doi:10.1109/12.769433 · Cited by 1,374
On the Complexity of Derivation in Propositional Calculus
Tseitin, G. S. (1983) · Springer eBooks · doi:10.1007/978-3-642-81955-1_28 · Cited by 1,211
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
Satisfiability Modulo Theories
Barrett, C., & Tinelli, C. (2018) · Handbook of Model Checking · doi:10.1007/978-3-319-10575-8_11 · Cited by 1,122
Handbook of Satisfiability: Second Edition
(2021) · Frontiers in Artificial Intelligence and Applications · doi:10.3233/faia336 · Cited by 1,038
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Dowling, W. F., & Gallier, J. H. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90014-1 · Cited by 1,013
Foundations of Deductive Databases and Logic Programming
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07699-2 · Cited by 974
Handbook of Knowledge Representation
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)x0300-6 · Cited by 883
Geneste, L. (2004) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2004.08.021 · Cited by 861
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
Logic programs with stable model semantics as a constraint programming paradigm
Niemelä, I. (1999) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018930122475 · Cited by 834
Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006) · Journal of the ACM · doi:10.1145/1217856.1217859 · Cited by 783
Stable Models and an Alternative Logic Programming Paradigm
Marek, V. W., & Truszczyński, M. (1999) · Artificial Intelligence · doi:10.1007/978-3-642-60085-2_17 · Cited by 739
Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
Zhang, L., Madigan, C. F., Moskewicz, M. H., & Malik, S. (2001) · Cited by 681
Translating Pseudo-Boolean Constraints into SAT
Eén, N., & Sörensson, N. (2006) · Journal on Satisfiability, Boolean Modeling and Computation · doi:10.3233/sat190014 · Cited by 587
Predicting learnt clauses quality in modern SAT solvers
Audemard, G., & Simon, L. (2009) · Cited by 498
Potassco: The Potsdam Answer Set Solving Collection
Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., & Schneider, M. (2011) · AI Communications · doi:10.3233/aic-2011-0491 · Cited by 456
Self-citationAnswer set programming and plan generation
Lifschitz, V. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00186-8 · Cited by 442
Optimal speedup of Las Vegas algorithms
Luby, M. G., Sinclair, A., & Zuckerman, D. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90029-9 · Cited by 388
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 answer set solving
Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. H. (2007) · publish.UP (University of Potsdam) · Cited by 374
Self-citationConflict-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
Nested expressions in logic programs
Lifschitz, V., Tang, L. R., & Turner, H. (1999) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018978005636 · Cited by 324
Consistency of Clark's completion and existence of stable models.
Fages, F. (1994) · Cited by 317
clasp: 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-citationZhang, L., & Malik, S. (2003) · doi:10.5555/789083.1022835 · Cited by 278
Improvements to propositional satisfiability search algorithms
Freeman, J. (1995) · Cited by 265
Semantics and complexity of recursive aggregates in answer set programming
Faber, W., Pfeifer, G., & Leone, N. (2011) · Artificial Intelligence · doi:10.1016/j.artint.2010.04.002 · Cited by 240
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
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
Leone, N., Rullo, P., & Scarcello, F. (1997) · Information and Computation · doi:10.1006/inco.1997.2630 · Cited by 192
Logic programming and knowledge representation—The A-Prolog perspective
Gelfond, M., & Leone, N. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00207-2 · Cited by 188
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 143
Some (in)translatability results for normal logic programs and propositional theories
Janhunen, T. (2006) · Journal of Applied Non-Classical Logics · doi:10.3166/jancl.16.35-86 · Cited by 135
Knowledge Representation, Reasoning and Declarative Problem Solving
Andrew, A. M. (2004) · Kybernetes · doi:10.1108/k.2004.06733aae.001 · Cited by 128
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-citationThe Second Answer Set Programming Competition
Denecker, M., Vennekens, J., Bond, S., Gebser, M., & Truszczyński, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04238-6_75 · Cited by 114
Self-citationA transitive closure algorithm
Purdom, P. W. (1970) · BIT Numerical Mathematics · doi:10.1007/bf01940892 · Cited by 114
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 108
Self-citationA model-theoretic counterpart of loop formulas
Lee, J. (2005) · International Joint Conference on Artificial Intelligence · Cited by 102
Marek, W., & Subrahmanian, V. S. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90019-c · Cited by 89
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-citationCompact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
Janhunen, T., & Niemelä, I. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20832-4_8 · Cited by 66
Special Issue on Answer Set Programming
Schaub, T. H., & Woltran, S. (2018) · Künstliche Intell. · doi:10.1007/s13218-018-0554-8 · Cited by 63
Self-citationTableau Calculi for Answer Set Programming
Gebser, M., & Schaub, T. H. (2006) · Lecture notes in computer science · doi:10.1007/11799573_4 · Cited by 52
Self-citationAnswer Set Programming for Single-Player Games in General Game Playing
Thielscher, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-02846-5_28 · Cited by 51
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
Mariën, M., Wittocx, J., Denecker, M., & Bruynooghe, M. (2008) · Springer eBooks · doi:10.1007/978-3-540-79719-7_20 · Cited by 44
Circumscriptive event calculus as answer set programming
Kim, T., Lee, J., & Palla, R. (2009) · Cited by 39
The nomore + + Approach to Answer Set Solving
Anger, C., Gebser, M., Linke, T., Neumann, A., & Schaub, T. H. (2005) · Lecture notes in computer science · doi:10.1007/11591191_8 · Cited by 34
Self-citationAdvanced 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-citationAbstract answer set solvers with backjumping and learning
Lierler, Y. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068410000578 · Cited by 30
A backjumping technique for disjunctive logic programming
Ricca, F., Faber, W., & Leone, N. (2006) · Cited by 29
Approaching the core of unfounded sets
Anger, C., Gebser, M., & Schaub, T. H. (2006) · publish.UP (University of Potsdam) · Cited by 22
Self-citationGebser, M., & Schaub, T. H. (2005) · Lecture notes in computer science · doi:10.1007/11546207_5 · Cited by 22
Self-citationPruning Operators for Disjunctive Logic Programming Systems
Calimeri, F., Faber, W., Pfeifer, G., & Leone, N. (2006) · Fundamenta Informaticae · doi:10.3233/fun-2006-712-303 · Cited by 22
Ishebabi, 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-citationElementary Sets for Logic ProgramsPreprint
Gebser, M., Lee, J., & Lierler, Y. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2307.09168 · Cited by 17
Self-citationComputing Loops with at Most One External Support Rule
Chen, X., Ji, J., & Lin, F. (2013) · ACM Transactions on Computational Logic · doi:10.1145/2422085.2422088 · Cited by 12
Heuristics in Conflict ResolutionPreprint
Drescher, C., Gebser, M., Kaufmann, B., & Schaub, T. H. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1005.1716 · Cited by 7
Self-citation
Cited by
Answer Set Solving in Practice
Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. H. (2012) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00457ed1v01y201211aim019 · Cited by 288
Self-citationMeneco, 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
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
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.