Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Ramsay A. — Formal Methods in Artificial Intelligence
Ramsay A. — Formal Methods in Artificial Intelligence



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Formal Methods in Artificial Intelligence

Автор: Ramsay A.

Аннотация:

Artificial intelligence has recently turned to formal logic in the search for powerful yet well-behaved knowledge representation languages. This book covers the background of classical logic, including the major meta-theorems, and the state of the art in theorem proving including Bibel's connection method. Also covered are the advanced adaptations of classical logic now being used in artificial intelligence - temporal and modal logics, reason maintainance and intensional logic. The book covers a wider range of topics than the currently available books in this area, and is more directly aimed at workers in artificial intelligence.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

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

Количество страниц: 279

Добавлена в каталог: 09.12.2005

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Tableau, modal      133
Tautologies      100
Temporal frame      172
Temporal logic      166
Temporal logic, minimal temporal logic      173
Temporal logic, normal temporal logic      173
Temporal logic, propositional modal logics of time      166
Temporal logic, reification      171
Temporal reasoning      165
Term      36
Term equations (for unification)      69
TERMIN      182
Termination rule (for event calculus)      182
TH      see "Theory of a set of sentences"
Theorem prover, resolution      81
Theorem prover, safe      62
Theorem proving for modal logic      131
Theorem proving in $\lambda$-calculus      251
Theorem proving, backward chaining      74
Theory (of a set of sentences)      197
Theory of types      234
Three blocks problem      81
Time, density      174
TMS      see "Justification-based truth maintenance"
Transworld identity (of individuals)      129
Truth in a model      3
Truth maintenance      212
Truth maintenance, assumption based      224
Truth maintenance, contradiction processing      222
Truth maintenance, justification based      214
Truth table      10
Turing machine      53
TWEAK      129
Type hierarchies (as default rules)      194
Type raising      248
Undecidability of FOPC      53
Unification      65
Unification, basic algorithm      66
Unification, improved algorithm      68
Unification, occurs check      69
Unification, term equations      69
Unit preference (in resolution)      95
Universal closure      43
Universal frame axiom      179 232
Universal generalisation      36
Universal quantifier      36
Universal set of sentences      45
Validity      3
Validity for modal logic      122
Valuation (for $Prop_{hilbert}$)      9
Valuation function (for FOPC)      37
Value (in unification)      66
Value of a function      50
Variables      35
Waltz filtering      101
World (in semantics of FOPC)      37
[[...]]      9
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте