The DOI matches its Crossref record.
An argumentation-theoretic foundation for logic programming
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Examples of this sort of approach include Dung 1995 on dynamic logic of argumentation, Wassermann 2001 on belief revision over syntactic knowledge bases, Gabbay, Kempson & Meyer Viol 2001 on dynamic logic of grammars, and the earliermentioned Jago 2006.”
From THE STORIES OF LOGIC AND INFORMATION (2008) · cites this paper as Dung 1995
Experimental — accuracy not yet measured
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
No references could be resolved yet.
Research works printed but not linked: 12
- Console, 1991, On the Relationship Between Abduction and Deduction, J. Logic Computat., 1, 661, 10.1093/logcom/1.5.661 · DOI
- Dung, 1992, On the Relations Between Stable and Well-Founded Semantics of Logic Programs, Theoretical Computer Science, 105, 7, 10.1016/0304-3975(92)90285-N · DOI
- an extended abstract appeared in Bajcsy R. (ed.), Proc. of IJCAI'93, pp. 852–859.
- Fages, 1993, Consistency of Clark's Completion and Existence of Stable Models, Journal of Methods of Logic in Computer Sciences
- Kakas, 1992, Abductive Logic Programming, J. of Logic and Computation, 2, 719, 10.1093/logcom/2.6.719 · DOI
- Kakas, 1992, Preferred Extensions are Partial Stable Models, J. of Logic Programming, 14, 341, 10.1016/0743-1066(92)90015-U · DOI
- Kakas, 1993, Constructive Abduction in Logic Programming, Technical Report
- Kunen, 1989, Signed Data Dependencies in Logic Programming, J. of Logic Programming, 7, 231, 10.1016/0743-1066(89)90022-8 · DOI
- Marek, 1990, A Theory of Nonmonotonic Rule Systems I, Annals of Mathematics and Artificial Intelligence, 1, 241, 10.1007/BF01531080 · DOI
- Poole, 1988, A Logical Framework for Default Reasoning, Artificial Intelligence, 36, 27, 10.1016/0004-3702(88)90077-X · DOI
- Sato, 1990, Completed Logic Programs and their Consistency, J. of Logic Programming, 9, 33, 10.1016/0743-1066(90)90032-Z · DOI
- Torres, A., Nondeterministic Well-Founded Semantics, to appear in Annals of Mathematics and AI.
Cited by
Sorted by citations
THE STORIES OF LOGIC AND INFORMATION
van Benthem, J., & Martinez, M. (2008) · Philosophy of Information · doi:10.1016/b978-0-444-51726-5.50012-1 · Cited by 80
Metadata
- Authors
- Dung, P. M.
- Venue
- The Journal of Logic Programming
- Publisher
- Elsevier BV
- Published
- 1995-02
- Volume
- 22
- Issue
- 2
- Pages
- 151-177
- ISSN
- 0743-1066 (ISSN-L)
- OpenAlex
- W2039985169
- Cited by
- 108
- References
- 0
- Citations by year
- 2025: 3 · 2024: 3 · 2023: 5 · 2022: 3 · 2021: 4 · 2020: 3 · 2019: 4 · 2018: 2 · 2017: 2 · 2016: 3 · 2015: 1 · 2013: 4 · 2012: 3
- FWCI
- 6.20
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- The Journal of Logic Programming (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › Multi-Agent Systems and Negotiation
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Keywords
- logic programming semantics, argumentation theory, well-founded semantics, stable models, proof procedure
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
