Computing argumentation in logic programming

Journal of Logic and Computation

Volumn 9, Issue 4, 1999, Pages 515-562

  Kakas, Antonios C ^a   Toni, Francesca ^b  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; THEOREM PROVING;

DEFAULT REASONING; NEGATION AS FAILURE (NAF);

LOGIC PROGRAMMING;

EID: 0032642028     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/9.4.515     Document Type: Article

References (50)

1. J. J. Alferes and L. M. Pereira. An argumentation-theoretic semantics based on non-refutable falsity. In Proceedings of the International Workshop on Non-monotonic Extensions of Logic Programming J. Dix, L. M. Pereira and T. Przymusinski, eds. pp. 3-22. LNCS 927, Springer Verlag, 1995.
2. K. R. Apt, H. Blair and A. Walker. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, ed. Morgan Kaufmann, Los Altos, CA, 1988.
3. C. Aravindan and P. M. Dung. On the correctness of unfold/fold transformation of normal and extended logic programs. Journal of Logic Programming, 24, 201-217, 1995.
4. A. Bondarenko, F. Toni and R. A. Kowalski. An assumption-based framework for non-monotonic reasoning. In Proceedings of the 2nd International Workshop on Logic Programming and Non-monotonic Reasoning, Lisbon, Portugal. L. M. Pereira and A. Nerode, eds. pp. 171-189, MIT Press, Cambridge, MA, 1993.
5. A. Bondarenko, P. M. Dung, R. A. Kowalski and F. Toni. An abstract, argumentation-theoretic framework for default reasoning. Artificial Intelligence, 93, 63-101, 1997.
6. W. Chen. Extending Prolog with non-monotonic reasoning. Journal of Logic Programming, 27, 169-183, 1996.
7. W. Chen, T. Swift and D. S. Warren. Efficient top-down computation of queries under the well-founded semantics. Journal of Logic Programming, 24, 161-199, 1995.
8. W. Chen and D. S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43, 20-74, 1996.
9. M. Denecker and D. De Schreye. SLDNFA: An abductive proof procedure for abductive logic programming. Journal of Logic Programming, 34, 111-167, 1998.
10. Y. Dimopoulos and A. C. Kakas. Logic programming without negation as failure. In Proceedings of the International Logic Programming Symposium, ortland, Oregon. J. Lloyd, ed. Pp. 369-384. MIT Press, Cambridge, MA, 1995.
11. P. M. Dung. Negation as hypothesis: an abductive foundation for logic programming. In Proceedings of the 8th International Lonference on Logic Porgramming, Paris, France. K. Furukawa, ed. Pp. 3-17. MIT Press, Cambridge, MA, 1996.
12. P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning and logic programming. In Proceedings of the 13th International Joint Conference on Artificial Intelligence, Chambrey, France. R. Bajcsy, ed. Pp. 852-857. Morgan Kaufmann, 1993.
13. P. M. Dung, R. A. Kowalski and F. Toni. Argumentation-theoretic proof procedures for non-monotonic reasoning. In Proceedings of the 6th Workshop on Logic Programming Synthesis and Transformation, Stockolm, Sweden. J. Gallagher ed. LNCS 1207, Springer Verlag, 1996.
14. K. Eshghi and R. A. Kowalski. Abduction compared with negation as failure. In Proceedings of the 6th International Conference on Logic Programming, Lisbon, Portugal. G. Levi and M. Martelli, eds. pp. 234-254. MIT Press Cambridge, MA, 1989.
15. J. A. Fernandez, J. Lobo, J. Minker and V. S. Subrahmaniann. Disjunctive Lp + Integrity Constraints = Stable Model Semantics. Annals of Mathematics and Artificial Intelligence 8, 449-474, 1993.
16. Tze Ho Fung, R. A. Kowalski. The IFF proof procedure for abductive logic programming. Journal of Logic Programming, 33, 151-165, 1997.
17. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, Washington, Seattle. K. Bowen and R. A. Kowalski, eds. pp. 1070-1080. MIT Press, Cambridge, MA, 1988.
18. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceedings of the 7th International Conference on Logic Programming, Jerusalem. D. H. D. Warren and P. Szeredi, eds. pp. 579-597. MIT Press, Cambridge, MA, 1990.
19. K. Inoue, M. Koshimura and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In Proceedings of CADE-11, pp. 400-415. LNAI 607, Springer Verlag, 1992.
20. A. C. Kakas. Default reasoning via negation as failure. In Foundations of Knowledge Representation and Reasoning, G. Lakemeyer and B. Nebel, eds. pp. 160-178. LNAI 810, Springer Verlag, Berlin, 1994
21. A. C. Kakas, R. A. Kowalski and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2, 719-770, 1992.
22. A. C. Kakas, R. A. Kowalski and F. Toni. The role of abduction in logic programming. In Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 5, pp. 235-324, Oxford University Press, 1998.
23. A. C. Kakas and P. Mancarella. An extended abductive framework for negation. Technical Report, Logic Programming Section, Department of Computing, Imperial College, London, 1990.
24. A. C. Kakas and P. Mancarella. Stable theories for logic programs. In Proceedings of the International Logic Programming Symposium, San Diego, CA. V. Saraswat and K. Udea, eds. pp. 85-102. MIT Press, Cambridge, MA, 1991.
25. A. C. Kakas and P. Mancarella. Preferred extensions are partial stable models Journal of Logic Programming, 14, 341-348, 1993.
26. A. C. Kakas, P. Mancarella and P. M. Dung. The acceptability semantics for logic programs. In Proceedings of the 11th International Conference on Logic Programming, Santa Margherita Ligure, Italy. P. van Hentenryck, ed. Pp. 504-519, MIT Press, Cambridge, MA, 1994.
27. A. C. Kakas, P. Mancarella and P. M. Dung. Negation as failure revisited. Pisa University Technical Report, 1992.
28. A. C. Kakas and A. Michael. Integrating abductive and constraint logic programming. In Proceedings of the 12th International Conference on Logic Programming, Japan. C. Stirling, ed. pp. 399-413. MIT Press, Cambridge, MA, 1995.
29. V. Lifschitz, N. McCain, T. C. Przymusinski and R. F. Stärk. Loop Checking and the well-founded semantics. In Proceedings of the 3rd International Workshop on Logic Programminga nd Non-monotonic Reasoning, Lexington, KY. V. Marek, A. Nerode and M. Truszczynski, eds. pp. 127-142. LNAI 928, Springer Verlag, Berlin, 1995.
30. D. McDermott. Nonmonotonic logic II: non-monotonic modal theories. Journal of ACM, 29, 33-57, 1982.
31. R. Moore. Semantical considerations on non-monotonic logic. Artificial Intelligence, 25, 75-94, 1985.
32. I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In Proc. JICSLP'96, pp. 289-303. MIT Press, Cambridge, MA, 1996.
33. L. M. Pereira, J. N. Aparicio and J. J. Alferes. Derivation procedures for extended stable models. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia. J. Mylopoulos and R. Reiter, eds. pp. 863-868, Morgan Kaufmann, 1991.
34. D. Poole. A logical framework for default reasoning. Artificial Intelligence, 36, 27-47, 1988.
35. H. Prakken and G. Sartor. A dialectical model of assessing conflicting arguments in legal reasoning. Artificial Intelligence and Law Journal, 4, 331-368, 1996. Special Issue on Logical Models of Argumentation.
36. H. Prakken and G. Sartor. A dialectical model of assessing conflicting arguments in legal reasoning. Artificial Intelligence and Law Journal, 4, 331-368, 1996. Special Issue on Logical Models of Argumentation.
37. T. Przymusinsky. Well-founded and Stationary Models of Logic Programs, Annals of Mathematics and Artificial Intelligence, 12, 141-187, 1994.
38. T. Przymusinsky. Semantics of disjunctive logic programs and deductive databases. Proceedings of the 2nd International Conference on Deductive and Object-Oriented Databases, Munich, Germany. C. Delobel, M. Kifer and Y. Masunaga eds. pp. 85-107. LNCS 566, Springer Verlag, Berlin, 1991.
39. P. Rao, K. Sagonas, T. Swift, D. S. Warren and J. Freire. XSB: A System for Efficiently Computing the Well-Founded Semantics. In Proceedings of the 4th International Workshop on Logic Programming and Non-monotonic Reasoning, pp. 430-440, 1997.
40. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13, 81-132, 1980.
41. D. Saccà and C. Zaniolo. Stable model semantics and non-determinism for logic programs with negation. Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, Tennessee, pp. 205-217. ACM Press, 1990.
42. K. Sagonas, T. Swift and D. S. Warren. An abstract machine for computing the well-founded semantics. In JICSLP'96, Bonn, Germany, M. Maher, ed. pp. 274-289. MIT Press, Cambridge, MA, 1996.
43. T. Sato. Completed logic programs and their consistency. Journal of Logic Programming, 9, 33-44, 1990.
44. Y. Shimajiri, H. Seki and H. Itoh. Incorporating a pruning strategy into the computation of stable models based on MGTP. In Proceedings of the 14th International Conference on Logic Programming, Leuven, Belgium. L. Naish, ed. pp. 376-390, MIT Press, Cambridge, MA, 1997.
45. M. Thielscher. A nonmonotonic disputation-based semantics and proof procedure for logic programs. In JICSLP'96, Bonn, Germany. M. Maher, ed. pp. 483-497. MIT Press, Cambridge, MA, 1996.
46. F. Toni. Argumentation-based proof procedures for logic programming. Technical Report, Logic Programming Section, Department of Computing, Imperial College, London, 1997.
47. F. Toni and A. C. Kakas. Computing the acceptability semantics. In Proceedings of the 3rd International Workshop on Logic Programming and Non-monotonic Reasoning, Lexington, KY. V. Marek, A. Nerode and M. Truszczynski, eds. pp. 401-415. LNAI 928, Springer Verlag, Berlin, 1995.
48. A. Torres. Negation as failure to support. In Proceedings of the 2nd International Workshop on Loigc Programming and Non-monotonic Reasoning, Lisbon. L.M. Pereira and A. Nerode, eds. pp. 223-243. MIT Press, Cambridge, MA, 1993.
49. A. Van Gelder, K. A. Ross and J. S. Schlipf. Unfounded sets and the well-founded semantics for general logic programs. In Proceedings of the 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Austin, Texas. pp. 221-230. ACM Press, 1988.
50. J.-H. You and L. Y. Yuan. On the equivalence of semantics for normal logic programs. Journal of Logic Programming, 22, 211-221, 1995.