找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Symbolic and Quantitative Approaches to Reasoning and Uncertainty; European Conference Michael Clarke,Rudolf Kruse,Serafín Moral Conferenc

[复制链接]
楼主: Denial
发表于 2025-3-30 11:12:26 | 显示全部楼层
A logic for reasoning about safety in decision support systems,at actions recommended by the system will have minimal undesirable consequences. The objective of this paper is to proposes a logical formalism for reasoning about the . of a decision support system. The proposed logical language makes provision for representing time, preferences, actions and also d
发表于 2025-3-30 14:56:29 | 显示全部楼层
发表于 2025-3-30 16:54:00 | 显示全部楼层
Uncertainty in constraint satisfaction problems: A probabilistic approach,y that it is a part of the real problem (the latter being only partially known). The probability degrees on the relevance of the constraints enable us to define, for each instanciation, the probability that it is a solution of the real problem. We briefly give a methodology for the search of the bes
发表于 2025-3-30 21:40:44 | 显示全部楼层
A unifying logical framework for reason maintenance,cation based as well as for assumption based methods, thus giving a . semantics to both of them. Instead of restricting ourselves to only propositional Horn clauses, we‘ll admit arbitrary logics, e.g. full first order language. This enables us to characterize systems as a whole, including both the r
发表于 2025-3-31 04:35:10 | 显示全部楼层
发表于 2025-3-31 06:07:51 | 显示全部楼层
发表于 2025-3-31 11:44:54 | 显示全部楼层
发表于 2025-3-31 14:36:07 | 显示全部楼层
: A formalism for reasoning with relative-strength defaults,ncerning it is devised. The resulting system, also called ., is then compared to ... We show that, while . is very similar to .. and displays comparable reasoning processes most of the time, they are not the same and . is more in agreement with common sense in some situations. Comparing . to the str
发表于 2025-3-31 20:16:37 | 显示全部楼层
发表于 2025-4-1 00:16:15 | 显示全部楼层
Restricted access logics for inconsistent information,ms — formulae are labelled, and proof rules defined to manipulate both the formulae and the labels. The extra conditions on the proof rules are then defined in terms of the labels. This gives us a class of logics, called restricted access logics, that meet the desiderata above.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-4 20:57
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表