×

Relating defeasible and normal logic programming through transformation properties. (English) Zbl 1051.68043

This paper relates the Defeasible Logic Programming (DeLP) framework and its semantics SEM\(_{\text{DeLP}}\) to classical logic programming frameworks. In DeLP, we distinguish between two different sorts of rules: strict and defeasible rules. Negative literals (\(\sim A)\) in these rules are considered to represent classical negation. In contrast to this, in Normal Logic Programming (NLP), there is only one kind of rules, but the meaning of negative literals (not \(A)\) is different: they represent a kind of negation as failure, and thereby introduce defeasibility. Various semantics have been defined for NLP, notably the well-founded semantics (WFS) and the stable semantics Stable. In this paper we consider the transformation properties for NLP introduced by S. Brass and J. Dix [J. Log. Program. 40, 1–46 (1999; Zbl 0946.68088)] and suitably adjusted for the DeLP framework. We show which transformation properties are satisfied, thereby identifying aspects in which NLP and DeLP differ. We contend that the transformation rules presented in this paper can help to gain a better understanding of the relationship of DeLP semantics with respect to more traditional logic programming approaches. As a byproduct, we obtain the result that DeLP is a proper extension of NLP.

MSC:

68N17 Logic programming

Citations:

Zbl 0946.68088
Full Text: DOI

References:

[1] Alferes, J. J.; Damasio, C. V.; Pereira, L. M., A logic programming system for non-monotonic reasoning, J. Automated Reasoning, 14, 1, 93-147 (1995) · Zbl 0819.68034
[2] Brass, S.; Dix, J., Characterizations of the disjunctive stable semantics by partial evaluation, J. Logic Programming, 32, 3, 207-228 (1997) · Zbl 0883.68082
[3] Brass, S.; Dix, J., Characterizations of the disjunctive well-founded semantics: confluent calculi and iterated GCWA, J. Automated Reasoning, 20, 1, 143-165 (1998) · Zbl 0893.68026
[4] Brass, S.; Dix, J., Semantics of (disjunctive) logic programs based on partial evaluation, J. Logic Programming, 38, 3, 167-213 (1999)
[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, 497-538 (2001) · Zbl 1105.68322
[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.; 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] 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.; 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.
[8] 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.; 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.
[9] Chesñevar, C. I.; Maguitman, A.; Loui, R., Logical models of argument, ACM Comput. Surveys, 32, 4, 337-383 (2000)
[10] 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.; 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. · Zbl 0936.68018
[11] 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.; 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. · Zbl 0991.03036
[12] 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, 153-188 (2001) · Zbl 0980.68069
[13] 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), Springer: Springer Berlin), 1-36
[14] 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), Königswinter), 39-46
[15] 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.; 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.
[16] 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.; 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.
[17] 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.; 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.
[18] 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.; 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.
[19] Gelfond, M.; Lifschitz, V., The stable model semantics for logic programming, (Kowalski, R.; Bowen, K., 5th Conf. Logic Programming (1988), MIT Press: MIT Press Cambridge, MA), 1070-1080
[20] Gelfond, M.; Lifschitz, V., Logic programs with classical negation, (Warren, D.; Szeredi, P., Proc. Internat. Conf. Logic Programming (1990), MIT Press: MIT Press Cambridge, MA), 579-597
[21] 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).; 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). · Zbl 0735.68012
[22] Kakas, A. C.; Toni, F., Computing argumentation in logic programming, J. Logic Comput., 9, 4, 515-562 (1999) · Zbl 0935.68008
[23] V. Lifschitz, Circumscription, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Clarendon, Oxford, 1994, pp. 297-353.; V. Lifschitz, Circumscription, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Clarendon, Oxford, 1994, pp. 297-353.
[24] Lloyd, J. W., Foundations of Logic Programming (1987), Springer: Springer Berlin, Heidelberg, New York · Zbl 0547.68005
[25] Nute, D., Defeasible logic, (Gabbay, D., Handbook of Logic and Artificial Intelligence (1994), Oxford University Press: Oxford University Press Oxford), 353-395
[26] Pollock, J. L., Defeasible reasoning, Cognitive Sci., 11, 481-518 (1987)
[27] Prakken, H.; Sartor, G., Argument-based logic programming with defeasible priorities, J. Appl. Non-classical Logics, 7, 25-75 (1997) · Zbl 0877.68019
[28] H. Prakken, G. Vreeswijk, Logics for defeasible argumentation, in: D. Gabbay (Ed.), Handbook of Philosophical Logic, Kluwer Academic Publisher, Dordrecht, 2002, to appear.; H. Prakken, G. Vreeswijk, Logics for defeasible argumentation, in: D. Gabbay (Ed.), Handbook of Philosophical Logic, Kluwer Academic Publisher, Dordrecht, 2002, to appear. · Zbl 1003.03503
[29] Reiter, R., A logic for default reasoning, Artificial Intelligence, 13, 1,2, 81-132 (1980) · Zbl 0435.68069
[30] Rescher, N., Dialectics, a Controversy-Oriented Approach to the Theory of Knowledge (1997), State University of New York Press: State University of New York Press Albany, USA
[31] Simari, G. R.; Loui, R. P., A mathematical treatment of defeasible reasoning and its implementation, Artificial Intelligence, 53, 125-157 (1992) · Zbl 1193.68238
[32] 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.; 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.
[33] 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.; 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.
[34] van Gelder, A.; Ross, K. A.; Schlipf, J. S., The well-founded semantics for general logic programs, J. ACM, 38, 3, 620-650 (1991) · Zbl 0799.68045
[35] G.A. Vreeswijk, Studies in defeasible argumentation, Ph.D. Thesis, Vrije University, Amsterdam, Holland, 1993.; G.A. Vreeswijk, Studies in defeasible argumentation, Ph.D. Thesis, Vrije University, Amsterdam, Holland, 1993. · Zbl 0789.03026
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.