Propositional Clausal Defeasible Logic

被引：16

作者：

Billington, David ^{[1
]}

机构：

[1] Griffith Univ, Sch ICT, Brisbane, Qld 4111, Australia

来源：

LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS | 2008年 / 5293卷

关键词：

Defeasible logic; Non-monotonic reasoning; Knowledge representation and reasoning; Artificial intelligence;

D O I：

10.1007/978-3-540-87803-2_5

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Defeasible logics are non-monotonic reasoning systems that have efficient implementations and practical applications. We list several desirable properties and note that each defeasible logic fails to have some of these properties. We define and explain a new defeasible logic, called clausal defeasible logic (CDL), which has all these properties. CDL is easy to implement, consistent, detects loops, terminates, and has a range of deduction algorithms to cater for a range of intuitions.

引用

页码：34 / 47

页数：14

共 25 条

[1]

[Anonymous], P 2005 AUSTR C ROB A

[2]

[Anonymous], 2005, P ICAIL 2005, DOI DOI 10.1145/1165485.1165490

[3]

Antoniou G, 2002, LECT NOTES COMPUT SC, V2342, P394

[4]

Antoniou G, 2000, SEVENTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-2001) / TWELFTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-2000), P405

[5]

ANTONIOU G, 1999, P 32 HAW INT C SYST

[6]

Bassiliades N, 2004, LECT NOTES COMPUT SC, V3208, P134

[7]

Billington D, 2005, LECT NOTES ARTIF INT, V3809, P796

[8]

Billington D., 1993, Journal of Logic and Computation, V3, P379, DOI 10.1093/logcom/3.4.379

[9] Propositional plausible logic: Introduction and implementation [J].

Billington D. ;

Rock A. .

Studia Logica, 2001, 67 (2) :243-269

[10]

Billington D., 2004, P 10 INT WORKSH NONM, P65

← 1 2 3 →