Unification in modal and description logics

被引：49

作者：

Baader, Franz ^{[1
]}

Ghilardi, Silvio ^{[2
]}

机构：

[1] Tech Univ Dresden, Dresden, Germany

[2] Univ Milan, I-20122 Milan, Italy

来源：

LOGIC JOURNAL OF THE IGPL | 2011年 / 19卷 / 06期

关键词：

unification; description logics; modal logics; admissible rules; ADMISSIBLE RULES; COMBINATION; COMPLEXITY; VARIETIES; ALGORITHM; SYSTEM;

D O I：

10.1093/jigpal/jzq008

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Unification was originally introduced in automated deduction and term rewriting, but has recently also found applications in other fields. In this article, we give a survey of the results on unification obtained in two closely related, yet different, application areas of unification: description logics and modal logics.

引用

页码：705 / 730

页数：26

共 75 条

[1]

Ananthararnan S, 2007, LECT NOTES COMPUT SC, V4533, P20

[2]

[Anonymous], 2003, DESCRIPTION LOGIC HD

[3]

[Anonymous], 1970, Computational Problems in Abstract Algebra

[4]

Auffray Y., 1992, Journal of Logic and Computation, V2, P247, DOI 10.1093/logcom/2.3.247