• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Modules in Transition: Conservativity, Composition, and Colimits. (2008)

by O Kutz, T Mossakowski
Add To MetaCart

Tools

Sorted by:
Results 1 - 5 of 5

Borrowing Interpolation

by Răzvan Diaconescu , 2011
"... We present a generic method for establishing interpolation properties by ‘borrowing ’ across logical systems. The framework used is that of the so-caled ‘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
We present a generic method for establishing interpolation properties by ‘borrowing ’ across logical systems. The framework used is that of the so-caled ‘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.
(Show Context)

Citation Context

...ius case being that of definability. Interpolation has numerous applications in computing science especially in formal specification theory [5, 8, 27, 29, 30, 69]. but also in data bases (ontologies) =-=[42]-=-, automated reasoning [54, 55], type checking [41], model checking [47], and structured theorem proving [1, 46]. Consequently it has also received special attention within institution-independent mode...

unknown title

by unknown authors
"... Abstract. This chapter surveys approaches to handling categorical systems of extensive size, spanning from semi-formal systems in terminology and classification sciences to formal logical approaches. In particular, we briefly review the transition from terminologies to ontologies that are formalize ..."
Abstract - Add to MetaCart
Abstract. This chapter surveys approaches to handling categorical systems of extensive size, spanning from semi-formal systems in terminology and classification sciences to formal logical approaches. In particular, we briefly review the transition from terminologies to ontologies that are formalized in logics, exemplified in the medical domain. The main part presents the state of the art of the modularization of logical theories with an ontology-related background. Since the field is still very young and active, an evaluation of these approaches results in a heterogeneous landscape of proposals and leaves perspectives for future research.

Interpolation for Predefined Types

by Razvan Diaconescu - UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE , 2008
"... ... model theoretic framework of the theory of institutions. For this semantics we develop a generic interpolation result which can be easily applied to various concrete situations from the theory and practice of specification and programming. Our study of interpolation is motivated by a number of i ..."
Abstract - Add to MetaCart
... model theoretic framework of the theory of institutions. For this semantics we develop a generic interpolation result which can be easily applied to various concrete situations from the theory and practice of specification and programming. Our study of interpolation is motivated by a number of important applications to computing science especially in the area of structured specifications.
(Show Context)

Citation Context

...especially in formal specification theory (Bergstra et al. 1990; Diaconescu et al. 1993; Dimitrakos 1998; Bicarregui et al. 2001; Veloso 1996; Borzyszkowski 2000) but also in data bases (ontologies) (=-=Kutz and Mossakowski 2007-=-), automated reasoning (Nelson and Oppen 1979; Oppen 1980), type checking (Jhala et al. 2007), model checking (Mcmillan 2005), and structured theorem proving (Amir and MCIlraith 2000; McIlarith and Am...

Towards a Functional Approach to Modular Ontologies using Institutions

by Daniel Pokrywczyński , Grant Malcolm
"... We propose a functional view of ontologies that emphasises their role in determining answers to queries, irrespective of the formalism in which they are written. A notion of framework is introduced that captures the situation of a global language into which both an ontology language and a query lang ..."
Abstract - Add to MetaCart
We propose a functional view of ontologies that emphasises their role in determining answers to queries, irrespective of the formalism in which they are written. A notion of framework is introduced that captures the situation of a global language into which both an ontology language and a query language can be translated, in an abstract way. We then generalise existing notions of robustness from the literature, and relate these to interpolation properties that support modularisation of ontologies.

Towards a Functional Approach to Modular Ontologies using Institutions

by Daniel Pokrywczyński A, Grant Malcolm A
"... Abstract. We propose a functional view of ontologies that emphasises their role in determining answers to queries, irrespective of the formalism in which they are written. A notion of framework is introduced that captures the situation of a global language into which both an ontology language and a ..."
Abstract - Add to MetaCart
Abstract. We propose a functional view of ontologies that emphasises their role in determining answers to queries, irrespective of the formalism in which they are written. A notion of framework is introduced that captures the situation of a global language into which both an ontology language and a query language can be translated, in an abstract way. We then generalise existing notions of robustness from the literature, and relate these to interpolation properties that support modularisation of ontologies.
(Show Context)

Citation Context

... [20]. An advantage of this is that institutions also allow a systematic treatment of translation between languages, and recent research has applied this to problems such as alignment and integration =-=[6,18,19,24,27]-=-.Within a framework, it is possible to capture a general notion of consequence, whereby an ontology answers a query, when both are translated into the global language. This in turn gives rise to a lan...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University