The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Argument-based extended logic programming with defeasible priorities
Abstract
Inspired by legal reasoning, this paper presents a semantics and proof theory of a system for defeasible argumentation. Arguments are expressed in a logic-programming language with both weak and strong negation, conflicts between arguments are decided with the help of priorities on the rules. An important feature of the system is that these priorities are not fixed, but are themselves defeasibly derived as conclusions within the system. Thus debates on the choice between conflicting arguments can also be modelled. The semantics of the system is given with a fixpoint definition, while its proof theory is stated in dialectical style, where a proof takes the form of a dialogue between a proponent and an opponent of an argument: an argument is shown to be justified if the proponent can make the opponent run out of moves in whatever way the opponent attacks.
Overview
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.
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
Dung, P. M. (1995) · Artificial Intelligence · doi:10.1016/0004-3702(94)00041-x · Cited by 4,270
A mathematical treatment of defeasible reasoning and its implementation
Simari, G. R., & Loui, R. P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90069-a · Cited by 549
Pollock, J. L. (1987) · Cognitive Science · doi:10.1207/s15516709cog1104_4 · Cited by 522
Dialectics: A Controversy-Oriented Approach to the Theory of Knowledge
Rescher, N. (1978) · Informal Logic · doi:10.22329/il.v1i3.2809 · Cited by 346
Proceedings of the 10th European conference on Artificial intelligence
Neumann, B. (1992) · Cited by 257
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
The Pleadings Game: An Artificial Intelligence Model of Procedural Justice
Gordon, T. F. (1995) · Cited by 209
Conditional entailment: Bridging two approaches to default reasoning
Geffner, H., & Pearl, J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90071-5 · Cited by 195
Defeat among arguments: a system of defeasible inference
Loui, R. P. (1987) · Computational Intelligence · doi:10.1111/j.1467-8640.1987.tb00178.x · Cited by 189
Reasoning about priorities in default logic
Brewka, G. (1994) · Cited by 152
Cited by
Walton, D., Reed, C., & Macagno, F. (2008) · Cambridge University Press eBooks · doi:10.1017/cbo9780511802034 · Cited by 1,372
Defeasible logic programming: an argumentative approach
GARCÍA, A. J., & SIMARI, G. R. (2004) · Theory and Practice of Logic Programming · doi:10.1017/s1471068403001674 · Cited by 815
Logics for Defeasible Argumentation
Prakken, H., & Vreeswijk, G. (2001) · Handbook of Philosophical Logic · doi:10.1007/978-94-017-0456-4_3 · Cited by 418
Self-citationThe Carneades model of argument and burden of proof
Gordon, T. F., Prakken, H., & Walton, D. (2007) · Artificial Intelligence · doi:10.1016/j.artint.2007.04.010 · Cited by 393
Self-citationBench-Capon, T., & Gordon, T. F. (2009) · Proceedings of the 12th International Conference on Artificial Intelligence and Law · doi:10.1145/1568234.1568237 · Cited by 29
Metadata
- Authors
- Prakken, H., & Sartor, G.
- Venue
- Journal of Applied Non-Classical Logics
- Publisher
- Informa UK Limited
- Published
- 1997-01
- Volume
- 7
- Issue
- 1-2
- Pages
- 25-75
- ISSN
- 1166-3081 (ISSN-L)
- 1958-5780
- OpenAlex
- W2069176561
- Cited by
- 586
- References
- 20
- FWCI
- 10.94
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Argument-based extended logic programming with defeasible priorities. https://app.cochat.ai/papers/10.1080/11663081.1997.10510900
- The paper
- Prakken, H., & Sartor, G. (1997). Argument-based extended logic programming with defeasible priorities. Journal of Applied Non-Classical Logics. https://doi.org/10.1080/11663081.1997.10510900
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.