Âàø êîììåíòàðèé î êíèãå
Òîëêîâûé ñëîâàðü ïî èñêóññòâåííîìó èíòåëëåêòó
Ñëîâàðü ñîäåðæèò îêîëî 550 òåðìèíîâ
Àâòîðû-ñîñòàâèòåëè: À.Í. Àâåðêèí, Ì.Ã. Ãààçå-Ðàïîïîðò, Ä.À. Ïîñïåëîâ
Êîìïüþòåðíàÿ âåðñèÿ: È.Í. Ëèñòîïàä, À.Á. Ïðîêóäèí, Å.Í. Ùåðáàêîâ
Ïðåäèñëîâèå
Ñïåöèàëüíàÿ òåðìèíîëîãèÿ ïî èñêóññòâåííîìó èíòåëëåêòó è èíòåëëåêòóàëüíûì ñèñòåìàì íà÷àëà ôîðìèðîâàòüñÿ â 60-å ãîäû ÕÕ â. Ïåðâûé ýòàï ôîðìèðîâàíèÿ òåðìèíîëîãèè âñåãäà îòëè÷àåòñÿ íàëè÷èåì ìíîãèõ ñèíîíèìè÷åñêèõ òåðìèíîâ, êîòîðûå èñïîëüçóþò ðàçëè÷íûå øêîëû è ãðóïïû ñïåöèàëèñòîâ. Íà ýòîì ýòàïå òåðìèíû áûñòðî âîçíèêàþò è ÷àñòü èç íèõ òàêæå áûñòðî èñ÷åçàåò. Ê ñåðåäèíå 70-õ ãîäîâ òåðìèíîëîãèÿ â îáëàñòè èñêóññòâåííîãî èíòåëëåêòà ñòàëà óñòàíàâëèâàòüñÿ. Ïîÿâèëèñü òåðìèíû, êîòîðûå ïðèçíàëî ïîäàâëÿþùåå áîëüøèíñòâî ñïåöèàëèñòîâ. Âñå ýòè òåðìèíû (çà ðåäêèì èñêëþ÷åíèåì) ïî ïðîèñõîæäåíèþ àíãëîÿçû÷íûå, òàê êàê èìåííî â ÑØÀ ïðîâîäèëèñü èíòåíñèâíûå èññëåäîâàíèÿ â ýòîé îáëàñòè. Îêîí÷àòåëüíî îñíîâíàÿ òåðìèíîëîãèÿ çàêðåïèëàñü â ïåðâîé ïîëîâèíå 80-õ ãîäîâ. Ñ ýòîãî ïåðèîäà ñòàëè èçäàâàòüñÿ ñëîâàðè è ýíöèêëîïåäè÷åñêèå ñïðàâî÷íèêè ïî èñêóññòâåííîìó èíòåëëåêòó. Òðóäíîñòü ñîçäàíèÿ òîëêîâîãî ñëîâàðÿ ïî èñêóññòâåííîìó èíòåëëåêòó ñâÿçàíà ñ ìåæäèñöèïëèíàðíûì õàðàêòåðîì èññëåäîâàíèé â ýòîé îáëàñòè. Òàê êàê â èñêóññòâåííîì èíòåëëåêòå èñïîëüçóþòñÿ ìåòîäû, òðàäèöèîííî ðàçâèâàåìûå â ëîãèêå, ïñèõîëîãèè, ëèíãâèñòèêå, êèáåðíåòèêå, äèñêðåòíîé ìàòåìàòèêå è ïðîãðàììèðîâàíèè, âñòðå÷àåòñÿ íåìàëî òåðìèíîâ è äðóãèõ íàóê. Îáñóæäåíèå òîëêîâîãî ñëîâàðÿ ïîêàçàëî, ÷òî èìåþòñÿ äâà êðàéíèõ ñëó÷àÿ: âêëþ÷èòü â íåãî òåðìèíû, êîòîðûå èñïîëüçóþòñÿ òîëüêî â èñêóññòâåííîì èíòåëëåêòå è íå çàèìñòâîâàíû èì èç äðóãèõ íàóê, èëè âêëþ÷èòü â íåãî âñå òåðìèíû ñìåæíûõ ñ èñêóññòâåííûì èíòåëëåêòîì íàóê, åñëè îíè âñòðå÷àþòñÿ â ðàáîòàõ ñïåöèàëèñòîâ äàííîãî íàïðàâëåíèÿ. Ñîñòàâèòåëÿìè ñëîâàðÿ áûëî ïðèíÿòî ïðîìåæóòî÷íîå ðåøåíèå, êîòîðîå, êîíå÷íî, òóò æå ïîñòàâèëî ïåðåä íèìè ïðîáëåìó ãðàíèö. Èñïîëüçóÿ êîëëåêòèâíûé îïûò ñïåöèàëèñòîâ ðÿäà ñòðàí è ÑÑÑÐ, ñîñòàâèòåëè ïîïûòàëèñü îïðåäåëèòü ýòó åñòåñòâåííóþ ãðàíèöó, ñâÿçàâ åå ñ ÷àñòîòîé âñòðå÷àåìîñòè çàèìñòâîâàííûõ â èñêóññòâåííûé èíòåëëåêò òåðìèíîâ.
--------------------------------------------------------------------------------
À
àáäóêöèÿ abduction
àáñòðàêöèÿ abstraction
àáñòðàêöèÿ äàííûõ data abstraction
àâòîìàò automaton
àâòîìàò áåñêîíå÷íûé
àâòîìàò âåðîÿòíîñòíûé
àâòîìàò äåòåðìèíèðîâàííûé
àâòîìàò èíèöèàëüíûé
àâòîìàò êëåòî÷íûé cellular automaton
àâòîìàò êîíå÷íûé finite automaton
àâòîìàò ëèíåéíî-îãðàíè÷åííûé linear-bounded automaton
àâòîìàò ìàãàçèííûé push-down automaton
àâòîìàò íåäåòåðìèíèðîâàííûé
àâòîìàò ñ ïåðåìåííîé ñòðóêòóðîé
àâòîìàò ñåêâåíöèàëüíûé sequential automaton
àâòîìàò ñòåêîâûé
àâòîìàò ñòîõàñòè÷åñêèé stochastic automaton
àâòîìàòèçàöèÿ äåëîïðîèçâîäñòâà office automation
àâòîìàòèçèðîâàííàÿ ñèñòåìà óïðàâëåíèÿ(ÀÑÓ)
ÀÑÓ ïðåäïðèÿòèåì (ÀÑÓÏ)
ÀÑÓ òåõíîëîãè÷åñêèì ïðîöåññîì (ÀÑÓÒÏ)
àêñèîìà axiom
àêò ðå÷åâîé speech act
àêòàíò
àêòîð actor
àëãîðèòì algorithm
àëãîðèòì âîëíîâîé wave algorithm
àëãîðèòì ãåíåòè÷åñêèé genetic algorithm
àíàëèç
àíàëèç êëàñòåðíûé cluster analisys
àíàëèç ìîðôîëîãè÷åñêèé morphologic analisys
àíàëèç ïðîòîêîëüíûé protocol analysis
àíàëèç ñèíòàêñè÷åñêèé syntactic analysis
àíàëèç ñöåí scenary analysis
àíàëèçàòîð ñèíòàêñè÷åñêèé syntactic parser
àíàëîãèÿ analogy
àíàôîðà anaphora
àðãóìåíòàöèÿ argumentation
àðõèòåêòóðà âû÷èñëèòåëüíîé ñèñòåìû
àðõèòåêòóðà êîìïüþòåðà computer architecture
àðõèòåêòóðà êîíâåéåðíàÿ pipeline architecture
àðõèòåêòóðà ïàðàëëåëüíàÿ parallel architecture
àðõèòåêòóðà ïîòîêîâàÿ data flow architecture
àññîöèàöèÿ association
àòîì atom
àòðèáóò attribute
Á
áàçà äàííûõ data base
áàçà äàííûõ èåðàðõè÷åñêàÿ hierarchical data base
áàçà äàííûõ ðåëÿöèîííàÿ relational data base
áàçà äàííûõ ñåòåâàÿ
áàçà äàííûõ ýêñòåíñèîíàëüíàÿ extensional data base
áàçà çíàíèé knowledge base
áàçà çíàíèé çàìêíóòàÿ closed knowledge base
áàçà çíàíèé èíòåíñèîíàëüíàÿ intensional knowledge base
áàçà çíàíèé îòêðûòàÿ open knowledge base
áåêòðåêèíã backtracking
áåñåäà ñîêðàòè÷åñêàÿ Socratic dialogue
áèõåéâèîðèçì behaviourism
Â
âàëèäàöèÿ validation
âåðèôèêàöèÿ verification
âèäåîïðîöåññîð video-processor
âîñïðèÿòèå perception
âîñïðèÿòèå çðèòåëüíîé èíôîðìàöèè visual perception
âîñïðèÿòèå òàêòèëüíîé èíôîðìàöèè tactile perception
âûáîðêà îáó÷àþùàÿ teaching selection
âûâîä inference
âûâîä àáäóêòèâíûé abductive inference
âûâîä âåðîÿòíîñòíûé probabilitic inference
âûâîä åñòåñòâåííûé common-sense inference
âûâîä èíäóêòèâíûé inductive inference
âûâîä èíòóèöèîíèñòêèé intuitionistic inference
âûâîä ëèíåéíûé linear inference
âûâîä ëîãè÷åñêèé logical inference
âûâîä íà çíàíèÿõ knoledge-based inference
âûâîä íåìîíîòîííûé non-monotonic inference
âûâîä íå÷åòêèé fuzzy inference
âûâîä îáðàòíûé
âûâîä ïî àíàëîãèè inference by analogy
âûâîä ïðàâäîïîäîáíûé plausible inference
âûâîä ïðÿìîé direct inference
âûçîâ ïî îáðàçöó call by pattern
âûñêàçûâàíèå proposition
âûñêàçûâàíèå àòîìàðíîå atomic proposition
Ã
ãåíåðàöèÿ òåêñòà text generation
ãåðìåíåâòèêà hermeneutics
ãèïåðñîáûòèå hyper-event
ãèïîòåçà hypothesis
ãèïîòåçà êîìïàêòíîñòè compactness hypothesis
ãëóáèííàÿ ñòðóêòóðà (ïðåäëîæåíèÿ)
ãðàììàòèêà
ãðàììàòèêà àâòîìàòíàÿ
ãðàììàòèêà êîíòåêñòíî-çàâèñèìàÿ
ãðàììàòèêà êîíòåêñòíî-ñâîáîäíàÿ
ãðàììàòèêà êîíòåêñòíî-ñâÿçàííàÿ
ãðàììàòèêà ìàòðè÷íàÿ matrix grammar
ãðàììàòèêà íåóêîðà÷èâàþùàÿ
ãðàììàòèêà ïàäåæíàÿ case grammar
ãðàììàòèêà ñåòåâàÿ network grammar
ãðàììàòèêà ôîðìàëüíàÿ formal grammar
ãðàô graph
ãðàôèêà äèíàìè÷åñêàÿ animation
ãðàôèêà êîãíèòèíâíàÿ cognitive graphics
ãðàôèêà ìàøèííàÿ
Ä
äåéñòâèå action
äåêîìïîçèöèÿ çàäà÷ problem decomposition
äåíîòàò denotatum
äåðåâî âûâîäà inference tree
äåðåâî äâîè÷íîå binary tree
äåðåâî çàâèñèìîñòåé dependency tree
äåðåâî ðåøåíèé decision tree
äåðåâî ñîñòàâëÿþùèõ consistency tree
äåðåâî öåëåé goal tree
äåñèãíàò designator
äåñêðèïòîð descriptor
äåôîëò default
äèçúþíêò
äèçúþíêò áîêîâîé
äèçúþíêò ïóñòîé empty clause
äèçúþíêò Õîðíà Horn clause
äèçúþíêöèÿ disjunction
äèñêóðñ discourse
äèññîíàíñ êîãíèòèâíûé cognitive dissonance
äîêàçàòåëüñòâî êîíñòðóêòèâíîå constructive proof
äîêàçàòåëüñòâî òåîðåìû theorem proving
äîìåí domain
äîñêà îáúÿâëåíèé blackboard
Å
Æ
Ç
çàêîí èñêëþ÷åííîãî òðåòüåãî
çàêîí ñíÿòèÿ äâîéíîãî îòðèöàíèÿ
çíàíèÿ knowledge
çíàíèÿ äåêëàðàòèâíûå declarative knowledge
çíàíèÿ î ïðåäìåòíîé îáëàñòè problem area knowledge
çíàíèÿ ïðàãìàòè÷åñêèå pragmatic knowledge
çíàíèÿ ïðîöåäóðíûå procedural knowledge
çíàíèÿ ýâðèñòè÷åñêèå heuristic knowledge
çíàíèÿ ýêñïåðòíûå expert knowledge
çíà÷åíèå àòðèáóòà attribute value
çíà÷åíèå ïî óìîë÷àíèþ default value
çðåíèå ìàøèííîå computer vision
È
È/ÈËÈ ãðàô AND/OR graph
èäåíòèôèêàöèÿ identification
èäåíòèôèêàöèÿ çíàíèé knowledge identification
èçâëå÷åíèå çíàíèé knowledge acquisition
ÈÈ-ïðîãðàììèðîâàíèå AI-programming
èëëîêóòèâíûé ïîòåíöèàë
èëëîêóöèÿ illocution
èìèòàöèÿ èíòåëëåêòóàëüíîãî ïîâåäåíèÿ
èìèòàöèÿ ïðîöåññîâ ìûøëåíèÿ
èìïëèêàöèÿ implication
èíäóêöèÿ induction
èíäóêöèÿ íåïîëíàÿ (ýìïèðè÷åñêàÿ) empirical induction
èíäóêöèÿ ïîëíàÿ (ìàòåìàòè÷åñêàÿ) complete induction (mathematical)
èíæåíåð ïî çíàíèÿì knowledge engineer
èíæåíåðèÿ çíàíèé knowledge engineering
èíòåëëåêò èñêóññòâåííûé artificial intelligence
èíòåðâüþ interview
èíòåðïðåòàöèÿ interpretation
èíòåðôåéñ
èíòåðôåéñ åñòåñòâåííî-ÿçûêîâûé natural language interface
èíòåðôåéñ èíòåëëåêòóàëüíûé intelligent interface
èñêóññòâåííûé ìîçã
èñòî÷íèê çíàíèé knowledge source
èñ÷èñëåíèÿ calculus
èñ÷èñëåíèå âûñêàçûâàíèé propositional calculus
èñ÷èñëåíèå ãåíöåíà
èñ÷èñëåíèå ëîãè÷åñêîå logical calculus
èñ÷èñëåíèå ïðåäèêàòîâ predicate calculus
èñ÷èñëåíèå ïðåäèêàòîâ ïåðâîãî ïîðÿäêà first order predicate calculus
èñ÷èñëåíèå ïðîïîçèöèîíàëüíîå propositional calculus
èñ÷èñëåíèå ñèòóàöèîííîå situational calculus
É
Ê
êàðòà êîãíèòèâíàÿ cognitive map
êàóçàöèÿ causation
êâàíòèôèêàòîð quantifier
êâàíòèôèêàöèÿ quantification
êâàíòîð îáùíîñòè universal quantifier
êâàíòîð ñóùåñòâîâàíèÿ existential quantifier
êëàññèôèêàöèÿ classification
êëàñòåðèçàöèÿ clusterization
êëàóçà
êîãèòîëîãèÿ cogitology
êîãíèòèâíàÿ íàóêà cognitive science
êîìïîíåíòà äåêëàðàòèâíàÿ declarative component
êîíêàòåíàöèÿ concatenation
êîíñòðóêò Êåëëè Kelly construct
êîíöåïò concept
êîíúþíêöèÿ conjunction
Ë
ëèíãâèñòèêà âû÷èñëèòåëüíàÿ computational linguistics
ëèíãâèñòèêà êîìïüþòåðíàÿ computer linguistics
ëèïñ lips
ëèòåðà literal
ëîãèêà logic
ëîãèêà âåðîÿòíîñòíàÿ probabilitic logic
ëîãèêà âåðû belief logic
ëîãèêà âðåìåííàÿ temporal logic
ëîãèêà âòîðîãî ïîðÿäêà second order logic
ëîãèêà äâîè÷íàÿ
ëîãèêà äåéñòâèé operational logic
ëîãèêà äåîíòè÷åñêàÿ deontic logic
ëîãèêà äèíàìè÷åñêàÿ dynamic logic
ëîãèêà çäðàâîãî ñìûñëà common-sense logic
ëîãèêà èíäóêòèâíàÿ inductive logic
ëîãèêà èíòóèöèîíèñòêàÿ intuitionistic logic
ëîãèêà êàóçàëüíàÿ causal logic
ëîãèêà êîìàíä command logic
ëîãèêà êîíñòðóêòèâíàÿ constructive logic
ëîãèêà ìàòåìàòè÷åñêàÿ mathematical logic
ëîãèêà ìíîãîçíà÷íàÿ multi-valued logic
ëîãèêà ìîíîòîííàÿ monotonic logic
ëîãèêà íåìîíîòîííàÿ non-monotonic logic
ëîãèêà íå÷åòíàÿ fuzzy logic
ëîãèêà íîðì
ëîãèêà îöåíîê deontic logic
ëîãèêà ïåðâîãî ïîðÿäêà first order logic
ëîãèêà ïðîïîçèöèîíàëüíàÿ propositional logic
ëîãèêà ïðîñòðàíñòâåííàÿ spatial logic
ëîãèêà ïñåâäîôèçè÷åñêàÿ pseudophysical logic
ëîãèêà ðàçìûòàÿ fuzzy logic
ëîãèêà ðàññóæäåíèé ïî óìîë÷àíèþ default logic
ëîãèêà ýïèñòåìèîëîãè÷åñêàÿ epistemiological logic
ëîê
ëîêóöèÿ locution
"ëÿìáäà"-èñ÷èñëåíèå lambda-calculus
Ì
ìàøèíà àáñòðàêòíàÿ abstract machine
ìàøèíà áàç äàííûõ data base machine
ìàøèíà áàç çíàíèé knowledge base machine
ìàøèíà âèðòóàëüíàÿ virtual machine
ìàøèíà ïàðàëëåëüíîãî âûâîäà parallel inference machine
ìàøèíà Ïîñòà Post machine
ìàøèíà ñâÿçåé connection machine
ìàøèíà Òüþðèíãà Turing machine
ìàøèíà, óïðàâëÿåìàÿ ïîòîêîì äàííûõ data flow machine
ìàøèííûé èíòåëëåêò
ìåíþ menu
ìåðà ïðàâäîïîäîáèÿ plausibility measure
ìåòàçíàíèå meta-knowledge
ìåòàïðîäóêöèÿ meta-production
ìåòàôîðà metaphor
ìåòàÿçûê meta-language
ìåòîä âåòâåé è ãðàíèö branch-and-bound method
ìåòîä èíòåðâüþ interview method
ìåòîä îáðàòíîé âîëíû
ìåòîä ïðÿìîé âîëíû
ìåõàíèçì âûâîäà inference mechanism
ìåõàíèçì íàñëåäîâàíèÿ inheritance mechanism
ÌÈÌÄ àðõèòåêòóðà MIMD architecture
ìíîæåñòâî íå÷åòêîå fuzzy set
ìîäåëü model
ìîäåëü àññîöèàòèâíàÿ associative model
ìîäåëü âû÷èñëèòåëüíàÿ computational model
ìîäåëü çàìêíóòàÿ closed model
ìîäåëü çíàíèé knowledge model
ìîäåëü êîãíèòèâíàÿ cognitive model
ìîäåëü êîíöåïòóàëüíàÿ conceptual model
ìîäåëü Êðèïêå Kripke model
ìîäåëü ëàáèðèíòíàÿ labyrinth model
ìîäåëü ëèíãâèñòè÷åñêàÿ linguistic model
ìîäåëü ëîãèêî-ëèíãâèñòè÷åñêàÿ logical-linquistic model
ìîäåëü ëîãè÷åñêàÿ logical model
ìîäåëü ìèðà world model
ìîäåëü îáó÷åíèÿ learning model
ìîäåëü îáùåíèÿ communication model
ìîäåëü îòêðûòàÿ open model
ìîäåëü ïîâåäåíèÿ
ìîäåëü ïîëüçîâàòåëÿ user model
ìîäåëü ðåëÿöèîííàÿ relational model
ìîäåëü ñåòåâàÿ network model
ìîäåëü ñèòóàöèé situational model
ìîäåëü ñîçíàíèÿ
ìîäåëü ñòèìóë-ðåàêöèÿ SR-model (stimulus-reaction model)
ìîäåëü òå÷åíèÿ äèàëîãà
ìîäåëü ôîðìàëüíàÿ formal model
ìîäåëü ÿçûêà language model
ìîäóñ ïîíåíñ modus ponens
ìîäóñ òîëëåíñ modus tollens
ìîíîòîííîñòü ïðè âûâîäå
Í
íàñëåäîâàíèå hireditance
íåéðîáèîíèêà neurobionics
íåéðîêîìïüþòåð
íåéðîí ôîðìàëüíûé
íåìîíîòîííîñòü ïðè âûâîäå
íåîïðåäåëåííîñòü uncertainty
íåîïðåäåëåííîñòü ëèíãâèñòè÷åñêàÿ linguistic uncertainty
íåïîëíîòà incompleteness
íåðàçðåøèìîñòü àëãîðèòìè÷åñêàÿ algorithmic nonresolvability
íîâàÿ èíôîðìàöèîííàÿ òåõíîëîãèÿ
Î
îáëàñòü ïðåäìåòíàÿ subject area
îáëàñòü ïðåäìåòíàÿ ïëîõî ñòðóêòóðèðîâàííàÿ ill-structered subject area
îáëàñòü ïðåäìåòíàÿ õîðîøî ñòðóêòóðèðîâàííàÿ well-structured subject area
îáëàñòü ïðîáëåìíàÿ problem area
îáîáùåíèå çíàíèé
îáîáùåíèå èíäóêòèâíîå inductive generalization
îáîëî÷êà shell
îáîñíîâàíèå argument
îáðàáîòêà åñòåñòâåííîãî ÿçûêà natural language processing
îáðàáîòêà èçîáðàæåíèé image processing
îáðàáîòêà ïàðàëëåëüíàÿ parallel processing
îáðàáîòêà ñèãíàëîâ signal processing
îáðàç image
îáðàçåö pattern
îáó÷åíèå learning
îáó÷åíèå íà ïðèìåðàõ learning from examples
îáùåíèå communication
îáúåäèíåíèå ñâèäåòåëüñòâ combination of evidences
îáúÿñíåíèå explanation
îãðàíè÷åíèå öåëîñòíîñòè
îæèâëåíèå
îïðàâäàíèå justification
îòëàäêà áàçû çíàíèé knowledge base debugging
îòëàäêà ñåìàíòè÷åñêàÿ
îòëàäêà ñèíòàêñè÷åñêàÿ
îòíîøåíèå relation
îòíîøåíèå àíòèðåôëåêñèâíîå antireflexive relation
îòíîøåíèå àíòèñèììåòðè÷íîå antisymmetric relation
îòíîøåíèå àíòèòðàíçèòèâíîå antitransitive relation
îòíîøåíèå âèðòóàëüíîå virtual relation
îòíîøåíèå âðåìåííîå temporal relation
îòíîøåíèå äåéñòâèÿ action relation
îòíîøåíèå èíòåíñèîíàëüíîå intensional relation
îòíîøåíèå êàóçàëüíîå causal relation
îòíîøåíèå ìîäåëèðîâàíèÿ íå÷åòêî fuzzy modelling relation
îòíîøåíèå íåðåôëåêñèâíîå non-reflexive relation
îòíîøåíèå íåñèììåòðè÷íîå non-symmetric relation
îòíîøåíèå íåòðàíçèòèâíîå non-transitive relation
îòíîøåíèå ïðîñòðàíñòâåííîå spatial relation
îòíîøåíèå ðåëåâàíòíîñòè relevance relation
îòíîøåíèå ðåôëåêñèâíîå reflexive relation
îòíîøåíèå ñåìàíòè÷åñêîå semantic relation
îòíîøåíèå ñèììåòðè÷íîå symmetric relation
îòíîøåíèå òîëåðàíòíîñòè tolerance relation
îòíîøåíèå òðàíçèòèâíîå transitive relation
îòíîøåíèå ôóíêöèîíàëüíîå functional relation
îòíîøåíèå ýêâèâàëåíòíîñòè equivalence relation
îòíîøåíèå ýêñòåíñèîíàëüíîå extensional relation
îòðèöàíèå negation
îòðèöàíèå ëîãè÷åñêîå logical negation
Ï
ïàäåæ ãëóáèííûé deep case
ïàäåæ Ôèëëìîðà Fillmor case
ïàìÿòü àññîöèàòèâíàÿ associative memory
ïàìÿòü âèðòóàëüíàÿ virtual memory
ïàìÿòü èêîíè÷åñêàÿ iconic memory
ïàïëàéí-àðõèòåêòóðà pipeline architecture
ïåðåâîä ìàøèííûé machine translation
ïåðåìåííàÿ ëèíãâèñòè÷åñêàÿ linguistic variable
ïåðåìåííàÿ ïðîïîçèöèîíàëüíàÿ propositional variable
ïåðåìåííàÿ ñâÿçàííàÿ bound variable
ïåðëîêóöèÿ perlocution
ïåðöåïòðîí perceptron
ïåðöåïöèÿ perception
ïèêñåë pixel
ïèêòîãðàììà
ïëàíèðîâàíèå planning
ïëàíèðîâàíèå äåÿòåëüíîñòè activity planning
ïëàíèðîâàíèå èåðàðõè÷åñêîå hierarchical planning
ïëàíèðîâàíèå ðàñïðåäåëåííîå distributed planning
ïëàíèðîâàíèå ñòðàòåãè÷åñêîå strategic planning
ïëàíèðîâàíèå òàêòè÷åñêîå tactic planning
ïëàíèðîâùèê planner
ïîäõîä áàéåñîâñêèé Bayesian approach
ïîèñê search
ïîèñê àññîöèàòèâíûé associative search
ïîèñê â ãëóáèíó depth-first search
ïîèñê â ïðîñòðàíñòâå çàäà÷ search in problem space
ïîèñê â ïðîñòðàíñòâå ñîñòîÿíèé search in state space
ïîèñê â øèðèíó breadth-first search
ïîèñê âîñõîäÿùèé
ïîèñê èíôîðìàöèîííûé information search
ïîèñê íèñõîäÿùèé
ïîèñê ïî îáðàçöó pattern-matching
ïîèñê ïî ïðèíöèïó "ñïåðâà ëó÷øå"best-first search
ïîèñê ñëó÷àéíûé
ïîèñê òèïà "ñïåðâà âãëóáü"
ïîèñê òèïà "ñïåðâà âøèðü"
ïîíèìàíèå åñòåñòâåííîãî ÿçûêà natural language understanding
ïîíÿòèå concept
ïîðîæäåíèå ãèïîòåç àâòîìàòè÷åñêîå automated hypothesis generation
ïîðîæäåíèå òåêñòà text generation
ïîòîê äàííûõ data flow
ïðàâèëà äå Ìîðãàíà de Morgan rules
ïðàâèëî rule
ïðàâèëî âûâîäà inference rule
ïðàâèëî âûâîäà êîìïîçèöèîííîå compositional inference rule
ïðàâèëî ñèíòàêñè÷åñêîå syntactic rule
ïðåäèêàò predicate
ïðåäñòàâëåíèå äàííûõ data representation
ïðåäñòàâëåíèå çíàíèé knowledge representation
ïðåäñòàâëåíèå ýêñòåíñèîíàëüíîå extensional representation
ïðåñóïïîçèöèÿ presupposition
ïðèíöèï ðåçîëþöèè resolution principle
ïðèîáðåòåíèå çíàíèé knowledge acquisition
ïðîãðàììà èãðîâàÿ game program
ïðîãðàììà ýâðèñòè÷åñêàÿ heuristic program
ïðîãðàììèðîâàíèå programming
ïðîãðàììèðîâàíèå ëîãè÷åñêîå logical programming
ïðîãðàììèðîâàíèå îáúåêòíî-îðèåíòèðîâàííîå object-oriented programming
ïðîãðàììèðîâàíèå ôóíêöèîíàëüíîå
ïðîãðàììèðîâàíèå ýâðèñòè÷åñêîå heuristic programming
ïðîäóêöèÿ production
ïðîïîçèöèÿ proposition
ïðîñòðàíñòâî çàäà÷
ïðîñòðàíñòâî Îñãóäà Osgood space
ïðîñòðàíñòâî ñåìàíòè÷åñêîå semantic space
ïðîñòðàíñòâî ñîñòîÿíèé state space
ïðîñòðàíñòâî öåëåâîå goal space
ïðîòèâîðå÷èâîñòü àáñîëþòíàÿ absolute inconsistency
ïðîòèâîðå÷èâîñòü ìîäåëüíàÿ model inconsistency
ïðîòîôðåéì frame-prototype
ïðîöåäóðà îïðîâåðæåíèÿ refutation procedure
ïðîöåäóðà ïðèñîåäèíåííàÿ attached procedure
ïðîöåññ àñèíõðîííûé asynchronous process
ïðîöåññîð àññîöèàòèâíûé associative processor
ïðîöåññîð áàçû äàííûõ data base processor
ïðîöåññîð ëèíãâèñòè÷åñêèé linguistic processor
ïðîöåññîð ëîãè÷åñêèé logical processor
ïðîöåññîð ëîãè÷åñêîãî âûâîäà inference processor
ïðîöåññîð ìàòðè÷íûé matrix processor
ïðîöåññîð ñèìâîëüíûé simbolic processor
ïñèõîëîãèÿ êîãíèòèâíàÿ cognitive psychology
Ð
ðàçðåøèìîñòü àëãîðèòìè÷åñêàÿ algorithmic resolvability
ðàñïîçíàâàíèå îáðàçîâ pattern-recognition
ðàñïîçíàâàíèå ðå÷è speech recognition
ðàññòîÿíèå ñåìàíòè÷åñêîå semantic distance
ðàññóæäåíèå reasoning
ðàññóæäåíèå àâòîýïèñòåìè÷åñêîå autoepistemic reasoning
ðàññóæäåíèå ãåðìåíåâòè÷åñêîå hermeneutics reasoning
ðàññóæäåíèå çäðàâîãî ñìûñëà common-sense reasoning
ðàññóæäåíèå íåìîíîòîííîå non-monotonic reasoning
ðàññóæäåíèå ïî àíàëîãèè reasoning by analogy
ðàññóæäåíèå ïî àññîöèàöèè reasoning by association
ðàññóæäåíèå ïî óìîë÷àíèþ default reasoning
ðàññóæäåíèå ïðàâäîïîäîáíîå plausible reasoning
ðåçîëüâåíòà resolvent
ðåçîëþöèÿ resolution
ðåøàòåëü çàäà÷ problem solver
ðåøåòêà Êåëëè ðåïåðòóàðíàÿ repertoire lattice of Kelly
ÐÈÑÊ-àðõèòåêòóðà RISC-architecture
ðîáîò àâòîíîìíûé autonomous robot
ðîáîò èíòåãðàëüíûé integral robot
ðîáîò èíòåëëåêòóàëüíûé intelligent robot
Ñ
ñáîðêà ìóñîðà garbage collection
ñâèäåòåëüñòâî evidence
ñåêâåíöèÿ sequent
ñåìàíòèêà semantics
ñåìàíòèêà ñèòóàòèâíàÿ situational semantics
ñåìèîòèêà semiotics
ñåòü network
ñåòü àññîöèàòèâíàÿ associative network
ñåòü âûâîäà inference network
ñåòü êàóçàëüíàÿ causal network
ñåòü ïåðåõîäîâ ðàñøèðåííàÿ argumented transition network
ñåòü Ïåòðè Petri network
ñåòü ïðè÷èííî-ñëåäñòâåííàÿ causal network
ñåòü ñåìàíòè÷åñêàÿ semantic network
ñåòü ñåìàíòè÷åñêàÿ èíòåíñèîíàëüíàÿ intensional semantic network
ñåòü ñåìàíòè÷åñêàÿ ýêñòåíñèîíàëüíàÿ extensional semantic network
ñåòü ñîåäèíèòåëüíàÿ connectional network
ñèëëîãèçì syllogism
ÑÈÌÄ-àðõèòåêòóðà SIMD-architecture
ñèíòàêñèñ syntax
ñèíòåç ïðîãðàìì àâòîìàòè÷åñêèé automated program synthesis
ñèíòåç ïðîãðàìì äåäóêòèâíûé inductive program synthesis
ñèíòåç ïðîãðàìì èíäóêòèâíûé inductive program synthesis
ñèíòåç ïðîãðàìì òðàíñôîðìàöèîííûé
ñèíòåç òåêñòà
ñèñòåìà àâòîìàòèçèðîâàííîãî ïðîåêòèðîâàíèÿ computer-aided design
ñèñòåìà àêñèîìàòè÷åñêàÿ axiomatic system
ñèñòåìà âîïðîñíî-îòâåòíàÿ question-answering system
ñèñòåìà äåäóêòèâíàÿ deductive system
ñèñòåìà äîâåðèÿ belief system
ñèñòåìà åñòåñòâåííî-ÿçûêîâàÿ natural language system
ñèñòåìà èíäóêòèâíàÿ inductive system
ñèñòåìà èíòåëëåêòóàëüíàÿ intelligent system
ñèñòåìà èíòåëëåêòóàëüíàÿ îáó÷àþùàÿ intelligent teaching system
ñèñòåìà èíòåëëåêòóàëüíàÿ îáó÷àþùàÿñÿ intelligent learning system
ñèñòåìà èíòåðàêòèâíàÿ interactive system
ñèñòåìà êâàçèàêñèîìàòè÷åñêàÿ
ñèñòåìà ìóëüòèïðîöåññîðíàÿ multi-processor system
ñèñòåìà îáó÷àþùàÿñÿ learning system
ñèñòåìà îáúÿñíåíèÿ explanatory system
ñèñòåìà, îñíîâàííàÿ íà çíàíèÿõ knowledge-based system
ñèñòåìà, îñíîâàííàÿ íà ïðàâèëàõ rule-based system
ñèñòåìà ïðåäñòàâëåíèÿ çíàíèé knowledge representation system
ñèñòåìà ïðîäóêöèé production system
ñèñòåìà ïðîäóêöèîííàÿ production system
ñèñòåìà ïÿòîãî ïîêîëåíèÿ âû÷èñëèòåëüíàÿ fifth generation computer system
ñèñòåìà óïðàâëåíèÿ àâòîìàòèçèðîâàííàÿ computer-aided control system
ñèñòåìà óïðàâëåíèÿ áàçîé äàííûõ data base management system
ñèñòåìà óïðàâëåíèÿ áàçîé çíàíèé knowledge base management system
ñèñòåìà óïðàâëåíèÿ ïðîèçâîäñòâîì
ñèñòåìà óïðàâëåíèÿ òåõíîëîãè÷åñêèì ïðîöåññîì
ñèñòåìà ôîðìàëüíàÿ formal system
ñèñòåìà ôðåéìîâ frame system
ñèñòåìà ýêñïåðòíàÿ expert system
ñèñòåìà ýêñïåðòíàÿ ïóñòàÿ tool expert system
ñëåäñòâèå ëîãè÷åñêîå logical consequence
ñëîò slot
ñîáûòèå event
ñîïîñòàâëåíèå ñ îáðàçöîì pattern-matching
ñîñòàâëÿþùàÿ çíàíèé èíòåíñèîíàëüíàÿ
ñîñòàâëÿþùàÿ çíàíèé ýêñòåíñèîíàëüíàÿ
ñïèñîê àññîöèàòèâíûé associative list
ñðåäñòâà èíæåíåðèè çíàíèé èíñòðóìåíòàëüíûå knowledge engineering tools
ññûëêà àíàôîðè÷åñêàÿ anaphoric reference
ñòðàòåãèÿ óïðàâëåíèÿ âûâîäîì inference control strategy
ñòðóêòóðà ãëóáèííàÿ deep structure
ñòðóêòóðà êîãíèòèâíàÿ cognitive structure
ñòðóêòóðà îäíîðîäíàÿ homogeneous structure
ñòðóêòóðà ïàäåæíàÿ case structure
ñòðóêòóðà ïîçíàâàòåëüíàÿ cognitive structure
ñóæäåíèå judgement
ñóùíîñòü entity
ñõåìà êîíöåïòóàëüíàÿ conceptual scheme
ñöåíàðèé script
Ò
òâîð÷åñòâî ìàøèííîå computer art
òåçèñ ×åð÷à Church thesis
òåîðèÿ àêñèîìàòè÷åñêàÿ axiomatic theory
òåîðèÿ ëîãè÷åñêàÿ logical theory
òåîðèÿ ðå÷åâûõ àêòîâ speech act theory
òåðì term
òèï äàííûõ data type
òèï äàííûõ àáñòðàêòíûé abstract data type
Ó
óíèâåðñóì universum
óíèâåðñóì Ýðáðàíà Herbrand universum
óíèôèêàòîð unifier
óíèôèêàòîð íàèáîëüøèé îáùèé most general unifier
óíèôèêàöèÿ unification
óïðàâëåíèå ñèòóàöèîííîå situational control
Ô
ôàñåò facet
ôîêóñ focus
ôîðìà ïðåôèêñíàÿ íîðìàëüíàÿ prefix normal form
ôîðìóëà àòîìàðíàÿ atomic formula
ôîðìóëà çàìêíóòàÿ closed formula
ôîðìóëà îáùåçíà÷èìàÿ valid formula
ôîðìóëà îòêðûòèÿ
ôðàêòàë fractail
ôðåéì frame
ôðåéì-îáðàçåö frame-prototype
ôðåéì ïàäåæíûé case frame
ôðåéì-ïðîòîòèï prototype frame
ôðåéì-ýêçåìïëÿð frame-example
ôóíêöèÿ âûõîäîâ
ôóíêöèÿ äîâåðèÿ belief function
ôóíêöèÿ ïåðåõîäîâ membership function
ôóíêöèÿ ïðèíàäëåæíîñòè membership function
ôóíêöèÿ Ñêîëåìà Skolem function
Õ
Ö
öåïî÷êà âûâîäà inference chain
×
Ø
øêàëà àáñîëþòíàÿ absolute scale
øêàëà ìåòðè÷åñêàÿ metric scale
øêàëà Îñãóäà Osgood scale
øêàëà îòíîñèòåëüíàÿ relative scale
øêàëà ðàçìûòàÿ fuzzy scale
øêàëà òîïîëîãè÷åñêàÿ topological scale
øêàëà óíèâåðñàëüíàÿ universal scale
Ù
Ý
ÝÂÌ íåéðîáèîíè÷åñêèå neurobionical computer
ýâðèñòèêà heuristics
Þ
ß
ÿçûê àâòîìàòíûé
ÿçûê çàïðîñîâ query language
ÿçûê êîíòåêñòíî-ñâîáîäíûé
ÿçûê êîíòåêñòíî-ñâÿçàííûé
ÿçûê ïðåäñòàâëåíèÿ çíàíèé knowledge representation language
ÿçûê ïðåäñòàâëåíèÿ çíàíèé ëîãè÷åñêèé logical knowledge representation language
ÿçûê ïðîäóêöèîííûé production language
ÿçûê ñåêâåíöèé
ÿçûê ôðåéìîâûé frame language
ÿùèê ñåðûé
ÿùèê ÷åðíûé black box
Âàø êîììåíòàðèé î êíèãå Îáðàòíî â ðàçäåë Íàóêà
|