International Workshops on First Order Theorem Proving最新文献

筛选
英文 中文
Presenting Constraints 提出约束
International Workshops on First Order Theorem Proving Pub Date : 2009-10-20 DOI: 10.1007/978-3-642-02716-1_1
P. Jeavons
{"title":"Presenting Constraints","authors":"P. Jeavons","doi":"10.1007/978-3-642-02716-1_1","DOIUrl":"https://doi.org/10.1007/978-3-642-02716-1_1","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132618015","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
Full First-Order Sequent and Tableau Calculi with Preservation of Solutions and the Liberalized delta-Rule but without Skolemization 无Skolemization的全一阶序列和表演算,具有解的保存和自由化delta规则
International Workshops on First Order Theorem Proving Pub Date : 2009-02-21 DOI: 10.1007/3-540-46508-1_19
Claus-Peter Wirth
{"title":"Full First-Order Sequent and Tableau Calculi with Preservation of Solutions and the Liberalized delta-Rule but without Skolemization","authors":"Claus-Peter Wirth","doi":"10.1007/3-540-46508-1_19","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_19","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124525080","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}
引用次数: 7
Completeness and Redundancy in Constrained Clause Logic 约束子句逻辑中的完备性和冗余性
International Workshops on First Order Theorem Proving Pub Date : 1900-01-01 DOI: 10.1007/3-540-46508-1_15
R. Pichler
{"title":"Completeness and Redundancy in Constrained Clause Logic","authors":"R. Pichler","doi":"10.1007/3-540-46508-1_15","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_15","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116835717","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}
引用次数: 4
An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic 经典一阶逻辑从Grz到可决片段的O ((n·log n)3)时间变换
International Workshops on First Order Theorem Proving Pub Date : 1900-01-01 DOI: 10.1007/3-540-46508-1_10
Stephane Demri, R. Goré
{"title":"An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic","authors":"Stephane Demri, R. Goré","doi":"10.1007/3-540-46508-1_10","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_10","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127953382","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}
引用次数: 9
A Further and Effective Liberalization of the delta-Rule in Free Variable Semantic Tableaux 自由变量语义表中delta规则的进一步有效自由化
International Workshops on First Order Theorem Proving Pub Date : 1900-01-01 DOI: 10.1007/3-540-46508-1_7
Domenico Cantone, Marianna Nicolosi Asmundo
{"title":"A Further and Effective Liberalization of the delta-Rule in Free Variable Semantic Tableaux","authors":"Domenico Cantone, Marianna Nicolosi Asmundo","doi":"10.1007/3-540-46508-1_7","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_7","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115120381","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}
引用次数: 16
Hidden Congruent Deduction 隐性同形演绎
International Workshops on First Order Theorem Proving Pub Date : 1900-01-01 DOI: 10.1007/3-540-46508-1_17
Grigore Roşu, J. Goguen
{"title":"Hidden Congruent Deduction","authors":"Grigore Roşu, J. Goguen","doi":"10.1007/3-540-46508-1_17","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_17","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131131730","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}
引用次数: 57
Extending Decidable Clause Classes via Constraints 通过约束扩展可决定子句类
International Workshops on First Order Theorem Proving Pub Date : 1900-01-01 DOI: 10.1007/3-540-46508-1_14
R. Pichler
{"title":"Extending Decidable Clause Classes via Constraints","authors":"R. Pichler","doi":"10.1007/3-540-46508-1_14","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_14","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116319396","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
Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction 决策程序和模型构建,或如何改进自动推理中的逻辑信息
International Workshops on First Order Theorem Proving Pub Date : 1900-01-01 DOI: 10.1007/3-540-46508-1_4
A. Leitsch
{"title":"Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction","authors":"A. Leitsch","doi":"10.1007/3-540-46508-1_4","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_4","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125889271","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
Proving Associative-Communicative Termination Using RPO-Compatible Orderings 用rpo兼容序证明关联通信终止
International Workshops on First Order Theorem Proving Pub Date : 1900-01-01 DOI: 10.1007/3-540-46508-1_3
H. Ganzinger, Ryuzo Hasegawa, D. Kapur, U. Furbach, H. Ganzinger, Germany Saarbrücken, D. Kapur
{"title":"Proving Associative-Communicative Termination Using RPO-Compatible Orderings","authors":"H. Ganzinger, Ryuzo Hasegawa, D. Kapur, U. Furbach, H. Ganzinger, Germany Saarbrücken, D. Kapur","doi":"10.1007/3-540-46508-1_3","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_3","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125525367","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}
引用次数: 11
A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory 一种新的基于表的集论非量化片段快速决策方法
International Workshops on First Order Theorem Proving Pub Date : 1900-01-01 DOI: 10.1007/3-540-46508-1_8
Domenico Cantone, C. Zarba
{"title":"A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory","authors":"Domenico Cantone, C. Zarba","doi":"10.1007/3-540-46508-1_8","DOIUrl":"https://doi.org/10.1007/3-540-46508-1_8","url":null,"abstract":"","PeriodicalId":108053,"journal":{"name":"International Workshops on First Order Theorem Proving","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131231455","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}
引用次数: 34
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学术官方微信
小红书