Chance discovery and unification in linear modal logic

Описание

Тип публикации: статья из журнала (материалы конференций, опубликованные в журналах)

Год издания: 2011

Идентификатор DOI: 10.1007/978-3-642-23863-5_49

Ключевые слова: CD, chance discovery, Kripke models, linear modal logic, logical unification, modal logics, unifiers, Modal logic, Algorithms, Knowledge based systems, Formal logic

Аннотация: This paper studies an interpretation of the Chance Discovery (CD) as the unification problem in the linear modal logic S4.3. We prove that any formula unifiable in S4.3 has a most general unifier, and we give an algorithm which, for any unifiable formula, constructs a most general unifier. More precisely, we merely write out, expliПоказать полностьюcitly, the formulas giving substitutions for a most-general unifier. From computational viewpoint, we find an algorithm for the construction of sets of 'best unifiers' (complete collections of 'most' general unifiers) in the linear modal logic S4.3. © 2011 Springer-Verlag.

Ссылки на полный текст

Издание

Журнал: (12 September 2011 through 14 September 2011, Kaiserslautern

Выпуск журнала: Vol. 6882 LNAI, Is. PART 2

Номера страниц: 478-485

Персоны

  • Rybakov V.V. (Institute of Mathematics,Siberian Federal University)