{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:45:58Z","timestamp":1747579558139},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T00:00:00Z","timestamp":1236124800000},"content-version":"unspecified","delay-in-days":5025,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[1995,6]]},"abstract":"<jats:p>In this paper, we investigate several logical frameworks whose expressiveness lies between Conditional Equational Logic and Horn Clause Logic. The main result deals with the<jats:italic>PART<\/jats:italic>-construction, which interprets total based algebras as partial algebras. This construction can be viewed as a simulation of Horn Clause Theories by means of Conditional Equational Theories. Other constructions in other frameworks are extendable to simulations in a similar way. The notion of categorical retractive simulation captures some essential properties of these, which allows us to measure the equivalence and difference between institutions.<\/jats:p>","DOI":"10.1017\/s0960129500000712","type":"journal-article","created":{"date-parts":[[2009,3,4]],"date-time":"2009-03-04T09:00:54Z","timestamp":1236157254000},"page":"189-215","source":"Crossref","is-referenced-by-count":11,"title":["Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras"],"prefix":"10.1017","volume":"5","author":[{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"first","affiliation":[]},{"given":"Till","family":"Mossakowski","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2009,3,4]]},"reference":[{"key":"S0960129500000712_ref001","volume-title":"Abstract and Concrete Categories","author":"Ad\u00e1mek","year":"1990"},{"key":"S0960129500000712_ref018","unstructured":"Gogolla M. (1986) \u00dcber partiell geordnete Sortenmengen und deren Anwendung zur Fehlerbehandlung in abstrakten Datentypen, PhD thesis, Braunschweig."},{"key":"S0960129500000712_ref002","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600579"},{"key":"S0960129500000712_ref004","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56393-8_5"},{"key":"S0960129500000712_ref013","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69962-7"},{"key":"S0960129500000712_ref030","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90094-5"},{"key":"S0960129500000712_ref020","first-page":"275","volume-title":"Logic Colloquium","author":"Meseguer","year":"1989"},{"key":"S0960129500000712_ref026","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-73824-1"},{"key":"S0960129500000712_ref010","volume-title":"A model theoretic approach to partial algebras","author":"Burmeister","year":"1986"},{"key":"S0960129500000712_ref015","unstructured":"Goguen J. A. (1978) Order sorted algebras: Exceptions, error sorts, coercion and overloaded operators. Semantics and theory of computation report no. 14, University of California, Los Angeles."},{"key":"S0960129500000712_ref003","first-page":"313","article-title":"Consistency of equational enrichments","volume":"624","author":"Antimirov","year":"1992","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"S0960129500000712_ref019","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18088-5_45"},{"key":"S0960129500000712_ref005","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56379-2_37"},{"key":"S0960129500000712_ref031","unstructured":"Wolter U. (1994) Institutional Frames. Technical report, Technical University of Berlin."},{"key":"S0960129500000712_ref027","doi-asserted-by":"crossref","DOI":"10.1515\/9783112573426","volume-title":"Initial Computability, Algebraic Specifications and Partial Algebras","author":"Reichel","year":"1987"},{"key":"S0960129500000712_ref007","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-53982-4_7"},{"key":"S0960129500000712_ref008","first-page":"1045","volume-title":"Proceedings of the 5th International Joint Conference on Artificial Intelligence","author":"Burstall","year":"1977"},{"key":"S0960129500000712_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/BF02483730"},{"key":"S0960129500000712_ref011","doi-asserted-by":"publisher","DOI":"10.1007\/BF00625280"},{"key":"S0960129500000712_ref012","unstructured":"Cerioli M. (1993) Relationships between Logical Formalisms, PhD thesis, TD\u20134\/93, Universit\u00e0 di Pisa-Genova-Udine."},{"key":"S0960129500000712_ref014","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61284-8"},{"key":"S0960129500000712_ref016","doi-asserted-by":"publisher","DOI":"10.1145\/147508.147524"},{"key":"S0960129500000712_ref021","first-page":"304","article-title":"Unified algebras and institutions","author":"Mosses","year":"1989","journal-title":"Proceedings of the 4th Annual IEEE Symposium on Logic in Computer Science"},{"key":"S0960129500000712_ref022","first-page":"139","volume-title":"Proceedings of the Third International Conference on Algebraic Methodology and Software Technology, 1993","author":"Mossakowski","year":"1993"},{"key":"S0960129500000712_ref024","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90118-2"},{"key":"S0960129500000712_ref023","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014440"},{"key":"S0960129500000712_ref006","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/092\/1003191"},{"key":"S0960129500000712_ref025","first-page":"85","volume-title":"The Unified Computation Laboratory","author":"Manca","year":"1991"},{"key":"S0960129500000712_ref028","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56379-2_47"},{"key":"S0960129500000712_ref029","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90008-9"},{"key":"S0960129500000712_ref017","first-page":"295","volume-title":"Logic Programming. Functions, Relations and Equations","author":"Goguen","year":"1986"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129500000712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T07:03:34Z","timestamp":1684911814000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129500000712\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["S0960129500000712"],"URL":"https:\/\/doi.org\/10.1017\/s0960129500000712","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}