ARGUMENT-BASED EXPLANATION OF LOGIC PROGRAMS

被引：23

作者：

BENCHCAPON, TJM ^{[1
]}

LOWES, D ^{[1
]}

MCENERY, AM ^{[1
]}

机构：

[1] UNIV LIVERPOOL,DEPT COMP SCI,LIVERPOOL L69 3BX,ENGLAND

来源：

KNOWLEDGE-BASED SYSTEMS | 1991年 / 4卷 / 03期

关键词：

EXPLANATION; ARGUMENTS; RULE-BASED PROGRAMS; LOGIC PROGRAMMING; KNOWLEDGE-BASED SYSTEMS;

D O I：

10.1016/0950-7051(91)90007-O

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The paper argues that a satisfactory explanation of a logic program must take the form of an argument, rather than a proof. This can only be done on the basis of information regarding the role of the various literals in the bodies of the clauses, which is normally not captured by such programs. A schema for arguments, derived from Toulmin, is presented, and the components of this schema are related to the roles of literals in the bodies of clauses. A metainterpreter is described that uses annotations of body literals to build up an argument structure according to this schema. This structure can then be used to present the argument in a variety of ways; this is illustrated by a discussion of how the argument structure can be used as the basis of a presentation as a paragraph of text. A simple example from a quasilegal domain is presented.

引用

页码：177 / 183

页数：7