信息与控制Pub Date : 1985-05-01DOI: 10.1016/S0019-9958(85)80003-6
Nachum Dershowitz
{"title":"Computing with rewrite systems","authors":"Nachum Dershowitz","doi":"10.1016/S0019-9958(85)80003-6","DOIUrl":"10.1016/S0019-9958(85)80003-6","url":null,"abstract":"<div><p>Term-rewriting systems, that is, sets of directed equations, provide a paradigm of computation with particularly simple syntax and semantics. Rewrite systems may be used for straightforward computation by simplifying terms. We show how, in addition, restricted forms of the Knuth—Bendix “completion” procedure may be used to interpret logic programs written as a set of equivalence-preserving rewrite rules. We discuss verification issues and also illustrate the use of the full completion procedure to synthesize rewrite programs from specifications.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 2","pages":"Pages 122-157"},"PeriodicalIF":0.0,"publicationDate":"1985-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80003-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77174831","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-04-01DOI: 10.1016/S0019-9958(85)80018-8
Oscar H. Ibarra , Louis E. Rosier
{"title":"The equivalence problem and correctness formulas for a simple class of programs","authors":"Oscar H. Ibarra , Louis E. Rosier","doi":"10.1016/S0019-9958(85)80018-8","DOIUrl":"10.1016/S0019-9958(85)80018-8","url":null,"abstract":"<div><p>This paper is concerned with the semantics (or computational power) of very simple loop programs over different sets of primitive instructions. Recently, a complete and consistent Hoare axiomatics for the class of {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>x</em> ← <em>x</em> ∸ 1, <em>do x</em> … <em>end</em>} programs which contain no nested loops, was given, where the allowable assertions were those formulas in the logic of Presburger arithmetic. The class of functions computable by such programs is exactly the class of Presburger functions. Thus, the resulting class of correctness formulas has a decidable validity problem. In this paper, we present simple loop programming languages which are, computationally, strictly more powerful, i.e., which can compute more than the class of Presburger functions. Furthermore, using a logical assertion language that is also more powerful than the logic of Presburger arithmetic, we present a class of correctness formulas over such programs that also has a decidable validity problem.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 1","pages":"Pages 18-41"},"PeriodicalIF":0.0,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80018-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78193758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-04-01DOI: 10.1016/S0019-9958(85)80019-X
Oscar H. Ibarra , Louis E. Rosier
{"title":"On simple programs with primitive conditional statements","authors":"Oscar H. Ibarra , Louis E. Rosier","doi":"10.1016/S0019-9958(85)80019-X","DOIUrl":"10.1016/S0019-9958(85)80019-X","url":null,"abstract":"<div><p>This paper is concerned with the expressive power (or computational power) of loop programs over different sets of primitive instructions. In particular, we show that an {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>do x</em> … <em>end</em>, <em>if x</em> = 0 <em>then y</em> ← <em>z</em>}-program which contains no nested loops can be transformed into an equivalent {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>do x</em> … <em>end</em>}-program (also without nested loops) in exponential time and space. This translation was earlier claimed, in the literature, to be obtainable in polynomial time, but then this was subsequently shown to imply that PSPACE = PTIME. Consequently, the question of translatability was left unanswered. Also, we show that the class of functions computable by {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>x</em> − 1, <em>do x</em> … <em>end</em>, <em>if x</em> = 0 <em>then x</em> ← <em>c</em>}-programs is exactly the class of Presburger functions.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 1","pages":"Pages 42-62"},"PeriodicalIF":0.0,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80019-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77446396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-04-01DOI: 10.1016/S0019-9958(85)80017-6
John Grant, Jack Minker
{"title":"Normalization and axiomatization for numerical dependencies","authors":"John Grant, Jack Minker","doi":"10.1016/S0019-9958(85)80017-6","DOIUrl":"10.1016/S0019-9958(85)80017-6","url":null,"abstract":"<div><p>We show how to use both horizontal and vertical decomposition to normalize a database schema which contains numerical dependencies. We present a finite set of inference rules for numerical dependencies which is a generalization of the Armstrong axioms. We prove that this set is sound and complete for some special cases.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 1","pages":"Pages 1-17"},"PeriodicalIF":0.0,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80017-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75391275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-04-01DOI: 10.1016/S0019-9958(85)80020-6
Klaus Ambos-Spies
{"title":"Sublattices of the polynomial time degrees","authors":"Klaus Ambos-Spies","doi":"10.1016/S0019-9958(85)80020-6","DOIUrl":"10.1016/S0019-9958(85)80020-6","url":null,"abstract":"<div><p>We show that any countable distributive lattice can be embedded in any interval of polynomial time degrees. Furthermore the embeddings can be chosen to preserve the least or the greatest element. This holds for both polynomial time bounded many-one and Turing reducibilities, as well as for all of the common intermediate reducibilities.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 1","pages":"Pages 63-84"},"PeriodicalIF":0.0,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80020-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91134936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80045-0
Bernard Chazelle
{"title":"How to search in history","authors":"Bernard Chazelle","doi":"10.1016/S0019-9958(85)80045-0","DOIUrl":"10.1016/S0019-9958(85)80045-0","url":null,"abstract":"<div><p>This paper considers the problem of granting a dynamic data structure the capability of remembering the situation it held at previous times. We present a new scheme for recording a history of <em>h</em> updates over an ordered set <em>S</em> of <em>n</em> objects, which allows fast neighbor computation at any time in the history. The novelty of the method is to allow the set <em>S</em> to be only partially ordered with respect to queries and the time measure to be multi-dimensional. The generality of the method makes it useful for a number of problems in 3-dimensional geometry. For example, we are able to give fast algorithms for locating a point in a 3-dimensional complex, using linear space, or for finding which of <em>n</em> given points is closest to a query plane. Using a simpler, yet conceptually similar technique, we show that with <em>O</em>(<em>n</em><sup>2</sup>) preprocessing, it is possible to determine in <em>O</em>(log<sup>2</sup> <em>n</em>) time which of <em>n</em> given points in <em>E</em><sup>3</sup> is closest to an arbitrary query point.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"64 1","pages":"Pages 77-99"},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80045-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90494156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80049-8
{"title":"Author index for volume 64","authors":"","doi":"10.1016/S0019-9958(85)80049-8","DOIUrl":"https://doi.org/10.1016/S0019-9958(85)80049-8","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"64 1","pages":"Page 173"},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80049-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138416643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80048-6
Rocco De Nicola
{"title":"Two complete axiom systems for a theory of communicating sequential processes","authors":"Rocco De Nicola","doi":"10.1016/S0019-9958(85)80048-6","DOIUrl":"10.1016/S0019-9958(85)80048-6","url":null,"abstract":"<div><p>In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, <em>J. Assoc. Comput. Mach.</em> <strong>31</strong>(3), 560) an abstract version of Hoare's CSP is defined and a denotational semantics based on the possible failures of processes is given for it. This semantics induces a natural preorder on processes. We define formally this preorder and prove that it can be characterized as the smallest relation satisfying a particular set of axioms. The characterization sheds lights on problems arising from the way divergence and underspecification are handled. After small changes to the semantic domains we propose a new semantics which is closer to the operational intuitions and suggests a possible solution to the above problems. Finally we give an axiomatic characterization for the equivalence induced by the new semantics which leads to fully abstract models in the sense of Scott.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"64 1","pages":"Pages 136-172"},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80048-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86345975","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80043-7
Merrick Furst, Richard Lipton, Larry Stockmeyer
{"title":"Pseudorandom number generation and space complexity","authors":"Merrick Furst, Richard Lipton, Larry Stockmeyer","doi":"10.1016/S0019-9958(85)80043-7","DOIUrl":"10.1016/S0019-9958(85)80043-7","url":null,"abstract":"","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"64 1","pages":"Pages 43-51"},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80043-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91233849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
信息与控制Pub Date : 1985-01-01DOI: 10.1016/S0019-9958(85)80046-2
Esko Ukkonen
{"title":"Algorithms for approximate string matching","authors":"Esko Ukkonen","doi":"10.1016/S0019-9958(85)80046-2","DOIUrl":"10.1016/S0019-9958(85)80046-2","url":null,"abstract":"<div><p>The edit distance between strings <em>a</em><sub>1</sub> … <em>a<sub>m</sub></em> and <em>b</em><sub>1</sub> … <em>b<sub>n</sub></em> is the minimum cost <em>s</em> of a sequence of editing steps (insertions, deletions, changes) that convert one string into the other. A well-known tabulating method computes <em>s</em> as well as the corresponding editing sequence in time and in space <em>O</em>(<em>mn</em>) (in space <em>O</em>(min(<em>m, n</em>)) if the editing sequence is not required). Starting from this method, we develop an improved algorithm that works in time and in space <em>O</em>(<em>s</em> · min(<em>m, n</em>)). Another improvement with time <em>O</em>(<em>s</em> · min(<em>m, n</em>)) and space <em>O</em>(<em>s</em> · min(<em>s, m, n</em>)) is given for the special case where all editing steps have the same cost independently of the characters involved. If the editing sequence that gives cost <em>s</em> is not required, our algorithms can be implemented in space <em>O</em>(min(<em>s, m, n</em>)). Since <em>s</em> = <em>O</em>(max(<em>m, n</em>)), the new methods are always asymptotically as good as the original tabulating method. As a by-product, algorithms are obtained that, given a threshold value <em>t</em>, test in time <em>O</em>(<em>t</em> · min(<em>m, n</em>)) and in space <em>O</em>(min(<em>t, m, n</em>)) whether <em>s</em> ⩽ <em>t</em>. Finally, different generalized edit distances are analyzed and conditions are given under which our algorithms can be used in conjunction with extended edit operation sets, including, for example, transposition of adjacent characters.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"64 1","pages":"Pages 100-118"},"PeriodicalIF":0.0,"publicationDate":"1985-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80046-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80900995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
