Computing Argumentation in Logic Programming
@article{Kakas1999ComputingAI, title={Computing Argumentation in Logic Programming}, author={A. Kakas and Francesca Toni}, journal={J. Log. Comput.}, year={1999}, volume={9}, pages={515-562} }
In recent years, argumentation has been shown to be an appropriate framework in which logic programming with negation as failure as well as other logics for non-monotonic reasoning can be encompassed. Many of the existing semantics for negation as failure in logic programming can be understood in a uniform way using argumentation. Moreover, other logics for non-monotonic reasoning that can also be formulated via argumentation can be given new semantics, by a direct extension of the logic… Expand
Topics from this paper
121 Citations
A Parameterised Hierarchy of Argumentation Semantics for Extended Logic Programming and its Application to the Well-founded Semantics
- Computer Science
- Theory Pract. Log. Program.
- 2005
- 15
- PDF
Between Argument and Conclusion - Argument-based Approaches to Discussion, Inference and Uncertainty
- Mathematics
- 2012
- 18
- PDF
Modelling Inference in Argumentation through Labelled Deduction: Formalization and Logical Properties
- Mathematics, Computer Science
- Logica Universalis
- 2007
- 15
- PDF
References
SHOWING 1-10 OF 67 REFERENCES
Default Reasoning via Negation as Failure
- Computer Science
- ECAI Workshop on Knowledge Representation and Reasoning
- 1992
- 17
On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming
- Mathematics, Computer Science
- IJCAI
- 1993
- 336
- PDF
The Iff Proof Procedure for Abductive Logic Programming
- Computer Science, Mathematics
- J. Log. Program.
- 1997
- 236
A Nonmonotonic Disputation-Based Semantics and Proof Procedure for Logic Programs
- Mathematics, Computer Science
- JICSLP
- 1996
- 6
- PDF
Embedding Negation as Failure into a Model Generation Theorem Prover
- Mathematics, Computer Science
- CADE
- 1992
- 94