找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Artificial Intelligence Through Search; Christopher James Thornton,Benedict Boulay Book 1992 Springer Science+Business Media Dordrecht 199

[復(fù)制鏈接]
樓主: 珍珠無
21#
發(fā)表于 2025-3-25 04:01:16 | 只看該作者
Concept learning (description search),ns and facts as premises it is sometimes advantageous to make the search function generate the goals and/or the facts. Forwards search can be used to discover which high-level conclusions can be drawn from the given set of facts and backwards search can be used to see which sets of facts might enable the drawing of given conclusions.
22#
發(fā)表于 2025-3-25 10:57:15 | 只看該作者
23#
發(fā)表于 2025-3-25 13:58:46 | 只看該作者
https://doi.org/10.1007/978-3-031-68114-1he conclusion corresponds to the goal and the bits of evidence are just the subgoals. When we implement search rules in this way, the backward AND/OR-tree search function effectively tests whether it can draw certain conclusions from the available evidence; that is to say, it implements a form of primitive reasoning.
24#
發(fā)表于 2025-3-25 19:05:29 | 只看該作者
25#
發(fā)表于 2025-3-25 21:05:28 | 只看該作者
Parsing (search as analysis),he conclusion corresponds to the goal and the bits of evidence are just the subgoals. When we implement search rules in this way, the backward AND/OR-tree search function effectively tests whether it can draw certain conclusions from the available evidence; that is to say, it implements a form of primitive reasoning.
26#
發(fā)表于 2025-3-26 03:43:52 | 只看該作者
27#
發(fā)表于 2025-3-26 07:41:26 | 只看該作者
Setting the Context: China Before 1895,sidering sets of goals as a states in the previous chapter, each state could be made up of some arbitrary number of such goals. In principle, descriptions (i.e. nodes) can be as complex as we like. Provided the successor function can be computed, the search process can be applied in the usual way.
28#
發(fā)表于 2025-3-26 10:08:39 | 只看該作者
Planning (microworld search),sidering sets of goals as a states in the previous chapter, each state could be made up of some arbitrary number of such goals. In principle, descriptions (i.e. nodes) can be as complex as we like. Provided the successor function can be computed, the search process can be applied in the usual way.
29#
發(fā)表于 2025-3-26 13:25:41 | 只看該作者
Addressing Spoken Fluency in the Classroomg of the word “search”. It is just the process of looking around systematically for a given location or object. In a sense, path-finding search is just ordinary, common-or-garden search, but cast in a computational framework.
30#
發(fā)表于 2025-3-26 17:43:33 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-22 18:16
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
广西| 竹山县| 廊坊市| 昭苏县| 岳普湖县| 张掖市| 印江| 襄汾县| 南宫市| 伊春市| 海林市| 陇西县| 潜江市| 济阳县| 历史| 滨州市| 西青区| 桂林市| 桐乡市| 海兴县| 江津市| 六枝特区| 松溪县| 华坪县| 桦甸市| 江口县| 湛江市| 盐池县| 慈溪市| 广东省| 定西市| 祁连县| 洛川县| 顺义区| 衡山县| 濮阳市| 阿勒泰市| 文山县| 汉寿县| 游戏| 郎溪县|