Relating defeasible and normal logic programming through transformation properties

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 499-529

  Chesevar, Carlos Iván ^a   Dix, Jürgen ^b   Stolzenburg, Frieder ^c   Simari, G R Guillermo Ricardo ^a  

^a UNIVERSIDAD NACIONAL DEL SUR   (Argentina)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

^c Universität Koblenz Landau ^*  (Germany)

Author keywords

Defeasible argumentation; Knowledge representation; Logic programming; Non monotonic reasoning

Indexed keywords

DATABASE SYSTEMS; KNOWLEDGE REPRESENTATION; MATHEMATICAL TRANSFORMATIONS; SEMANTICS;

DEFEASIBLE LOGIC PROGRAMMING (DELP); NORMAL LOGIC PROGRAMMING (NLP);

LOGIC PROGRAMMING;

EID: 0037209703     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00033-6     Document Type: Article

References (36)

1. Alferes J.J., Damasio C.V., Pereira L.M. A logic programming system for non-monotonic reasoning. J. Automated Reasoning. 14(1):1995;93-147.
2. Brass S., Dix J. Characterizations of the disjunctive stable semantics by partial evaluation. J. Logic Programming. 32(3):1997;207-228.
3. Brass S., Dix J. Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA. J. Automated Reasoning. 20(1):1998;143-165.
4. Brass S., Dix J. Semantics of (disjunctive) logic programs based on partial evaluation. J. Logic Programming. 38(3):1999;167-213.
5. Brass S., Dix J., Freitag B., Zukowski U. Transformation-based bottom-up computation of the well-founded model. Theory Practice Logic Programming. 1(5):2001;497-538.
6. G. Brewka, J. Dix, Knowledge representation with extended logic programs, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, 2nd ed., Vol. 6, Chap. 6, Methodologies, Reidel Publishers shortened version also appeared in: Dix, Pereira, Przymusinski (Eds.), Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, Vol. 1471, Springer, Berlin, 2002, pp. 1-55, 1998.
7. G. Brewka, J. Dix, Knowledge representation with extended logic programs, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, 2nd ed., Vol. 6, Chap. 6, Methodologies, Reidel Publishers shortened version also appeared in: Dix, Pereira, Przymusinski (Eds.), Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence, Vol. 1471, Springer, Berlin, 2002, pp. 1-55, 1998.
8. C.I. Chesñevar, G.R. Simari, Modeling defeasibility into an extended logic programming setting using an abstract argumentation framework, in: Proc. Argentinean Symp. on Artificial Intelligence, JAIIO, Buenos Aires, Argentina, 1999, pp. 71-89.
9. C. Chesñevar, J. Dix, G. Simari, F. Stolzenburg, Relating defeasible and normal logic programming through transformation properties, in: Proc. 6th Argentinean Congress on Computer Science, CACIC'2000, JAIIO, Buenos Aires, Argentina, 2000a, pp. 371-381.
10. Chesñevar C.I., Maguitman A., Loui R. Logical models of argument. ACM Comput. Surveys. 32(4):2000b;337-383.
11. J. Dix, F. Stolzenburg, A framework to incorporate non-monotonic reasoning into constraint logic programming, J. Logic Programming 37(1-3), 47-76, in: Kim Marriott, Peter J. Stuckey (guest Eds.), special issue on Constraint Logic Programming, 1998.
12. J. Dix, U. Furbach, I. Niemelä, Nonmonotonic reasoning: towards efficient calculi and implementations, in: A. Voronkov, A. Robinson (Eds.), Handbook of Automated Reasoning, Vol. 2, chap. 18, Elsevier-Science-Press, New York, 2001a, pp. 1121-1234.
13. Dix J., Osorio M., Zepeda C. A general theory of confluent rewriting systems for logic programming and its applications. Ann. Pure Appl. Logic. 108(1-3):2001b;153-188.
14. Dix J., Pereira L., Przymusinski T. Prolegomena to logic programming for non-monotonic reasoning. Dix J., Pereira L., Przymusinski T. Nonmonotonic Extensions of Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 1216. 1997;1-36 Springer, Berlin.
15. Dix J., Stolzenburg F., Simari G.R., Fillottrani P.R. Automating defeasible reasoning with logic programming (DeReLoP). Jähnichen S., Loiseau I. Proc. 2nd German-Argentinian Workshop on Information Technology. 1999;39-46 Königswinter.
16. P.M. Dung, On the acceptability of arguments and its fundamental role in nomonotonic reasoning and logic programming, in: Proc. 13th. Internat. Joint Conf. in Artificial Intelligence (IJCAI), Chambéry, France, 1993.
17. A.J. García, Defeasible logic programming: definition and implementation, Master's Thesis, Dep. de Ciencias de la Computación, Universidad Nacional del Sur, Bahía Blanca, Argentina, 1997.
18. A.J. García, Defeasible logic programming: definition, operational semantics and parallelism. Ph.D. Thesis, Computer Science Department, Universidad Nacional del Sur, Bahía Blanca, Argentina, 2000.
19. A.J. García, G.R. Simari, C.I. Chesñevar, An argumentative framework for reasoning with inconsistent and incomplete information, in: J. Bell, Z. Huang, J.-J. Meyer, M. Ryan, M. Sergot, S. Steel, M. Woolridge (Eds.), Workshop on Practical Reasoning and Rationality, 13th Biennial European Conference on Artificial Intelligence (ECAI-98), 1998, pp. 13-20.
20. Gelfond M., Lifschitz V. The stable model semantics for logic programming. Kowalski R., Bowen K. 5th Conf. Logic Programming. 1988;1070-1080 MIT Press, Cambridge, MA.
21. Gelfond M., Lifschitz V. Logic programs with classical negation. Warren D., Szeredi P. Proc. Internat. Conf. Logic Programming. 1990;579-597 MIT Press, Cambridge, MA.
22. M. Gelfond, V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (1990) 365-387 (Extended abstract appeared in: Logic Programs with Classical Negation, Proc. 7th Internat. Logic Programming Conference, Jerusalem, 1991, 1990, MIT Press, Cambridge, MA, pp. 579-597).
23. Kakas A.C., Toni F. Computing argumentation in logic programming. J. Logic Comput. 9(4):1999;515-562.
24. V. Lifschitz, Circumscription, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Clarendon, Oxford, 1994, pp. 297-353.
25. Lloyd J.W. Foundations of Logic Programming. 1987;Springer, Berlin, Heidelberg, New York.
26. Nute D. Defeasible logic. Gabbay D. Handbook of Logic and Artificial Intelligence. 1994;353-395 Oxford University Press, Oxford.
27. Pollock J.L. Defeasible reasoning. Cognitive Sci. 11:1987;481-518.
28. Prakken H., Sartor G. Argument-based logic programming with defeasible priorities. J. Appl. Non-classical Logics. 7:1997;25-75.
29. H. Prakken, G. Vreeswijk, Logics for defeasible argumentation, in: D. Gabbay (Ed.), Handbook of Philosophical Logic, Kluwer Academic Publisher, Dordrecht, 2002, to appear.
30. Reiter R. A logic for default reasoning. Artificial Intelligence. 13(1,2):1980;81-132.
31. Rescher N. Dialectics. a Controversy-Oriented Approach to the Theory of Knowledge. 1997;State University of New York Press, Albany, USA.
32. Simari G.R., Loui R.P. A mathematical treatment of defeasible reasoning and its implementation. Artificial Intelligence. 53:1992;125-157.
33. G.R. Simari, C.I. Chesñevar, A.J. García, The role of dialectics in defeasible argumentation, in: R. Peralta (Ed.), Anales de la XIV Conferencia Internacional de la Sociedad Chilena para Ciencias de la Computación, Universidad de Concepción, Concepción (Chile), 1994.
34. A. van Gelder, K.A. Ross, J.S. Schlipf, Unfounded sets and well-founded semantics for general logic programs, in: Proc. 7th Symposion on Principles of Database Systems, 1988, pp. 221-230.
35. van Gelder A., Ross K.A., Schlipf J.S. The well-founded semantics for general logic programs. J. ACM. 38(3):1991;620-650.
36. G.A. Vreeswijk, Studies in defeasible argumentation, Ph.D. Thesis, Vrije University, Amsterdam, Holland, 1993.