The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Stable semantics for disjunctive programs
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
(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
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
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
Self-citationA kripke-kleene semantics for logic programs*
Fitting, M. (1985) · The Journal of Logic Programming · doi:10.1016/s0743-1066(85)80005-4 · Cited by 534
Kunen, K. (1987) · The Journal of Logic Programming · doi:10.1016/0743-1066(87)90007-0 · Cited by 439
Marek, W., & Truszczyński, M. (1991) · Journal of the ACM · doi:10.1145/116825.116836 · Cited by 412
On Indefinite Data Bases and the Closed World Assumption
Minker, J. (1982) · Medical Entomology and Zoology · Cited by 406
On indefinite databases and the closed world assumption
Minker, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/bfb0000066 · Cited by 381
Unfounded 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
The alternating fixpoint of logic programs with negation
Van Gelder, A. (1989) · Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/73721.73722 · Cited by 369
A skeptical theory of inheritance in nonmonotonic semantic networks
Horty, J. F., Thomason, R. H., & Touretzky, D. S. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90057-7 · Cited by 243
Negation as failure using tight derivations for general logic programs
Van Gelder, A. (1989) · The Journal of Logic Programming · doi:10.1016/0743-1066(89)90032-0 · Cited by 242
Every logic program has a natural stratification and an iterated least fixed point model
Przymusinski, T. C. (1989) · Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/73721.73723 · Cited by 201
Self-citationOn stratified autoepistemic theories
Gelfond, M. (1987) · National Conference on Artificial Intelligence · Cited by 160
On the relationship between circumscription and negation as failure
Gelfond, M., Przymusinska, H., & Przymusiński, T. C. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90068-4 · Cited by 156
General logical databases and programs: Default logic semantics and stratification
Bidoít, N., & Froidevaux, C. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90073-b · Cited by 94
A procedural semantics for well founded negation in logic programs
Ross, K. A. (1989) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/73721.73724 · Cited by 68
Logic programming as constructivism: a formalization and its application to databases
Bry, F. (1989) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/73721.73725 · Cited by 63
Semantics of disjunctive logic programs and deductive databases
Przymusiński, T. C. (1991) · Lecture notes in computer science · doi:10.1007/3-540-55015-1_5 · Cited by 58
Three-valued nonmonotonic formalisms and semantics of logic programs
Przymusiński, T. C. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90013-a · Cited by 58
Positivism vs minimalism in deductive databases
Bidoít, N., & Hull, R. B. (1985) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/6012.15409 · Cited by 38
Cited by
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
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
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
Logic programming and knowledge representation
Baral, C., & Gelfond, M. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90025-6 · Cited by 431
Logic programming and negation: A survey
Apt, K. R., & Bol, R. N. (1994) · The Journal of Logic Programming · doi:10.1016/0743-1066(94)90024-8 · Cited by 412
Metadata
- Authors
- Przymusinski, T. C.
- Venue
- New Generation Computing
- Published
- 1991-08
- Volume
- 9
- Issue
- 3-4
- Pages
- 401-424
- ISSN
- 0288-3635 (ISSN-L)
- 1882-7055
- OpenAlex
- W2085084839
- Cited by
- 303
- References
- 24
- FWCI
- 8.37
- 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.