41,675 Hits in 10.6 sec

A Modular Consistency Proof for DOLCE

Oliver Kutz, Till Mossakowski
We propose a novel technique for proving the consistency of large, complex and heterogeneous theories for which 'standard' automated reasoning methods are considered insufficient.  ...  The proof proceeds by (i) hand-crafting a so-called architectural specification of DOLCE which reflects the way models of the theory can be built, (ii) an automated verification of the amalgamability conditions  ...  We thank John Bateman, Joana Hois, Claudio Masolo, and Stefano Borgo for discussing DOLCE, Christian Maeder for implementation work around the Heterogeneous Tool Set, and especially Dominik Lücke for earlier  ... 
doi:10.1609/aaai.v25i1.7860 fatcat:qxxlqaah2bah7cz37fljdadmri

Page 9267 of Mathematical Reviews Vol. , Issue 2002M [page]

2002 Mathematical Reviews  
Sci. 192 (1998), no. 1, 107-161; MR 99j:68127], the con- cept of ‘free amalgamation’ was introduced as a general methodol- ogy for interweaving solution structures for symbolic constraints, and it was  ...  Here we discuss a second general way for combining solution domains, called rational amalgamation.  ... 

Functorial theory of a parameterized specifications in a general specification framework

Hartmut Ehrig, Martin Große-Rhode
1994 Theoretical Computer Science  
Ehrig, H and M. GroBe-Rhode, Functorial theory of parameterized specifications in a general specification framework, Theoretical Computer Science 135 (1994) 22 l-266.  ...  In [l l] the main horizontal structuring concepts and results of [22] will be generalized to our new framework.  ...  Suitable in this context means on one hand a small number of categorical concepts which allow to develop a general theory such that we obtain all the essential concepts and results in [21] and for equational  ... 
doi:10.1016/0304-3975(94)90110-4 fatcat:enbtbyncqnatdl3rr5ehgnisvq

Generalize and Blend: Concept Blending Based on Generalization, Analogy, and Amalgams

Tarek Richard Besold, Enric Plaza
2015 International Conference on Computational Creativity  
Concept blending, a cognitive process which allows for the combination of certain elements (and their relations) from originally distinct conceptual spaces into a new unified space combining these previously  ...  In this paper, we provide an intermediate report on work towards the development of a computational-level and algorithmic-level account of concept blending, presenting the theoretical background together  ...  Acknowledgements The authors acknowledge the financial support of the Future and Emerging Technologies within the 7th Framework Programme for Research of the European Commission, under FET-Open grant 611553  ... 
dblp:conf/icccrea/BesoldP15 fatcat:slnrpznlxjbmvpj7zhl7xwcai4

Towards a computational- and algorithmic-level account of concept blending using analogies and amalgams

Tarek R. Besold, Kai-Uwe Kühnberger, Enric Plaza
2017 Connection science  
Concept blending-a cognitive process which allows for the combination of certain elements (and their relations) from originally distinct conceptual spaces into a new unified space combining these previously  ...  ., Kuhnberger, K-U. and Plaza, E. (2017). Towards a computationaland algorithmic-level account of concept blending using analogies and amalgams.  ...  Acknowledgements The authors acknowledge the financial support of the Future and Emerging Technologies programme within the Seventh Framework Programme for Research of the European Commission, under FET-Open  ... 
doi:10.1080/09540091.2017.1326463 fatcat:fl5xrpwksbfmln5vn6rid6z25i

Page 8775 of Mathematical Reviews Vol. , Issue 99m [page]

1999 Mathematical Reviews  
Concepts such as existence of free extensions and possibil- ity of amalgamation of theories can be defined in terms of category-theoretic properties of theory morphisms.  ...  For instance, if y:(Z, E) — (2’, E’) is a theory morphism then the existence of free extensions along y amounts to saying that Mod(y) has a left adjoint.  ... 

Upward closure and amalgamation in the generic multiverse of a countable model of set theory [article]

Joel David Hamkins
2015 arXiv   pre-print
I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory.  ...  Every chain W⊆ W[c_0]⊆ W[c_1]⊆... of extensions adding Cohen reals is bounded above by W[d] for some W-generic Cohen real d.  ...  If W is any countable transitive model of set theory, then there are W -generic Cohen reals c and d, for which the corresponding forcing extensions W [c] and W [d] have no common extension to a model of  ... 
arXiv:1511.01074v1 fatcat:dh4wa3gm3rfqja5csxwyyvqsw4

Interpolation for predefined types

