设为首页收藏本站
开启辅助访问 切换到窄版

 找回密码
 To register

QQ登录

只需一步，快速开始

扫一扫，访问微社区

  • ALL
  • Journals
  • Books

派博传思国际中心 »期刊书目

› BOOKS
› BOOKS with Alphabet C (Ca, Cb,Cc, Cd, Ce…... )

1234567下一页
返回列表

Titlebook: Computer Science Logic; 6th Workshop, CSL‘92 E. Börger,G. Jäger,M. M. Richter Conference proceedings 1993 Springer-Verlag Berlin Heidelberg

[复制链接]
查看: 29906|回复: 61
发表于 2025-3-21 18:06:54 | 显示全部楼层 |阅读模式
书目名称Computer Science Logic
副标题6th Workshop, CSL‘92
编辑E. Börger,G. Jäger,M. M. Richter
视频videohttp://file.papertrans.cn/234/233763/233763.mp4
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Computer Science Logic; 6th Workshop, CSL‘92 E. Börger,G. Jäger,M. M. Richter Conference proceedings 1993 Springer-Verlag Berlin Heidelberg
描述This volume presents the proceedings of the Computer ScienceLogic Workshop CSL ‘92, held in Pisa, Italy, inSeptember/October 1992. CSL ‘92 was thesixth of the seriesand the first one held as Annual Conference of theEuropeanAssociation for Computer Science Logic (EACSL). Fullversionsof the workshop contributions were collected aftertheir presentation and reviewed. On the basis of 58 reviews,26 papers were selected for publication, and appear here inrevised final form.Topics covered in the volume include: Turing machines,linear logic, logic of proofs, optimization problems, lambdacalculus, fixpoint logic, NP-completeness,resolution,transition system semantics, higher order partial functions,evolving algebras, functional logic programming, inductivedefinability, semantics of C, classes for a functionallanguage, NP-optimization problems, theory of typesandnames, sconing and relators, 3-satisfiability, Kleene‘sslash,negation-complete logic programs, polynomial-timeoracle machines, andmonadic second-order properties.
出版日期Conference proceedings 1993
关键词Resolution; computer; computer science; lambda calculus; logic; optimization; programming; semantics; algori
版次1
doihttps://doi.org/10.1007/3-540-56992-8
isbn_softcover978-3-540-56992-3
isbn_ebook978-3-540-47890-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1993
The information of publication is updating

书目名称Computer Science Logic影响因子(影响力)




书目名称Computer Science Logic影响因子(影响力)学科排名




书目名称Computer Science Logic网络公开度




书目名称Computer Science Logic网络公开度学科排名




书目名称Computer Science Logic被引频次




书目名称Computer Science Logic被引频次学科排名




书目名称Computer Science Logic年度引用




书目名称Computer Science Logic年度引用学科排名




书目名称Computer Science Logic读者反馈




书目名称Computer Science Logic读者反馈学科排名




单选投票, 共有 0 人参与投票
1.jpg
 

0票 0%

Perfect with Aesthetics
2.jpg
 

0票 0%

Better Implies Difficulty
3.jpg
 

0票 0%

Good and Satisfactory
4.jpg
 

0票 0%

Adverse Performance
5.jpg
 

0票 0%

Disdainful Garbage
您所在的用户组没有投票权限
Intimidate
回复

举报

发表于 2025-3-21 22:02:07 | 显示全部楼层
Afflict
回复

举报

发表于 2025-3-22 03:54:34 | 显示全部楼层
业余爱好者
回复

举报

发表于 2025-3-22 04:38:29 | 显示全部楼层
Yingqin Zheng,Bernd Carsten Stahlfication is avoided by for bidding .-abstractions in the language. However, narrowing must include a mechanism for binding HO logic variables to simple functional patterns built by partial application. A deeper investigation of lazy strategiees and infinite narrowing derivations is foreseen.
indecipherable
回复

举报

发表于 2025-3-22 08:42:37 | 显示全部楼层
Comparative transition system semantics,tain form of transitions is studied, and a “logical” approach to the notion of a bisimulation is taken that are somewhat non-standard (but, it is hoped, illuminating). Sequential composition, non-deterministic choice, iteration, and interleaving are analyzed alongside a notion of data. Atomization and synchronization are also considered.
COLIC
回复

举报

发表于 2025-3-22 15:05:40 | 显示全部楼层
On the completeness of narrowing as the operational semantics of functional logic programming,fication is avoided by for bidding .-abstractions in the language. However, narrowing must include a mechanism for binding HO logic variables to simple functional patterns built by partial application. A deeper investigation of lazy strategiees and infinite narrowing derivations is foreseen.
山羊
回复

举报

发表于 2025-3-22 19:38:44 | 显示全部楼层
山羊
回复

举报

发表于 2025-3-23 01:10:58 | 显示全部楼层
Model building by resolution,at a finite set of atoms that represents a description of an Herbrand-model. In a second step we extract from this set of atoms a full representation of a model with finite domain. We emphasize that no backtracking is needed in our model constructing algorithm.
使服水土
回复

举报

发表于 2025-3-23 01:58:34 | 显示全部楼层
就职
回复

举报

发表于 2025-3-23 07:51:02 | 显示全部楼层
行乞
回复

举报

下一页 »
1234567下一页
返回列表
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-8-26 12:47
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表