Łukaszewicz-style answer set programming: A preliminary report

@inproceedings{Delgrande03b, abstract = {The correspondence between Reiter’s default reasoning and logic programming has been exhaustively studied (e.g. [1], [2], [3]). A Contrario the relation with the many variants of the initial theory of Reiter seems far less known. This paper aims to present a preliminary investigation on applying a variant of default reasoning proposed by Witold Łukaszewicz [5] to extended logic programs. We show that the modification made to the notion of extension by Łukaszewicz has its counterpart as a relaxed notion of answer set of an extended logic program. As can be expected from this correspondence: (1) any extended logic program has always at least one relaxed answer set; (2) classical answer sets can be completely characterized among the set of relaxed answer sets of an extended logic program.}, author = {Delgrande, J. P. and Gharib, M. and Mercer, R. E. and Risch, V. and Schaub, T. }, booktitle = {In De Vos, M., Provetti, A., eds.: Proceedings of the Second International Workshop on Answer Set Programming (ASP’03). Volume 78 of CEUR Workshop Proceedings. (2003}, citeulike-article-id = {3039411}, keywords = {answer-set-programming}, posted-at = {2008-07-24 13:57:33}, priority = {2}, title = {Łukaszewicz-style answer set programming: A preliminary report}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.12}, year = {2003} }

TY - CONF ID - Delgrande03b L3 - citeulike-article-id:3039411 TI - Łukaszewicz-style answer set programming: A preliminary report T2 - In De Vos, M., Provetti, A., eds.: Proceedings of the Second International Workshop on Answer Set Programming (ASP’03). Volume 78 of CEUR Workshop Proceedings. (2003 N2 - The correspondence between Reiter’s default reasoning and logic programming has been exhaustively studied (e.g. [1], [2], [3]). A Contrario the relation with the many variants of the initial theory of Reiter seems far less known. This paper aims to present a preliminary investigation on applying a variant of default reasoning proposed by Witold Łukaszewicz [5] to extended logic programs. We show that the modification made to the notion of extension by Łukaszewicz has its counterpart as a relaxed notion of answer set of an extended logic program. As can be expected from this correspondence: (1) any extended logic program has always at least one relaxed answer set; (2) classical answer sets can be completely characterized among the set of relaxed answer sets of an extended logic program. KW - answer-set-programming AU - Delgrande, JP AU - Gharib, M AU - Mercer, RE AU - Risch, V AU - Schaub, T PY - 2003/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.12 ER -