找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Extensions of Logic Programming; International Worksh Peter Schroeder-Heister Conference proceedings 1991 Springer-Verlag Berlin Heidelberg

[复制链接]
查看: 41106|回复: 51
发表于 2025-3-21 17:40:16 | 显示全部楼层 |阅读模式
书目名称Extensions of Logic Programming
副标题International Worksh
编辑Peter Schroeder-Heister
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Extensions of Logic Programming; International Worksh Peter Schroeder-Heister Conference proceedings 1991 Springer-Verlag Berlin Heidelberg
描述This volume contains finalized versions of papers presented at an international workshop on extensions of logic programming, held at the Seminar for Natural Language Systems at the University of Tübingen in December 1989. Several recent extensions of definite Horn clause programming, especially those with a proof-theoretic background, have much in common. One common thread is a new emphasis on hypothetical reasoning, which is typically inspired by Gentzen-style sequent or natural deduction systems. This is not only of theoretical significance, but also bears upon computational issues. It was one purpose of the workshop to bring some of these recent developments together. The volume covers topics such as the languages Lambda-Prolog, N-Prolog, and GCLA, the relationship between logic programming and functional programming, and the relationship between extensions of logic programming and automated theorem proving. It contains the results of the first conference concentrating on proof-theoretic approaches to logic programming.
出版日期Conference proceedings 1991
关键词Automat; Extension; Prolog; automated theorem proving; logic; programming; proving; theorem proving
版次1
doihttps://doi.org/10.1007/BFb0038689
isbn_softcover978-3-540-53590-4
isbn_ebook978-3-540-46879-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1991
The information of publication is updating

书目名称Extensions of Logic Programming影响因子(影响力)




书目名称Extensions of Logic Programming影响因子(影响力)学科排名




书目名称Extensions of Logic Programming网络公开度




书目名称Extensions of Logic Programming网络公开度学科排名




书目名称Extensions of Logic Programming被引频次




书目名称Extensions of Logic Programming被引频次学科排名




书目名称Extensions of Logic Programming年度引用




书目名称Extensions of Logic Programming年度引用学科排名




书目名称Extensions of Logic Programming读者反馈




书目名称Extensions of Logic Programming读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:07:08 | 显示全部楼层
发表于 2025-3-22 01:38:50 | 显示全部楼层
A logic program for transforming sequent proofs to natural deduction proofs,y and naturally specify both sequent calculi and natural deduction inference systems for first-order logic. For the intuitionistic subset of first-order logic, we present a set of .. formulas which simultaneously specifies both kinds of inference systems and provides a direct and concise account of
发表于 2025-3-22 06:39:31 | 显示全部楼层
Extensions to logic programming motivated by the construction of a generic theorem prover,o categories: logical extensions and the addition of constructs to allow for increased control. There is a unifying theme to the proposed logical extensions, and that is the scoped introduction of extensions to a programming context. More specifically, these extensions are the ability to introduce v
发表于 2025-3-22 10:48:26 | 显示全部楼层
发表于 2025-3-22 16:50:53 | 显示全部楼层
Hypothetical reasoning and definitional reflection in logic programming,ions and thus presents a new view of hypothetical reasoning. The detailed proof theory of this system is given in [7], matters of implementation and control of the corresponding programming language GCLA with detailed examples can be found in [1, 2]. In Section 1 we consider the local rule-based app
发表于 2025-3-22 17:13:33 | 显示全部楼层
发表于 2025-3-22 22:02:05 | 显示全部楼层
Introduction: Building Inclusive Museums,ction 4 relates our approach to the idea of logical frameworks and the way elimination inferences for logical constants are treated therein, and thus to the notions of logic and structure. It shows that from a certain perspective, logical reasoning is nothing but a special case of reasoning in our system.
发表于 2025-3-23 04:52:13 | 显示全部楼层
发表于 2025-3-23 07:58:08 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-31 23:15
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表