Results 1  10
of
40
Institution Morphisms
, 2001
"... Institutions formalize the intuitive notion of logical system, including syntax, semantics, and the relation of satisfaction between them. Our exposition emphasizes the natural way that institutions can support deduction on sentences, and inclusions of signatures, theories, etc.; it also introduces ..."
Abstract

Cited by 62 (16 self)
 Add to MetaCart
Institutions formalize the intuitive notion of logical system, including syntax, semantics, and the relation of satisfaction between them. Our exposition emphasizes the natural way that institutions can support deduction on sentences, and inclusions of signatures, theories, etc.; it also introduces terminology to clearly distinguish several levels of generality of the institution concept. A surprising number of different notions of morphism have been suggested for forming categories with institutions as objects, and an amazing variety of names have been proposed for them. One goal of this paper is to suggest a terminology that is uniform and informative to replace the current chaotic nomenclature; another goal is to investigate the properties and interrelations of these notions in a systematic way. Following brief expositions of indexed categories, diagram categories, twisted relations, and Kan extensions, we demonstrate and then exploit the duality between institution morphisms in the original sense of Goguen and Burstall, and the "plain maps" of Meseguer, obtaining simple uniform proofs of completeness and cocompleteness for both resulting categories. Because of this duality, we prefer the name "comorphism" over "plain map;" moreover, we argue that morphisms are more natural than comorphisms in many cases. We also consider "theoroidal" morphisms and comorphisms, which generalize signatures to theories, based on a theoroidal institution construction, finding that the "maps" of Meseguer are theoroidal comorphisms, while theoroidal morphisms are a new concept. We introduce "forward" and "seminatural" morphisms, and develop some of their properties. Appendices discuss institutions for partial algebra, a variant of order sorted algebra, two versions of hidden algebra, and...
Logical Foundations of CafeOBJ
 Theoretical Computer Science
"... This paper surveys the logical and mathematical foundations of CafeOBJ, which is a successor of the famous algebraic specification language OBJ but adding several new primitive paradigms such as behavioural concurrent specification and rewriting logic. We first give a concise overview of CafeOBJ. T ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
This paper surveys the logical and mathematical foundations of CafeOBJ, which is a successor of the famous algebraic specification language OBJ but adding several new primitive paradigms such as behavioural concurrent specification and rewriting logic. We first give a concise overview of CafeOBJ. Then we focus on the actual logical foundations of the language at two different levels: basic specification and structured specification, including also the definition of the CafeOBJ institution. We survey some novel or more classical theoretical concepts supporting the logical foundations of CafeOBJ together with pointing to the main results but without giving proofs and without discussing all mathematical details. Novel theoretical concepts include the coherent hidden algebra formalism and its combination with rewriting logic, and Grothendieck (or fibred) institutions. However for proofs and for some of the mathematical details not discussed here we give pointers to relevant publications. ...
The OWL in the CASL Designing Ontologies Across Logics
"... Abstract. In this paper, we show how the web ontology language OWL can be accommodated within the larger framework of the heterogeneous common algebraic specification language HETCASL. Through this change in perspective, OWL can benefit from various useful HETCASL features concerning structuring, mo ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper, we show how the web ontology language OWL can be accommodated within the larger framework of the heterogeneous common algebraic specification language HETCASL. Through this change in perspective, OWL can benefit from various useful HETCASL features concerning structuring, modularity, and heterogeneity. This tackles a major problem area in ontology engineering: reuse of ontologies and recombination of ontological modules. We discuss in particular: (1) the extension of the Manchester syntax for OWL with structuring mechanisms of CASL, allowing for explicit modularisation; (2) automatic translations between ontology languages to support ontology design across different ontology languages (heterogeneity); (3) heterogeneous ontology refinements, and corresponding automated reasoning support for different logics. 1
Heterogeneous Logical Environments for distributed specifications
"... We use the theory of institutions to capture the concept of a heterogeneous logical environment as a number of institutions linked by institution morphisms and comorphisms. We discuss heterogeneous specifications built in such environments, with interinstitutional specification morphisms based on ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
We use the theory of institutions to capture the concept of a heterogeneous logical environment as a number of institutions linked by institution morphisms and comorphisms. We discuss heterogeneous specifications built in such environments, with interinstitutional specification morphisms based on both institution morphisms and comorphisms. We distinguish three kinds of heterogeneity: (1) specifications in logical environments with universal logic (2) heterogeneous specifications focused at a particular logic, and (3) heterogeneous specifications distributed over a number of logics.
Completeness Results for Fibred Parchments Beyond the Propositional Base
 Recent Trends in Algebraic Development Techniques  Selected Papers, volume 2755 of Lecture Notes in Computer Science
