The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
The alternating fixpoint of logic programs with negation
Open accessAbstract
We introduce and describe the alternating fixpoint of a logic program with negation. The underlying idea is to monotonically build up a set of negative conclusions until the least fixpoint is reached, using a transformation related to the one that defines stable models, developed by Gelfand and Lifschitz. From a fixed set of negative conclusions, we can derive the positive conclusions that follow (without deriving any further negative ones), by traditional Horn clause semantics. The union of positive and negative conclusions is called the alternating fixpoint partial model. The name “alternating” was chosen because the transformation runs in two passes; the first pass transforms an underestimate of the set of negative conclusions into an (intermediate) overestimate; the second pass transforms the overestimates into a new underestimate; the composition of the two passes is monotonic.
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
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
(1988) · Cited by 3,452
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
Foundations of logic programming; (2nd extended ed.)
Lloyd, J. W. (1987) · Springer eBooks · Cited by 1,501
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
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
Doyle, J. (1979) · Artificial Intelligence · doi:10.1016/0004-3702(79)90008-0 · Cited by 1,132
Semantical considerations on nonmonotonic logic
Moore, R. C. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90042-6 · Cited by 1,122
Relational queries computable in polynomial time
Immerman, N. (1986) · Information and Control · doi:10.1016/s0019-9958(86)80029-8 · Cited by 643
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
Structure and complexity of relational queries
Chandra, A., & Harel, D. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90012-5 · Cited by 534
A 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
Elementary Induction on Abstract Structures
(1974) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)x7092-2 · Cited by 492
Kunen, K. (1987) · The Journal of Logic Programming · doi:10.1016/0743-1066(87)90007-0 · Cited by 439
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
Lloyd, J. W., & Topor, R. W. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90011-6 · Cited by 310
Horn clause queries and generalizations
Chandra, A. K., & Harel, D. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90002-0 · Cited by 309
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
Self-citationFixed-point extensions of first-order logic
Gurevich, Y., & Shelah, S. (1986) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(86)90055-2 · Cited by 241
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
Shepherdson, J. C. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50005-1 · Cited by 200
On stratified autoepistemic theories
Gelfond, M. (1987) · National Conference on Artificial Intelligence · Cited by 160
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 132
On the Declarative Semantics of Logic Programs with Negation
Lifschitz, V. (1988) · Elsevier eBooks · doi:10.1016/b978-0-934613-40-8.50008-7 · Cited by 125
Kolaitis, P. G., & Papadimitriou, C. H. (1988) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/308386.308446 · Cited by 94
Modular stratification and magic sets for DATALOG programs with negation
Ross, K. A. (1990) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/298514.298558 · Cited by 83
Shepherdson, J. C. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90018-4 · Cited by 78
Weakly Perfect Model Semantics for Logic Programs.
Przymusinska, H., & Przymusiński, T. C. (1988) · Cited by 77
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 65
A natural semantics for logic programs with negation
Dũng, P. M., & Kanchanasut, K. (1989) · Lecture notes in computer science · doi:10.1007/3-540-52048-1_34 · Cited by 17
Cited by
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
Logical foundations of object-oriented and frame-based languages
Kifer, M., Lausen, G., & Wu, J. (1995) · Journal of the ACM · doi:10.1145/210332.210335 · Cited by 1,450
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
What you always wanted to know about Datalog (and never dared to ask)
Ceri, S., Gottlob, G., & Tanca, L. (1989) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.43410 · Cited by 700
Flexible support for multiple access control policies
Jajodia, S., Samarati, P., Sapino, M. L., & Subrahmanian, V. S. (2001) · ACM Transactions on Database Systems · doi:10.1145/383891.383894 · Cited by 640
Metadata
- Authors
- Van Gelder, A.
- Venue
- Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
- Publisher
- ACM
- Published
- 1989-03-29
- Pages
- 1-10
- ISSN
- 1055-6338 (ISSN-L)
- OpenAlex
- W2132745831
- Cited by
- 369
- References
- 32
- FWCI
- 8.61
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.