找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Automated Deduction - CADE-15; 15th International C Claude Kirchner,Hélène Kirchner Conference proceedings 1998 Springer-Verlag Berlin Heid

[复制链接]
楼主: Enlightening
发表于 2025-3-28 17:59:40 | 显示全部楼层
发表于 2025-3-28 18:48:46 | 显示全部楼层
,System description: Proof planning in higher-order logic with λClam,planning to a number of types of problem is outlined, in particular the synthesis and verification of software and hardware systems. The use of a higher-order metatheory overcomes problems encountered in . because of its inability to reason properly about higher-order objects. . is written in .Prolog.
发表于 2025-3-29 01:28:34 | 显示全部楼层
发表于 2025-3-29 04:37:19 | 显示全部楼层
Automated Deduction - CADE-15978-3-540-69110-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-29 10:59:57 | 显示全部楼层
发表于 2025-3-29 12:01:17 | 显示全部楼层
The key aims of a presentation,der unification. Proofs of these properties are given, in particular uniqueness of the answer and the most-general-unifier property. This unification algorithm can be used to generalize first-order proofsearch algorithms to second-order logic, making possible for example a straighforward treatment of McCarthy‘s circumscription schema.
发表于 2025-3-29 16:57:24 | 显示全部楼层
Jaume Segura,Charles Hawkins,Jerry Sodenplanning to a number of types of problem is outlined, in particular the synthesis and verification of software and hardware systems. The use of a higher-order metatheory overcomes problems encountered in . because of its inability to reason properly about higher-order objects. . is written in .Prolog.
发表于 2025-3-29 21:46:49 | 显示全部楼层
发表于 2025-3-30 01:35:38 | 显示全部楼层
https://doi.org/10.1007/BFb0054239Automated Reasoning; Erfüllbarkeitsproblem der Aussagenlogik; Formal Verification; Linear Logic; Nonclas
发表于 2025-3-30 06:23:22 | 显示全部楼层
978-3-540-64675-4Springer-Verlag Berlin Heidelberg 1998
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-20 07:39
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表