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.
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
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
Representing action and change by logic programs
Gelfond, M., & Lifschitz, V. (1993) · The Journal of Logic Programming · doi:10.1016/0743-1066(93)90035-f · Cited by 507
Tabled evaluation with delaying for general logic programs
Chen, W., & Warren, D. S. (1996) · Journal of the ACM · doi:10.1145/227595.227597 · Cited by 439
Marek, W., & Truszczyński, M. (1991) · Journal of the ACM · doi:10.1145/116825.116836 · Cited by 412
Smodels — an implementation of the stable model and well-founded semantics for normal logic programs
Niemelä, I., & Simons, P. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63255-7_32 · Cited by 325
Self-citationExperimental results on the crossover point in random 3-SAT
Crawford, J. M., & Auton, L. D. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00046-1 · Cited by 290
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
Niemelä, I., & Simons, P. (1997) · International Conference on Logic Programming · Cited by 261
Self-citationComplexity results for planning
Bylander, T. (1991) · International Joint Conference on Artificial Intelligence · Cited by 167
Encoding planning problems in nonmonotonic logic programs
Dimopoulos, Y., Nebel, B., & Koehler, J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63912-8_84 · Cited by 162
Default reasoning system DeReS
Cholewiński, P., Marek, V. W., & Truszczyński, M. (1996) · Principles of Knowledge Representation and Reasoning · Cited by 102
NP-SPEC: an executable specification language for solving all problems in NP
Cadoli, M., Ianni, G., Palopoli, L., Schaerf, A., & Vasile, D. (2000) · Computer Languages · doi:10.1016/s0096-0551(01)00010-8 · Cited by 66
Computation of stable models and its integration with logical query processing
Chen, W., & Warren, D. S. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.542027 · Cited by 47
np-spec: An Executable Specification Language for Solving All Problems in NP
Cadoli, M., Palopoli, L., Schaerf, A., & Vasile, D. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49201-1_2 · Cited by 33
Heljanko, K. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49059-0_17 · Cited by 29
Circumscribing datalog: Expressive power and complexity
Cadoli, M., & Palopoli, L. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00108-4 · Cited by 22
Iterative belief revision in extended logic programming
You, J.-H., Cartwright, R., & Li, M. (1996) · Theoretical Computer Science · doi:10.1016/s0304-3975(96)80712-2 · Cited by 8
Cited by
Biere, A., Cimatti, A., Clarke, E. M., Strichman, O., & Zhu, Y. (2003) · Advances in Computers · doi:10.1016/s0065-2458(03)58003-2 · Cited by 952
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 931
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
Self-citationStable 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
Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., & Turner, H. (2004) · Artificial Intelligence · doi:10.1016/j.artint.2002.12.001 · Cited by 454
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
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.