, 2003
"... In [6] it was shown that fibring could be used to combine institutions presented as cparchments, and several completeness preservation results were established. However, their scope of applicability was limited to propositionalbased logics. Herein, we extend these results to a broader class of ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
(Show Context)
In [6] it was shown that fibring could be used to combine institutions presented as cparchments, and several completeness preservation results were established. However, their scope of applicability was limited to propositionalbased logics. Herein, we extend these results to a broader class of logics, possibly including variables, terms and quantifiers.
Modules in transition. Conservativity, Composition, and Colimits
 In Proceedings, Second International Workshop on Modular Ontologies
, 2007
"... Abstract. Several modularity concepts for ontologies have been studied in the literature. Can they be brought to a common basis? We propose to use the language of category theory, in particular diagrams and their colimits, for answering this question. We outline a general approach for representing c ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Abstract. Several modularity concepts for ontologies have been studied in the literature. Can they be brought to a common basis? We propose to use the language of category theory, in particular diagrams and their colimits, for answering this question. We outline a general approach for representing combinations of logical theories, or ontologies, through interfaces of various kinds, based on diagrams and the theory of institutions. In particular, we consider theory interpretations, language extensions, symbol identification, and conservative extensions. We study the problem of inheriting conservativity between subtheories in a diagram to its colimit ontology. Finally, we apply this to the problem of conservativity when composing DDLs or Econnections. 1
Semantic Web Languages  Towards an Institutional Perspective
, 2006
"... The Semantic Web (SW) is viewed as the next generation of the Web that enables intelligent software agents to process and aggregate data autonomously. Ontology languages provide basic vocabularies to semantically markup data on the SW. We have witnessed an increase of numbers of SW languages in the ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The Semantic Web (SW) is viewed as the next generation of the Web that enables intelligent software agents to process and aggregate data autonomously. Ontology languages provide basic vocabularies to semantically markup data on the SW. We have witnessed an increase of numbers of SW languages in the last years. These languages, such as RDF, RDF Schema (RDFS), the OWL suite of languages, the OWL − suite, SWRL, are based on different semantics, such as the RDFSbased, description logicbased, Datalogbased semantics. The relationship among the various semantics poses a challenge for the SW community for making the languages interoperable. Institutions provide a means of reasoning about software specifications regardless of the logical system. This makes it an ideal candidate to represent and reason about the various languages in the Semantic Web. In this paper, we construct institutions for the SW languages and use institution morphisms to relate them. We show that RDF framework together with the RDF serializations of SW languages form an indexed institution. This allows the use of Grothendieck institutions to combine Web ontologies described in various languages.
An Axiomatic Approach to Structuring Specifications
"... In this paper we develop an axiomatic approach to structured specifications in which both the underlying logical system and corresponding institution of the structured specifications are treated as abstract institutions, which means two levels of institution independence. This abstract axiomatic app ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
In this paper we develop an axiomatic approach to structured specifications in which both the underlying logical system and corresponding institution of the structured specifications are treated as abstract institutions, which means two levels of institution independence. This abstract axiomatic approach provides a uniform framework for the study of structured specifications independently from any actual choice of specification building operators, and moreover it unifies the theory and the model oriented approaches. Within this framework we develop concepts and results about ‘abstract structured specifications ’ such as colimits, model amalgamation, compactness, interpolation, sound and complete proof theory, and pushoutstyle parameterization with sharing, all of them in a top down manner dictated by the upper level of institution independence. 1.
Borrowing Interpolation
, 2011
"... We present a generic method for establishing interpolation properties by ‘borrowing ’ across logical systems. The framework used is that of the socaled ‘institution theory’ which is a categorical abstract model theory providing a formal definition for the informal concept of ‘logical system’ and a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
We present a generic method for establishing interpolation properties by ‘borrowing ’ across logical systems. The framework used is that of the socaled ‘institution theory’ which is a categorical abstract model theory providing a formal definition for the informal concept of ‘logical system’ and a mathematical concept of ‘homomorphism’ between logical systems. We develop three different styles or patterns to apply the proposed borrowing interpolation method. These three ways are illustrated by the development of a series of concrete interpolation results for logical systems that are used in mathematical logic or in computing science, most of these interpolation properties apparently being new results. These logical systems include fragments of (classical many sorted) first order logic with equality, preordered algebra and its Horn fragment, partial algebra, higher order logic. Applications are also expected for many other logical systems, including membership algebra, various types of order sorted algebra, the logic of predefined types, etc., and various combinations of the logical systems discussed here.