找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Interfaces: Explorations in Logic, Language and Computation; ESSLLI 2008 and ESSL Thomas Icard,Reinhard Muskens Conference proceedings 2010

[复制链接]
楼主: Denial
发表于 2025-3-23 12:38:45 | 显示全部楼层
Semantic Meaning and Pragmatic Inference in Non-cooperative Conversationpecial case of a more general pragmatic inference procedure at each iteration step. The resulting analysis of message credibility improves on previous game-theoretic analyses, is more general and places credibility in the linguistic context where it, arguably, belongs.
发表于 2025-3-23 15:53:19 | 显示全部楼层
https://doi.org/10.1007/978-3-642-14729-6cognition; computation; computational linguistics; description logic; human-robot interaction; linguistic
发表于 2025-3-23 20:29:48 | 显示全部楼层
发表于 2025-3-23 23:10:05 | 显示全部楼层
Interfaces: Explorations in Logic, Language and Computation978-3-642-14729-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-24 05:04:29 | 显示全部楼层
What Makes a Knight?In Smullyan’s well known logic puzzles (see for instance [3]), the notion of a ., which is a creature that always speaks the truth, plays an important role. Rabern and Rabern (in [2]) made the following observation with respect to knights. They noted that when a knight is asked (1), he gets into serious trouble.
发表于 2025-3-24 10:05:49 | 显示全部楼层
Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting SystemsThis paper describes ., a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by . induce small bounds on the derivational complexity of the considered system. We explain the tool in detail, and give an overview of the employed proof methods.
发表于 2025-3-24 14:12:07 | 显示全部楼层
发表于 2025-3-24 16:41:15 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/470943.jpg
发表于 2025-3-24 22:14:23 | 显示全部楼层
Can DP Be a Scope Island?l integrity of DP via an Economy-based constraint on QR (cf. [4])..This squib is in four parts. I first lay out Sauerland’s three arguments for QR out of DP. I present (a slightly modified version of) his mechanism for constraining QR. I show that it both over- and under- generates. I conclude by ar
发表于 2025-3-25 02:15:54 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 16:44
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表