找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Advances in Artificial Intelligence; Third Congress of th Pietro Torasso Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993

[復(fù)制鏈接]
樓主: Truman
41#
發(fā)表于 2025-3-28 16:27:08 | 只看該作者
Bernadette Charleux,Rudolf Fausting is conceived in such a way that favorites the development of symbolic representations. This is very much related to many existing pruning techniques, but the pruning process we introduce forces the learning toward development of high level representations.
42#
發(fā)表于 2025-3-28 20:19:53 | 只看該作者
43#
發(fā)表于 2025-3-29 02:05:52 | 只看該作者
Riccardo Benedetti,Carlo Petroniossions. This is generally performed by admitting a constructor for building a concept from a set of enumerated individuals. In this paper we investigate on the consequences of introducing this type of constructor in the concept description language and we provide some complexity results on it.
44#
發(fā)表于 2025-3-29 06:26:35 | 只看該作者
45#
發(fā)表于 2025-3-29 10:48:41 | 只看該作者
https://doi.org/10.1007/978-3-8350-9367-6em; it is ., as it provides well-defined mechanisms for integrating new inference systems; it enjoys a formal, unambigous specification; and it comprises mechanisms to ensure the consistency of the overall, hybrid KB.
46#
發(fā)表于 2025-3-29 11:25:08 | 只看該作者
47#
發(fā)表于 2025-3-29 16:51:27 | 只看該作者
Myra E. Conway Ph.D.,Susan M. Hutson Ph.D.ics are concerned: Any such logic respecting some natural conditions has a noncumulative choice provability relation. In contrast to this result, we show that choice provability in the logic L1 recently introduced by Brewka is cumulative. This is possible because L1 manipulates defaults and not formulas.
48#
發(fā)表于 2025-3-29 20:33:30 | 只看該作者
A review on standard spines and o-graphs,their terminological and temporal expressiveness. The formalism and the semantics show a tight relation with propositional modal logics of time intervals. We also briefly present results on the problems of decidability of subsumption, relevance of the temporal structure and incomplete subsumption algorithms.
49#
發(fā)表于 2025-3-29 23:59:28 | 只看該作者
https://doi.org/10.1007/978-3-8350-9367-6f communication primitives, defined on the spirit of Speech Act theory, which are suitable to model agent interactions and which can be specialised to implement specific communication protocols. In particular, the paper shows how these primitives are suitable to model negotiation protocols.
50#
發(fā)表于 2025-3-30 06:45:43 | 只看該作者
https://doi.org/10.1007/978-3-8350-9367-6ormation. Machine learning techniques and a distributed agent architecture are used to help simulate the reasoning process of lawyers. In this paper, we outline our implementation of the hybrid IKBALS II Rule Based Reasoning / Case Based Reasoning system. It makes extensive use of an automated case representation editor and background information.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-29 05:28
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
六盘水市| 章丘市| 南和县| 临高县| 响水县| 磴口县| 阿克苏市| 五常市| 冷水江市| 靖边县| 陆丰市| 清徐县| 财经| 共和县| 将乐县| 六枝特区| 大洼县| 修水县| 山阳县| 汝阳县| 田林县| 兴义市| 禹城市| 蓬溪县| 龙里县| 西藏| 台湾省| 罗甸县| 昌江| 黄平县| 留坝县| 都安| 安化县| 称多县| 桐乡市| 平潭县| 鄢陵县| 夏津县| 丹寨县| 醴陵市| 华宁县|