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
121 Citations
Modeling argumentation based semantics using non-monotonic reasoning
  • 5
  • PDF
Notions of Attack and Justified Arguments for Extended Logic Programs
  • 11
  • PDF
Argumentation Semantics for Defeasible Logic
  • 257
  • PDF
Reductio ad Absurdum Argumentation in Normal Logic Programs
  • 12
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 67 REFERENCES
Default Reasoning via Negation as Failure
  • A. Kakas
  • Computer Science
  • ECAI Workshop on Knowledge Representation and Reasoning
  • 1992
  • 17
Abduction Compared with Negation by Failure
  • 404
  • PDF
The Iff Proof Procedure for Abductive Logic Programming
  • 236
A Nonmonotonic Disputation-Based Semantics and Proof Procedure for Logic Programs
  • 6
  • PDF
Computing the Acceptability Semantics
  • 24
...
1
2
3
4
5
...