{"title":"Studies in Computer Science","authors":"J. Rice, R. DeMillo","doi":"10.1007/978-1-4615-1791-7","DOIUrl":"https://doi.org/10.1007/978-1-4615-1791-7","url":null,"abstract":"","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"8 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131740594","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}
{"title":"Software Science and Engineering: Selected Papers from the Kyoto Symposia","authors":"I. Nakata, M. Hagiya","doi":"10.1142/1496","DOIUrl":"https://doi.org/10.1142/1496","url":null,"abstract":"","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122503088","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}
{"title":"A Regulated Accumulating Array Grammar and Its Application on a Process Assignment Problem for a Parallel Computing","authors":"T. Nishida","doi":"10.1142/9789814360128_0002","DOIUrl":"https://doi.org/10.1142/9789814360128_0002","url":null,"abstract":"","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122152918","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}
{"title":"Completeness of Depth-bounded Resolution for Weakly Reducing Programs","authors":"Hiroki Arimura","doi":"10.1142/9789814360128_0012","DOIUrl":"https://doi.org/10.1142/9789814360128_0012","url":null,"abstract":"SLDNF-resolution procedure is not complete with respect to the perfect model semantics for logic programs in general. In this paper, sve introduce two classes of logic programs containing function symbols. reducing programs and weakly reducing programs: which are characterized by the size of atom. For these classes of programs, we prove the completeness of the derivation procedure which makes use of depth-bound. First, we introduce the local finiteness of Herbrand base of a program, and prove the finite fixpoint property for the class of programs which satisfies the local finiteness. Further, we show that the class of weakly reducing programs: a subclass of locally stratified programs, has some syntactic conditions. and prove that it has the finite fixpoint property. Using the finite fispoint property; we prove the completeness of depth-bounded derivations for weakly reducing programs. In particular, we prove the completeness of unbounded derivations for reducing programs.","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117324214","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}
{"title":"Negation Technique for Context-Free Grammars","authors":"Yoshiyuki Yamashita, I. Nakata","doi":"10.1142/9789814360128_0008","DOIUrl":"https://doi.org/10.1142/9789814360128_0008","url":null,"abstract":"","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"49 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120903980","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}
{"title":"Potential of General-Purpose Reasoning Assistant System EUODHILOS","authors":"Hajime Sawamura, Toshiro Minami, Kaoru Yokota, Kyoko Ohashi","doi":"10.1142/9789814360128_0009","DOIUrl":"https://doi.org/10.1142/9789814360128_0009","url":null,"abstract":"Summary Much work has been done on special-purpose reasoning assistant systems whose underlying logics are fixed. In contrast with such a trend, this paper is devoted to a new dimension of computer-assisted reasoning research, that is, a general-purpose reasoning assistant system that aUows a user to defme his or her own logical system relevant for the objects in the problem domain and to reason about them. In the first half of the paper, the need, significance and design principle of EUODHLOS : a general-purpose system for computer-assisted reasoning, are discussed, then the system overview is described, placing emphases on the following three points: (1) formal system description language, (2) proving methodology based on several sheets for logical thought, (3) visual human-computer interface for reasoning. In the latter half, the potentials and usefulness of EUODHLOS are demonstrated through experiments and experiences of its use by a number of logics and proof examples therein, which have been used or devised in computer science, nificial inteMgence and so on. A","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123589239","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}
{"title":"Object-Oriented Approach to Discourse Understanding","authors":"Chisato Numaoka, T. Nagano, M. Tokoro","doi":"10.1142/9789814360128_0007","DOIUrl":"https://doi.org/10.1142/9789814360128_0007","url":null,"abstract":"In this paper, We explain a discourse understanding model, ADAM (Actual Discourse Assistant Model) [Numaoka 1988] and show the example of its practical use. In the computer system which has an knowledge base, it is a very important issue how a user communicates with the system. Natural language is one of the way to communicate with it, and the discourse understanding is necessary to comprehend natural language deeply. ADAM gives a more intuitive expression of the real world by introducing the object-oriented concept into situation semantics. In this model, an object has about the same meaning as the one which is called a parameter in situation semantics. An object is a unit of information to be operated by a knowledge system. All the information, such as the character of individual or a causal relation among objects, are extracted from the objects in a knowledge base. Thus, in ADAM, a knowledge system which has a natural language user interface system can cope with lots of user’s requests by utilizing these information.","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125149114","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}
{"title":"Top-down Zooming Diagnosis of Logic Programs","authors":"Machi Ueno, T. Kanamori","doi":"10.1142/9789814360128_0006","DOIUrl":"https://doi.org/10.1142/9789814360128_0006","url":null,"abstract":"This paper presents a new diagnosis algorithm for Prolog proglams. Bugs are located by tracing either proof trees or search trees in a top-down Human programmers just need to answer “Yes” or “No” for queries issued durin the to -d queries about atoms with the same pIedicates are issued contirrually so that not onl $g$ $e$ op- own tracing. Moreover, containing bugs ar identified more quickly but also queries are easier for hu no on $y$ segments to answer. An outline of an implementation of the diagnosis algorithm is shown as $we mathbb{I}$ .","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116408380","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}
T. Higashino, K. Taniguchi, T. Kasami, M. Fujii, M. Mori
{"title":"An Algebraic Method For Verifying Progress Property of Communication Protocols","authors":"T. Higashino, K. Taniguchi, T. Kasami, M. Fujii, M. Mori","doi":"10.1142/9789814360128_0003","DOIUrl":"https://doi.org/10.1142/9789814360128_0003","url":null,"abstract":"","PeriodicalId":313959,"journal":{"name":"Software Science and Engineering","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117116319","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
