The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Autoepistemic logic
Open accessAbstract
Autoepistemic logic is one of the principal modes of nonmonotonic reasoning. It unifies several other modes of nonmonotonic reasoning and has important application in logic programming. In the paper, a theory of autoepistemic logic is developed. This paper starts with a brief survey of some of the previously known results. Then, the nature of nonmonotonicity is studied by investigating how membership of autoepistemic statements in autoepistemic theories depends on the underlying objective theory. A notion similar to set-theoretic forcing is introduced. Expansions of autoepistemic theories are also investigated. Expansions serve as sets of consequences of an autoepistemic theory and they can also be used to define semantics for logic programs with negation. Theories that have expansions are characterized, and a normal form that allows the description of all expansions of a theory is introduced. Our results imply algorithms to determine whether a theory has a unique expansion. Sufficient conditions (stratification) that imply existence of a unique expansion are discussed. The definition of stratified theories is extended and (under some additional assumptions) efficient algorithms for testing whether a theory is stratified are proposed. The theorem characterizing expansions is applied to two classes of theories, K 1 -theories and ae-programs. In each case, simple hypergraph characterization of expansions of theories from each of these classes is given. Finally, connections with stable model semantics for logic programs with negation is discussed. In particular, it is proven that the problem of existence of stable models is NP-complete.— Authors' Abstract
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
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
Circumscription—A form of non-monotonic reasoning
McCarthy, J. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90011-9 · Cited by 2,017
Semantical considerations on nonmonotonic logic
Moore, R. C. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90042-6 · Cited by 1,122
Readings in Nonmonotonic Reasoning
Ginsberg, M. L. (1987) · Cited by 659
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
On the relation between default and autoepistemic logic
Konolige, K. (1988) · Artificial Intelligence · doi:10.1016/0004-3702(88)90021-5 · Cited by 318
On stratified autoepistemic theories
Gelfond, M. (1987) · National Conference on Artificial Intelligence · Cited by 160
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
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
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-citationLogic 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
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
Metadata
- Authors
- Marek, W., & Truszczyński, M.
- Venue
- Journal of the ACM
- Published
- 1991-07
- Volume
- 38
- Issue
- 3
- Pages
- 587-618
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2611415697
- Cited by
- 412
- References
- 11
- FWCI
- 21.34
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Autoepistemic logic. https://app.cochat.ai/papers/10.1145/116825.116836
- The paper
- Marek, W., & Truszczyński, M. (1991). Autoepistemic logic. Journal of the ACM. https://doi.org/10.1145/116825.116836
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.