发布求助
文献互助 智能选刊 最新文献

Conference on Computer Logic最新文献

筛选
英文 中文
Gentzen-type systems and resolution rules. Part I. Propositional logic 根岑式制度和决议规则。第一部分:命题逻辑
Conference on Computer Logic Pub Date : 1990-03-01 DOI: 10.1007/3-540-52335-9_55
G. Mints
{"title":"Gentzen-type systems and resolution rules. Part I. Propositional logic","authors":"G. Mints","doi":"10.1007/3-540-52335-9_55","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_55","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126614049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 131
Geometry of interaction 2: deadlock-free algorithms 交互的几何2:无死锁算法
Conference on Computer Logic Pub Date : 1990-03-01 DOI: 10.1007/3-540-52335-9_49
J. Girard
{"title":"Geometry of interaction 2: deadlock-free algorithms","authors":"J. Girard","doi":"10.1007/3-540-52335-9_49","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_49","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131371818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 141
On the problem of reducing search in logic program execution 逻辑程序执行中减少搜索的问题
Conference on Computer Logic Pub Date : 1990-03-01 DOI: 10.1007/3-540-52335-9_56
V. S. Neiman
{"title":"On the problem of reducing search in logic program execution","authors":"V. S. Neiman","doi":"10.1007/3-540-52335-9_56","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_56","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"17 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132363305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On connections between classical and constructive semantics 论经典语义学与构式语义学的联系
Conference on Computer Logic Pub Date : 1990-03-01 DOI: 10.1007/3-540-52335-9_59
S. Starchenko, A. Voronkov
{"title":"On connections between classical and constructive semantics","authors":"S. Starchenko, A. Voronkov","doi":"10.1007/3-540-52335-9_59","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_59","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"11 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126149720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Correctness of short proofs in theory with notions of feasibility 用可行性的概念对理论上的简短证明的正确性
Conference on Computer Logic Pub Date : 1990-03-01 DOI: 10.1007/3-540-52335-9_57
V. Orevkov
{"title":"Correctness of short proofs in theory with notions of feasibility","authors":"V. Orevkov","doi":"10.1007/3-540-52335-9_57","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_57","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Algorithms for Probabilistic Inference 概率推理算法
Conference on Computer Logic Pub Date : 1990-03-01 DOI: 10.1007/3-540-52335-9_48
E. Dantsin
{"title":"Algorithms for Probabilistic Inference","authors":"E. Dantsin","doi":"10.1007/3-540-52335-9_48","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_48","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124929652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On some applications of Heyting-valued analysis II heyting值分析的若干应用2
Conference on Computer Logic Pub Date : 1990-03-01 DOI: 10.1007/3-540-52335-9_53
V. Lyubetsky
{"title":"On some applications of Heyting-valued analysis II","authors":"V. Lyubetsky","doi":"10.1007/3-540-52335-9_53","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_53","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129865055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Flow-diagrams with sets 带有集合的流程图
Conference on Computer Logic Pub Date : 1988-12-01 DOI: 10.1007/3-540-52335-9_60
A. P. Stolboushkin
{"title":"Flow-diagrams with sets","authors":"A. P. Stolboushkin","doi":"10.1007/3-540-52335-9_60","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_60","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124466192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
On conditions of full coherence in biclosed categories: a new application of proof theory 双闭范畴的完全相干条件:证明论的新应用
Conference on Computer Logic Pub Date : 1988-12-01 DOI: 10.1007/3-540-52335-9_44
A. A. Babaev, S. Soloviev
{"title":"On conditions of full coherence in biclosed categories: a new application of proof theory","authors":"A. A. Babaev, S. Soloviev","doi":"10.1007/3-540-52335-9_44","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_44","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133448055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
The resolution program, able to decide some solvable classes 决议程序，能够决定一些可解决的类
Conference on Computer Logic Pub Date : 1988-12-01 DOI: 10.1007/3-540-52335-9_61
T. Tammet
{"title":"The resolution program, able to decide some solvable classes","authors":"T. Tammet","doi":"10.1007/3-540-52335-9_61","DOIUrl":"https://doi.org/10.1007/3-540-52335-9_61","url":null,"abstract":"","PeriodicalId":318340,"journal":{"name":"Conference on Computer Logic","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114600327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信