2011 Mathematical Structures in Computer Science  
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.  ...  We give a logic-independent semantics for predefined (data) types within the categorical abstract model theoretic framework of the theory of institutions.  ...  The proof of our generic interpolation theorem for predefined types requires a number of new general institution theoretic results together with a model amalgamation property for the institutions of predefined  ... 
doi:10.1017/s0960129511000430 fatcat:ii2hhaoujza6jigrnib6wbqea4

Blending under deconstruction

Roberto Confalonieri, Oliver Kutz
2019 Annals of Mathematics and Artificial Intelligence  
to invent new concepts.  ...  These, and many similar questions, have to do with the imaginative mind of humans, their ability to invent new concepts, and more broadly, the human potential for creativity.  ...  The paper builds on a body of work originating from the EU FP7 project COINVENT and later refinements.  ... 
doi:10.1007/s10472-019-09654-6 fatcat:43s7pcygd5d3dit7huznp4p7mu

Interpolation in practical formal development

J Bicarregui
2001 Logic Journal of the IGPL  
In recognition of the fact that common logical formalisms often lack uniform interpolants, we advocate the need for developing general methods to (re)engineer a specification logic so that (at least) some  ...  Interpolation (together with completeness and decidability) has become one of the standard properties that logicians investigate when designing a logic.  ...  The creation of new theories, on the other hand, (as well as the extension, amalgamation, update and revision of existing theories) is an everyday activity for a computer scientist.  ... 
doi:10.1093/jigpal/9.2.231 fatcat:v4tf6vnt6nb47m7qaefu43siny

An axiomatic approach to structuring specifications

Răzvan Diaconescu
2012 Theoretical Computer Science  
Within this framework we develop concepts and results about 'abstract structured specifications' such as co-limits, model amalgamation, compactness, interpolation, sound and complete proof theory, and  ...  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  ...  Acknowledgment The author thanks the first (anonymous) referee for studying carefully this work and coming up with a series of comments and suggestions that have led to several corrections and an improvement  ... 
doi:10.1016/j.tcs.2012.03.001 fatcat:mxh7nllcbjhvbexessklwfspzy

Parallel Independence of Amalgamated Graph Transformations Applied to Model Transformation [chapter]

Enrico Biermann, Hartmut Ehrig, Claudia Ermel, Ulrike Golas, Gabriele Taentzer
2010 Lecture Notes in Computer Science  
Rule applications of certain regularity are described by a rule scheme which contains multirules modeling elementary actions and a common kernel rule for their synchronization (amalgamation).  ...  The theory of algebraic graph transformation has proven to be a suitable underlying formal framework to reason about the behavior of model transformations.  ...  Using this extension, the transformation of models with variably many multi-object structures can be handled in a general way.  ... 
doi:10.1007/978-3-642-17322-6_7 fatcat:prtfa5obynbzlc4llfyo53hrmy

Selection of Privacy Enhanced Communication: an Extension of the UTAUT2 Theory

Tyler M. Pieron, James N. Smith
2017 Americas Conference on Information Systems  
This paper proposes a theoretical extension of the unified theory of acceptance and use of technology 2 (UTAUT2) to incorporate privacy as an individual factor influencing consumer acceptance and use of  ...  The proposed UTAUT2+P theory incorporates the perception of privacy as an individual difference, along with age, gender and experience, which is hypothesized to moderate the effects of extant UTAUT2 constructs  ...  Literature Review Within the study of information systems, the basis for why and how users accept technology is an extensively studied concept, with the evolution of various models and theories being developed  ... 
dblp:conf/amcis/PieronS17 fatcat:l6vs6d3acrfbdamionzywz5oqm

Unifying initial and loose semantics of parameterized specifications in an arbitrary institution [chapter]

Hubert Baumeister
1991 Lecture Notes in Computer Science  
To be independent of a specific logic this theory is developed in the context of an arbitrary institution.  ...  In this paper we are going to present a theory of parameterized abstract datatypes as the model-theoretic level of parameterized specifications.  ...  This is necessary for the existence of unique amalgamated sums and therefore for an amalgamation and extension lemma.  ... 
doi:10.1007/3-540-53982-4_7 fatcat:2mg72dfdxzambouuhmhanbszna

Book Review: The theory of groups

Wilhelm Magnus
1960 Bulletin of the American Mathematical Society  
Chapter 15 on group extensions and cohomology of groups introduces the very first beginnings of cohomology theory but it gives the important application to extension theory.  ...  Chapters 14 and 16 deal with monomial representations, applications of the concept of transfer and with the theory of group representations in a field the characteristic of which is coprime with the order  ... 
doi:10.1090/s0002-9904-1960-10406-5 fatcat:ue7s4uvdljhgdfpnvrcatlt7iu
« Previous Showing results 1 — 15 out of 41,675 results