The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Defeasible logic programming: an argumentative approach
Open accessAbstract
The work reported here introduces Defeasible Logic Programming (DeLP), a formalism that combines results of Logic Programming and Defeasible Argumentation. DeLP provides the possibility of representing information in the form of weak rules in a declarative manner, and a defeasible argumentation inference mechanism for warranting the entailed conclusions. In DeLP an argumentation formalism will be used for deciding between contradictory goals. Queries will be supported by arguments that could be defeated by other arguments. A query $q$ will succeed when there is an argument ${\mathcal A}$ for $q$ that is warranted, i.e. the argument ${\mathcal A}$ that supports $q$ is found undefeated by a warrant procedure that implements a dialectical analysis. The defeasible argumentation basis of DeLP allows to build applications that deal with incomplete and contradictory information in dynamic domains. Thus, the resulting approach is suitable for representing agent's knowledge and for providing an argumentation based reasoning mechanism to agents.
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
Foundations of Logic Programming
Lloyd, J. W. (1984) · Springer eBooks · doi:10.1007/978-3-642-96826-6 · Cited by 4,128
KAKAS, A. C., KOWALSKI, R. A., & TONI, F. (1992) · Journal of Logic and Computation · doi:10.1093/logcom/2.6.719 · Cited by 827
An abstract, argumentation-theoretic approach to default reasoning
Bondarenko, A., Dung, P. M., Kowalski, R. A., & Toni, F. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00015-5 · Cited by 665
Argument-based extended logic programming with defeasible priorities
Prakken, H., & Sartor, G. (1997) · Journal of Applied Non-Classical Logics · doi:10.1080/11663081.1997.10510900 · Cited by 586
Gabbay, D. M., Hogger, C. J., & Robinson, J. A. (1994) · Cited by 560
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
Self-citationChesñevar, C. I., Maguitman, A. G., & Loui, R. P. (2000) · ACM Computing Surveys · doi:10.1145/371578.371581 · Cited by 518
Cognitive Carpentry: A Blueprint for How to Build a Person
Pollock, J. L. (1995) · Cited by 462
Logical Tools for Modelling Legal Argument
Prakken, H. (1997) · Law and Philosophy Library · doi:10.1007/978-94-015-8975-8 · Cited by 291
Cited by
The ASPIC+ framework for structured argumentation: a tutorial
Modgil, S., & Prakken, H. (2014) · Argument & Computation · doi:10.1080/19462166.2013.869766 · Cited by 324
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
Liao, B., Anderson, M., & Anderson, S. L. (2021) · AI and Ethics · doi:10.1007/s43681-020-00001-8 · Cited by 18
Metadata
- Authors
- GARCÍA, A. J., & SIMARI, G. R.
- Venue
- Theory and Practice of Logic Programming
- Publisher
- Cambridge University Press (CUP)
- Published
- 2004-01
- Volume
- 4
- Issue
- 1-2
- Pages
- 95-138
- ISSN
- 1471-0684 (ISSN-L)
- 1475-3081
- OpenAlex
- W2159569510
- Cited by
- 815
- References
- 30
- FWCI
- 45.75
- Type
- journal article
- Language
- en
- Open access
- green
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: Defeasible logic programming: an argumentative approach. https://app.cochat.ai/papers/10.1017/s1471068403001674
- The paper
- GARCÍA, A. J., & SIMARI, G. R. (2004). Defeasible logic programming: an argumentative approach. Theory and Practice of Logic Programming. https://doi.org/10.1017/s1471068403001674
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.