找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computational Logic in Multi-Agent Systems; 6th International Wo Francesca Toni,Paolo Torroni Conference proceedings 2006 Springer-Verlag B

[复制链接]
楼主: 去是公开
发表于 2025-3-28 14:35:16 | 显示全部楼层
Advances in Probabilistic Graphical Modelst the object level with no reference to meta-concepts in the definition of the axiom system. We show that the logic of Halpern and Lakemeyer can be encoded in our system in the form of a particular logical space.
发表于 2025-3-28 19:14:09 | 显示全部楼层
Amir B. Geva,Hillel Pratt,Yehoshua Y. Zeevicted; from this, a priority structure is derived and applied to the problem of forming the right opinion. Consolidated with an unquestioned knowledge base, this provides an unambiguous account of what an agent should believe, conditionally on which information sources are trusted. Applications in multi-agent doxastic logic are sketched.
发表于 2025-3-29 01:24:42 | 显示全部楼层
发表于 2025-3-29 07:04:01 | 显示全部楼层
发表于 2025-3-29 10:10:36 | 显示全部楼层
发表于 2025-3-29 15:15:49 | 显示全部楼层
发表于 2025-3-29 18:42:55 | 显示全部楼层
Contextual Terminologiesription logics to reason within contexts (intra-contextual reasoning), allowing at the same time the possibility to reason also about contexts and their interplay (inter-contextual reasoning). Using this framework, two complex scenarios are discussed in detail and formalized.
发表于 2025-3-29 20:29:00 | 显示全部楼层
Combining Answer Sets of Nonmonotonic Logic Programsemantics of two programs. Such program composition has application to coordinating knowledge bases in multi-agent environments. We provide methods for computing program composition and discuss their properties.
发表于 2025-3-30 01:08:07 | 显示全部楼层
Speculative Constraint Processing with Iterative Revision for Disjunctive Answersed a framework that allows an agent not only to perform speculative computation, but also to accept iterative answer revision for yes/no questions. In this paper, we present an extension of the framework for more general types of questions using constraint logic programming (CLP).
发表于 2025-3-30 07:48:53 | 显示全部楼层
Decisiveness in Loopy Propagationince the logic is not semantically compact, a strongly complete . axiomatization is impossible. Instead we present, first, a strongly complete . system, and, second, a strongly complete finitary system for a slightly weaker variant of the language.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-17 12:32
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表