Rational Closure for Defeasible Description Logics

被引：78

作者：

Casini, Giovanni ^{[1
]}

Straccia, Umberto ^{[2
]}

机构：

[1] Scuola Normale Super Pisa, Pisa, Italy

[2] ISTI CNR, Pisa, Italy

来源：

LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2010 | 2010年 / 6341卷

关键词：

TYPICALITY; COMPLEXITY; DEFAULTS; TABLEAUX;

D O I：

10.1007/978-3-642-15675-5_9

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means of a simple method in the context of propositional logic. We then propose an application of our approach to rational closure in the field of Description Logics, an important knowledge representation formalism, and provide a simple decision procedure for this case.

引用

页码：77 / 90

页数：14

共 36 条

[1]

[Anonymous], 2003, DESCRIPTION LOGIC HD

[2]

[Anonymous], 2008, KR 2008

[3]

[Anonymous], 1994, Handbook of Logic in Artificial Intelligence and Logic Programming: Nonmonotonic Reasoning and Uncertain Reasoning

[4]

BAADER F, 1993, IJCAI-93, VOLS 1 AND 2, P669

[5] PRIORITIES ON DEFAULTS WITH PREREQUISITES, AND THEIR APPLICATION IN TREATING SPECIFICITY IN TERMINOLOGICAL DEFAULT LOGIC [J].

BAADER, F ;

HOLLUNDER, B .

JOURNAL OF AUTOMATED REASONING, 1995, 15 (01) :41-68

[6] EMBEDDING DEFAULTS INTO TERMINOLOGICAL KNOWLEDGE REPRESENTATION FORMALISMS [J].

BAADER, F ;

HOLLUNDER, B .

JOURNAL OF AUTOMATED REASONING, 1995, 14 (01) :149-180

[7]

Baader F, 2005, 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), P364

[8]

Bochman A., 2001, ART INTEL

[9]

Bonatti PA, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P696

[10]

Bonatti P.A., 2006, PROC KR 06, P400

← 1 2 3 4 →