Добро пожаловать в клуб

Показать / Спрятать  Домой  Новости Статьи Файлы Форум Web ссылки F.A.Q. Логобург    Показать / Спрятать

       
Поиск   
Главное меню
ДомойНовостиСтатьиПостановка звуковФайлыКнижный мирФорумСловарьРассылкаКаталог ссылокРейтинг пользователейЧаВо(FAQ)КонкурсWeb магазинКарта сайта

Поздравляем!
Поздравляем нового Логобуржца lanna2010 со вступлением в клуб!

Реклама

КНИЖНЫЙ МИР

Set Theory for Knowledge Representation   Cristiano Longo

Set Theory for Knowledge Representation

72 страниц. 2012 год.
LAP Lambert Academic Publishing
The decision problem in set theory has been intensively investigated in the last decades, and decision procedures or proofs of undecidability have been provided for several quantified and unquantified fragments of set theory. In this book we study the decision problem for three novel quantified fragments of set theory, which allow the explicit manipulation of ordered pairs. We present a decision procedure for each language of this family, and prove that all of these procedures are optimal (in the sense that they run in nondeterministic polynomial-time) when restricted to formulae with quantifier nesting bounded by a constant. The expressive power of languages of this family is then measured in terms of set-theoretical constructs they allow to express. In addition, these languages can be profitably employed in knowledge representation, since they allow to express a large amount description logic constructs.
 
- Генерация страницы: 0.04 секунд -