In previous papers some important properties of extensions of general default theories were given. In order to dedicate further research to default logic, a characterization of extensions is presented again and some new algorithms for reasoning tasks in default logic are presented in this paper. A class of default theories, auto-compatible default theory, is also developed. We show that the characterization and notions of compatibility and auto-compatibility, suitably applied to logic programs, yield some sufficient conditions of existence of answer sets. All these essentially develop the theories of Reiter and his followers.
{"title":"A New Research into Default Logic","authors":"Zhang Mingyi","doi":"10.1006/INCO.1996.0075","DOIUrl":"https://doi.org/10.1006/INCO.1996.0075","url":null,"abstract":"In previous papers some important properties of extensions of general default theories were given. In order to dedicate further research to default logic, a characterization of extensions is presented again and some new algorithms for reasoning tasks in default logic are presented in this paper. A class of default theories, auto-compatible default theory, is also developed. We show that the characterization and notions of compatibility and auto-compatibility, suitably applied to logic programs, yield some sufficient conditions of existence of answer sets. All these essentially develop the theories of Reiter and his followers.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"54 1","pages":"73-85"},"PeriodicalIF":1.0,"publicationDate":"1996-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73358289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1996-01-01DOI: 10.1080/03610929708831983
J. Verheijen, F. Coolen, V. D. Laan
This paper presents a selection procedure that combines Bechhofer's indifference zone selection and Gupta's subset selection approaches, by using a preference threshold. For normal populations with common known variance, a subset is selected of all populations that have sample sums within the distance of this threshold from the largest sample sum. We derive the minimal necessary sample size and the value for the preference threshold, in order to satisfy two probability requirements for correct selection, one related to indifference zone selection, the other to subset selection. Simulation studies are used to illustrate the method.
{"title":"Combining two classical approaches for statistical selection","authors":"J. Verheijen, F. Coolen, V. D. Laan","doi":"10.1080/03610929708831983","DOIUrl":"https://doi.org/10.1080/03610929708831983","url":null,"abstract":"This paper presents a selection procedure that combines Bechhofer's indifference zone selection and Gupta's subset selection approaches, by using a preference threshold. For normal populations with common known variance, a subset is selected of all populations that have sample sums within the distance of this threshold from the largest sample sum. We derive the minimal necessary sample size and the value for the preference threshold, in order to satisfy two probability requirements for correct selection, one related to indifference zone selection, the other to subset selection. Simulation studies are used to illustrate the method.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"29 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"1996-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74065082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract In this work we consider the Diffie-Hellman public-key model in which an additional short random string is shared by all users. This. which we call Public-Key Public-Randomness (PKPR) model, is very powerful, as we show that it supports simple non-interactive implementations of important cryptographic primitives. We give a noninteractive implementation of Oblivious Transfer in the PKPR model. Our implementation is secure against receivers with unlimited computational power. Building on this result, we show that all languages in NP have Perfect Zero-Knowledge Arguments in the PKPR model.
{"title":"Zero-knowledge arguments and public-key cryptography","authors":"A. Desantis, Giovanni DiCrescenzo","doi":"10.1006/INCO.1995.1121","DOIUrl":"https://doi.org/10.1006/INCO.1995.1121","url":null,"abstract":"Abstract In this work we consider the Diffie-Hellman public-key model in which an additional short random string is shared by all users. This. which we call Public-Key Public-Randomness (PKPR) model, is very powerful, as we show that it supports simple non-interactive implementations of important cryptographic primitives. We give a noninteractive implementation of Oblivious Transfer in the PKPR model. Our implementation is secure against receivers with unlimited computational power. Building on this result, we show that all languages in NP have Perfect Zero-Knowledge Arguments in the PKPR model.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"241 1","pages":"23-40"},"PeriodicalIF":1.0,"publicationDate":"1995-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74488633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"International-Conference on Theoretical Aspects of Computer Software - Preface","authors":"M. Dezani-Ciancaglini","doi":"10.1006/INCO.1994.1012","DOIUrl":"https://doi.org/10.1006/INCO.1994.1012","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"33 1","pages":"1-3"},"PeriodicalIF":1.0,"publicationDate":"1994-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83901070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1993-06-01DOI: 10.1016/0168-9274(93)90008-F
R. Trompert
{"title":"Local uniform grid refinement and systems of coupled partial differential equations","authors":"R. Trompert","doi":"10.1016/0168-9274(93)90008-F","DOIUrl":"https://doi.org/10.1016/0168-9274(93)90008-F","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"483 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"1993-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87617668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. BurchJ., M. ClarkeE., L. McMillanK., L. DillD., J. HwangL.
{"title":"Symbolic model checking","authors":"R. BurchJ., M. ClarkeE., L. McMillanK., L. DillD., J. HwangL.","doi":"10.1007/0-387-34600-7_2","DOIUrl":"https://doi.org/10.1007/0-387-34600-7_2","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"1 1","pages":""},"PeriodicalIF":1.0,"publicationDate":"1992-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82335185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-07-01DOI: 10.1016/0890-5401(91)90054-6
Yiannis N. Moshovakis
{"title":"A model of concurrency with fair merge and full recursion","authors":"Yiannis N. Moshovakis","doi":"10.1016/0890-5401(91)90054-6","DOIUrl":"https://doi.org/10.1016/0890-5401(91)90054-6","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"34 1","pages":"114-171"},"PeriodicalIF":1.0,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73646373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-04-01DOI: 10.1016/0890-5401(91)90069-E
S. Bellantoni
{"title":"Parallel random access machines with bounded memory wordsize","authors":"S. Bellantoni","doi":"10.1016/0890-5401(91)90069-E","DOIUrl":"https://doi.org/10.1016/0890-5401(91)90069-E","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"58 1","pages":"259-273"},"PeriodicalIF":1.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85396062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1989-01-01DOI: 10.1016/0890-5401(89)90021-7
H. K. Buning, U. Lowen
{"title":"Optimizing propositional calculus formulas with regard to questions of deducibility","authors":"H. K. Buning, U. Lowen","doi":"10.1016/0890-5401(89)90021-7","DOIUrl":"https://doi.org/10.1016/0890-5401(89)90021-7","url":null,"abstract":"","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"57 1","pages":"18-43"},"PeriodicalIF":1.0,"publicationDate":"1989-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75829029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：