{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:35:20Z","timestamp":1768257320490,"version":"3.49.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7960,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1016\/0304-3975(90)90105-q","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"3-32","source":"Crossref","is-referenced-by-count":20,"title":["Order-sorted completion: the many-sorted way"],"prefix":"10.1016","volume":"89","author":[{"given":"Harald","family":"Ganzinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90105-Q_BIB1","series-title":"PhD thesis","article-title":"Proof methods for equational theories","author":"Bachmair","year":"1987"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB2","series-title":"Proc. 1st Symp. on Logic in Computer Science","first-page":"346","article-title":"Orderings for equational proofs","author":"Bachmair","year":"1986"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB3","series-title":"PhD thesis","article-title":"Knuth-Bendix completion of Horn clause programs for restricted linear resolution and paramodulation","author":"Bertling","year":"1990"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB4","series-title":"Proc. 3rd Internat. Conf. on Rewriting Techniques and Applications","first-page":"45","article-title":"Completion-time optimization of rewrite-time goal solving","volume":"355","author":"Bertling","year":"1989"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB5","series-title":"Proc. 2nd Internat. Workshop on Conditional and Typed Rewriting","article-title":"Completion of first-order clauses with equality by strict superposition","author":"Bachmair","year":"1991"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB6","series-title":"Proc. 10th Internat. Conf. on Automated Deduction","first-page":"427","article-title":"On restrictions of ordered paramodulation with simplification","volume":"449","author":"Bachmair","year":"1990"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB7","series-title":"Proc. 1st Internat. Workshop on Conditional Term Rewriting","first-page":"31","article-title":"Confluence of conditional rewrite systems","volume":"308","author":"Dershowitz","year":"1988"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB8_1","series-title":"Proc. 1st Internat. Workshop on Conditional Term Rewriting","first-page":"62","article-title":"A completion procedure for conditional equations","volume":"308","author":"Ganzinger","year":"1988"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB8_2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/S0747-7171(08)80132-0","volume":"11","author":"Ganzinger","year":"1991","journal-title":"J. Symb. Comput."},{"key":"10.1016\/0304-3975(90)90105-Q_BIB9","series-title":"Recent Trends in Data Type Specifications","first-page":"73","article-title":"Completion with history-dependent complexities for generated equations","volume":"332","author":"Ganzinger","year":"1988"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB10","series-title":"Proc. 12th Internat. Conf. on Automata, Languages and Programming, Nafplion","first-page":"221","article-title":"Operational semantics of order-sorted algebra","volume":"194","author":"Goguen","year":"1985"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB11","series-title":"Proc. CAAP'88","first-page":"165","article-title":"Equational completion in order-sorted algebras","volume":"299","author":"Gnaedig","year":"1988"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB12","series-title":"Order-sorted algebra I: partial and overloaded operations, errors and inheritance","author":"Goguen","year":"1987"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB13","series-title":"Report No. 14","article-title":"Order-sorted algebra. Semantics and theory of computation","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB14","series-title":"Dissertation","article-title":"Partiell geordnete Sortenmengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen","author":"Gogolla","year":"1986"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB15","series-title":"Proc. 12th Internat. Conf. on Software Engineering","first-page":"150","article-title":"System support for modular order-sorted Horn clause specifications","author":"Ganzinger","year":"1990"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB16","series-title":"Proc. 3rd TC2 Working Conf. on the Formal Description of Prog. Concepts","article-title":"Reductive conditional term rewriting systems","author":"Jouannaud","year":"1986"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB17","series-title":"Recent Trends in Data Type Specification","article-title":"Fair conditional term rewriting systems: unification, termination and confluence","author":"Kaplan","year":"1985"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB18","series-title":"Proc. 2nd Internat. Conf. on Rewriting Techniques and Applications","first-page":"25","article-title":"A compiler for conditional term rewriting systems","volume":"256","author":"Kaplan","year":"1987"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB19","series-title":"MCC Workshop on Resolution of Equations in Algebraic Structures","article-title":"Completion algorithms for conditional rewriting systems","author":"Kaplan","year":"1987"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB20","series-title":"Proc. 15th Internat. Coll. on Automata, Languages and Programming","article-title":"Operational semantics of OBJ3","author":"Kirchner","year":"1988"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB21","series-title":"Proc. 1st Workshop on Conditional Rewriting Systems","first-page":"144","article-title":"On word problems in Horn logic","volume":"308","author":"Kounalis","year":"1988"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01396685","article-title":"Untersuchungen zur mehrsortigen Quantorenlogik","volume":"145","author":"Oberschelp","year":"1962","journal-title":"Math. Ann."},{"key":"10.1016\/0304-3975(90)90105-Q_BIB23","series-title":"Recent Trends in Data Type Specifications","first-page":"208","article-title":"Partial algebras, subsorting, and dependent types","volume":"332","author":"Poigne","year":"1988"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB24","series-title":"Report 87-R-128","article-title":"Theorem-proving with resolution and superposition: an extension of Knuth and Bendix procedure as a complete set of inference rules","author":"Rusinowitch","year":"1987"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB25","series-title":"Proc. Coll. on Resolution of Equations in Algebraic Structures","article-title":"Order sorted equational computation","author":"Smolka","year":"1987"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB26","series-title":"Forschungsbericht 297","article-title":"Semantics of ordersorted-specifications","author":"Waldmann","year":"1989"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB27","series-title":"Proc. Coll. on Algebra, Combinatorics and Logic in Computer Science","article-title":"A criterion for eliminating unnecessary reductions in the Knuth-Bendix algorithm","author":"Winkler","year":"1983"},{"key":"10.1016\/0304-3975(90)90105-Q_BIB28","series-title":"Proc. 1st Internat. Conf. on Rewriting Techniques and Applications","first-page":"46","article-title":"Contextual rewriting","volume":"202","author":"Zhang","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090105Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090105Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:57:01Z","timestamp":1555077421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090105Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["030439759090105Q"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90105-q","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}