The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Logic programs with stable model semantics as a constraint programming paradigm
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
Reiter, R. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90014-4 · Cited by 3,892
(1988) · Cited by 3,452
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
Jaffar, J., & Lassez, J.-L. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41635 · Cited by 1,597
Fast planning through planning graph analysis
Blum, A. L., & Furst, M. L. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(96)00047-1 · Cited by 1,564
The Semantics of Predicate Logic as a Programming Language
Van Emden, M. H., & Kowalski, R. A. (1976) · Journal of the ACM · doi:10.1145/321978.321991 · Cited by 1,449
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
Semantical considerations on nonmonotonic logic
Moore, R. C. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90042-6 · Cited by 1,122
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
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
Cited by
Incremental learning of event definitions with Inductive Logic Programming
Katzouris, N., Artikis, A., & Paliouras, G. (2015) · Machine Learning · doi:10.1007/s10994-015-5512-1 · Cited by 62
Fifty Years of Prolog and Beyond
KÖRNER, P., LEUSCHEL, M., BARBOSA, J., COSTA, V. S., DAHL, V., HERMENEGILDO, M. V., MORALES, J. F., WIELEMAKER, J., DIAZ, D., ABREU, S., et al. (2022) · Theory and Practice of Logic Programming · doi:10.1017/s1471068422000102 · Cited by 40
Comparing Planning Domain Models Using Answer Set Programming
Chrpa, L., Dodaro, C., Maratea, M., Mochi, M., & Vallati, M. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-43619-2_16 · Cited by 2
Alviano, M., Capalbo, M., Gottlob, G., Grillo, L., Kareem, I., Lo Scudo, F., Piccolo, S. A., & Rodriguez Reiners, L. A. (2026) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.21678
“On the other hand, ASP (Marek and Truszczyński 1999; Niemelä 1999) is a declarative programming paradigm extending Datalog with answer set semantics (Gelfond and Lifschitz 1990).”
Metadata
- Authors
- Niemelä, I.
- Venue
- Annals of Mathematics and Artificial Intelligence
- Published
- 1999-11
- Volume
- 25
- Issue
- 3-4
- Pages
- 241-273
- ISSN
- 1012-2443 (ISSN-L)
- 1573-7470
- OpenAlex
- W2152131859
- Cited by
- 834
- References
- 25
- FWCI
- 31.74
- 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: Logic programs with stable model semantics as a constraint programming paradigm. https://app.cochat.ai/papers/10.1023/a:1018930122475
- The paper
- Niemelä, I. (1999). Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence. https://doi.org/10.1023/a%3A1018930122475
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.
