Defeasible logic versus Logic Programming without Negation as Failure

被引：47

作者：

Antoniou, G ^{[1
]}

Maher, MJ ^{[1
]}

Billington, D ^{[1
]}

机构：

[1] Griffith Univ, Sch Comp & Informat Technol, Nathan, Qld 4111, Australia

来源：

JOURNAL OF LOGIC PROGRAMMING | 2000年 / 42卷 / 01期

关键词：

defeasible logic; logic programming;

D O I：

10.1016/S0743-1066(99)00060-6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. In this paper we compare the expressive power of two approaches in this family of logics: Defeasible Logic, and sceptical Logic Programming without Negation as Failure (LPwNF). Our results show that the former has a strictly stronger expressive power. The difference is caused by the latter logic's failure to capture the idea of teams of rules supporting a specific conclusion. (C) 2000 Published by Elsevier Science Inc. All rights reserved.

引用

页码：47 / 57

页数：11

共 13 条

[1] Antoniou, 1997, NONMONOTONIC REASONI
[2] ANTONIOU G, 1998, P JOINT INT C S LOG, P160
[3] BILLINGTON D, 1993, J LOGIC COMPUT, V3, P370
[4] COVINGTON MA, 1997, PROLOG PROGRAMMING D
[5] DIMOPOULOS Y, 1995, P INT S LOG PROGR, P369
[6] KAKAS AC, 1994, P 11 INT C LOG PROGR, P504
[7] Maher MJ, 1998, LECT NOTES ARTIF INT, V1502, P215
[8] Nute D., 1987, Proceedings of the Twentieth Hawaii International Conference on System Sciences 1987, P470
[9] Nute D., 1994, HDB LOGIC ARTIFICIAL, V3, P353
[10] Touretzky D.S., 1987, P IJCAI 87 MILAN, P476

← 1 2 →