Prolog and ASP Inference under One Roof
Open accessIntegrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
This ASP grounding approach leads to the grounding bottleneck problem, where grounding can be so large that it is intractable.
“This approach leads to the grounding bottleneck problem (Balduccini et al., 2013), where grounding can be so large that it is simply intractable.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Balduccini et al., 2013
Cites
A machine program for theorem-proving
Davis, M. D., Logemann, G. W., & Loveland, D. W. (1962) · Communications of the ACM · doi:10.1145/368273.368557 · Cited by 3,240 · see citing works
Apt, K. R. (1992) · Cited by 1,678 · see citing works
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 · see citing works
Answer set programming at a glance
Brewka, G., Eiter, T., & Truszczyński, M. (2011) · Communications of the ACM · doi:10.1145/2043174.2043195 · Cited by 946 · see citing works
Solving SAT and SAT Modulo Theories
Nieuwenhuis, R., Oliveras, A., & Tinelli, C. (2006) · Journal of the ACM · doi:10.1145/1217856.1217859 · Cited by 783 · see citing works
Logic Programming and Nonmonotonic Reasoning
Delgrande, J., & Faber, W. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20895-9 · Cited by 320 · see citing works
Conflict-driven answer set solving
Gebser, M., Kaufmann, B., Neumann, A., et al. (2007) · Cited by 297 · see citing works
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 291 · see citing works
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 · see citing works
Self-citationStable models and circumscription
Ferraris, P., Lee, J., & Lifschitz, V. (2010) · Artificial Intelligence · doi:10.1016/j.artint.2010.04.011 · Cited by 194 · see citing works
Apt, K. R., & Bezem, M. (1990) · Cited by 189 · see citing works
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 · see citing works
Self-citationExtending the Smodels System with Cardinality and Weight Constraints
Niemelä, I., & Simons, P. (2000) · Springer eBooks · doi:10.1007/978-1-4615-1567-8_21 · Cited by 146 · see citing works
Weight constraints as nested expressions
Ferraris, P., & Lifschitz, V. (2005) · Theory and Practice of Logic Programming · doi:10.1017/s1471068403001923 · Cited by 134 · see citing works
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 · see citing works
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 · see citing works
Apt, K. R., & Bezem, M. (1991) · New Generation Computing · doi:10.1007/bf03037168 · Cited by 90 · see citing works
A model-theoretic counterpart of loop formulas
Lee, J. (2005) · International Joint Conference on Artificial Intelligence · Cited by 83 · see citing works
Symmetric splitting in the general theory of stable models
Ferraris, P., Lee, J., Lifschitz, V., et al. (2009) · Cited by 54 · see citing works
aspcud: A Linux Package Configuration Tool Based on Answer Set Programming
Gebser, M., Kaminski, R., & Schaub, T. H. (2011) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.65.2 · Cited by 36 · see citing works
dlvhex: A Prover for Semantic-Web Reasoning under the Answer-Set Semantics
Eiter, T., Ianni, G., Schindlauer, R., et al. (2006) · IEEE/WIC/ACM International Conference on Web Intelligence · doi:10.1109/wi.2006.64 · Cited by 36 · see citing works
Lierler, Y. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89982-2_35 · Cited by 34 · see citing works
Self-citationTransition systems for model generators—A unifying approach
Lierler, Y., & Truszczyński, M. (2011) · Theory and Practice of Logic Programming · doi:10.1017/s1471068411000214 · Cited by 29 · see citing works
Self-citationDynamic Magic Sets and super-coherent answer set programs
Alviano, M., & Faber, W. (2011) · AI Communications · doi:10.3233/aic-2011-0492 · Cited by 22 · see citing works
Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
Eiter, T., Fink, M., Ianni, G., Krennwallner, T., & Schüller, P. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20895-9_10 · Cited by 15 · see citing works
Self-citationWeighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving
Lierler, Y., Smith, S., Truszczyński, M., et al. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-27694-1_6 · Cited by 13 · see citing works
Self-citationOn the Relation of Constraint Answer Set Programming Languages and Algorithms
Lierler, Y. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v26i1.8127 · Cited by 12 · see citing works
Self-citationLazy Model Expansion by Incremental Grounding
Cat, B. D., Denecker, M., & Stuckey, P. J. (2012) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.iclp.2012.201 · Cited by 11 · see citing works
Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009)
Järvisalo, M., Oikarinen, E., Janhunen, T., et al. (2009) · Cited by 7 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
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 · see citing works
“This approach leads to the grounding bottleneck problem (Balduccini et al., 2013), where grounding can be so large that it is simply intractable.”
BackgroundRelating constraint answer set programming languages and algorithms
Lierler, Y. (2013) · Artificial Intelligence · doi:10.1016/j.artint.2013.10.004 · Cited by 46 · see citing works
“Hence the difference between abstract acsolver and basic clingcon algorithms can be stated in terms of difference in Π-safe formulas Comp (Π ξ ) and ED-Comp (Π ξ ) that they are applied to.”
MethodSelf-citationBlending Lazy-Grounding and CDNL Search for Answer-Set Solving
Weinzierl, A. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-61660-5_17 · Cited by 42 · see citing works
“Since the pre-grounding increases the program size exponentially, however, there are many real-world applications where ASP cannot be used due to this so-called grounding bottleneck (cf. [2]).”
BackgroundExploiting Justifications for Lazy Grounding of Answer Set Programs
Bogaerts, B., & Weinzierl, A. (2018) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/240 · Cited by 11 · see citing works
“Recently, more attention went to problems where grounding is the bottleneck [ Balduccini et al. , 2013 ] .”
BackgroundAn Algebra of Combined Constraint Solving
Ternovska, E. (2018) · EPiC series in computing · doi:10.29007/976n · Cited by 3 · see citing works
Propagators and Solvers for the Algebra of Modular Systems
Bogaerts, B., Ternovska, E., & Mitchell, D. G. M. (2018) · EPiC series in computing · doi:10.29007/t7r9 · Cited by 2 · see citing works
“Aτ -structureA consists of a domainA and an assignment of ann-ary relationQA overA to all n-predicate symbolsQ ∈ τ .”
BackgroundPeople, Ideas, and the Path Ahead
Balduccini, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-94479-7_1 · Cited by 2 · see citing works
“This prompted me to develop EZCSP [1, 6, 5], which I literally intended as an easy (hence “EZ”) way of encoding CSP by means of a host language featuring strong KR foundations and support for non-monotonic constructs.”
BackgroundSelf-citationDIRT: a Literature-Based Benchmark Suite for Grounders
Laer, L. V., Vandevelde, S., & Vennekens, J. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-04587-4_21 · Cited by 1 · see citing works
- Authors
- Balduccini, M., Lierler, Y., & Schüller, P.
- Affiliations
- Carestream (United States) (US)
- University of Nebraska at Omaha (US)
- Sabancı Üniversitesi (TR)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2013
- Pages
- 148-160
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1780080223
- Cited by
- 8
- References
- 29
- Citations by year
- 2025: 1 · 2022: 2 · 2018: 3 · 2017: 1 · 2013: 1
- FWCI
- 0.22
- Type
- conference paper
- Language
- en
- Open access
- Locations
- Lecture notes in computer science (publishedVersion)
- DigitalCommons@UNO (submittedVersion)
- Funders
- Türkiye Bilimsel ve Teknolojik Araştırma Kurumu (TUBITAK–2216)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Computer Networks and Communications › Constraint Satisfaction and Optimization
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Keywords
- answer set programming, Prolog, SLDNF-resolution, backtracking, answer set solvers, declarative programming, program size reduction
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
