The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Stable Models and an Alternative Logic Programming Paradigm
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
(1979) · Cited by 43,841
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
Reiter, R. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90014-4 · Cited by 3,892
Abiteboul, S., Hull, R. B., & Vianu, V. (1994) · Cited by 3,461
Principles of database and knowledge-base systems
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5107 · Cited by 2,683
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
(1995) · Choice Reviews Online · doi:10.5860/choice.33-0359 · Cited by 1,754
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
Symbolic Logic and Mechanical Theorem Proving
(1973) · Elsevier eBooks · doi:10.1016/c2009-0-22103-9 · Cited by 1,468
Smullyan, R. M. (1968) · Springer eBooks · doi:10.1007/978-3-642-86718-7 · Cited by 1,357
Kowalski, R., & Smoliar, S. (1982) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/1005937.1005947 · Cited by 1,182
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
Kautz, H., & Selman, B. (1992) · European Conference on Artificial Intelligence · Cited by 1,145
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
Noise strategies for improving local search
Selman, B., Kautz, H., & Cohen, B. (1994) · Cited by 757
Predicate Logic as Programming Language.
Kowalski, R. (1974) · IFIP Congress · Cited by 670
Automated Theorem Proving: A Logical Basis
Loveland, D. W. (1978) · Medical Entomology and Zoology · Cited by 667
Contributions to the Theory of Logic Programming
Apt, K. R., & van Emden, M. H. (1982) · Journal of the ACM · doi:10.1145/322326.322339 · Cited by 585
On the Declarative Semantics of Deductive Databases and Logic Programs
Przymusinski, T. C. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50009-9 · Cited by 548
Marek, W., & Truszczyński, M. (1991) · Journal of the ACM · doi:10.1145/116825.116836 · Cited by 412
Self-citationUnfounded sets and well-founded semantics for general logic programs
Gelder, A. V., Ross, K. A., & Schlipf, J. S. (1988) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/308386.308444 · Cited by 380
Lloyd, J. W., & Topor, R. W. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90011-6 · Cited by 310
Domain-independent extensions to GSAT: solving large structured satisfiability problems
Selman, B., & Kautz, H. (1993) · Cited by 291
Nonmonotonic Logic: Context-Dependent Reasoning
Marek, W., & Truszczyński, M. (1997) · Springer eBooks · Cited by 287
Self-citationA deductive system for non-monotonic reasoning
Eiter, T., Leone, N., Mateis, C., Pfeifer, G., & Scarcello, F. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63255-7_27 · Cited by 180
Action Languages, Answer Sets, and Planning
Lifschitz, V. (1999) · The Logic Programming Paradigm · doi:10.1007/978-3-642-60085-2_16 · Cited by 163
The 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
XSB: A system for efficiently computing well-founded semantics
Rao, P., Sagonas, K., Swift, T., Warren, D. S., & Freire, J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63255-7_33 · Cited by 125
Negation by default and unstratifiable logic programs
Bidoít, N., & Froidevaux, C. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(51)90004-7 · Cited by 124
Default reasoning system DeReS
Cholewiński, P., Marek, V. W., & Truszczyński, M. (1996) · Principles of Knowledge Representation and Reasoning · Cited by 102
Self-citationAfrati, F., Cosmadakis, S. S., & Yannakakis, M. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1060 · Cited by 69
A logic programming system for nonmonotonic reasoning
Alferes, J. J., Damásio, C. V., & Pereira, L. M. (1995) · Journal of Automated Reasoning · doi:10.1007/bf00883931 · Cited by 67
Arithmetic Classification of Perfect Models of Stratified Programs
Apt, K. R., & Blair, H. A. (1990) · Fundamenta Informaticae · doi:10.3233/fi-1990-13103 · Cited by 63
The Stable Models of a Predicate Logic Program
Marek, V. W., Nerode, A., & Remmel, J. B. (1994) · The Journal of Logic Programming · doi:10.1016/s0743-1066(14)80008-3 · Cited by 60
Self-citationThe generalized completeness of Horn predicate-logic as a programming language.
Andréka, H., & Németi, I. (1978) · Acta Cybernetica · Cited by 57
Cholewiński, P., Marek, V. W., Truszczyński, M., & Mikitiuk, A. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00053-3 · Cited by 56
Self-citationnp-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
The expressiveness of locally stratified programs
Blair, H. A., Marek, V. W., & Schlipf, J. S. (1995) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01534455 · Cited by 30
Self-citationCircumscribing datalog: Expressive power and complexity
Cadoli, M., & Palopoli, L. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00108-4 · Cited by 22
A note on the stable model semantics for logic programs
Kaminski, M. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00058-1 · Cited by 12
Cited by
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
Self-citationExtending 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
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
Metadata
- Authors
- Marek, V. W., & Truszczyński, M.
- Venue
- Artificial Intelligence
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 375-398
- ISSN
- 1431-0066 (ISSN-L)
- OpenAlex
- W1639901403
- Cited by
- 739
- References
- 41
- FWCI
- 40.89
- Type
- book chapter
- Language
- en
- Open access
- green
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.