845 search results - page 118 / 169 » Connecting Many-Sorted Theories |
216
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
214
click to vote
CSL
2007
Springer
16 years 13 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
180
click to vote
ICCS
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
170
click to vote
SEFM
2006
IEEE
16 years 8 days ago
2006
IEEE
We deļ¬ne a model of labelled product systems of automata and explore its connections with process calculi and trace languages. Bisimilarity of labelled product systems is deļ¬n...
199
click to vote
AIMSA
2010
Springer
15 years 7 months ago
2010
Springer
We propose ontological blending as a new method for `creatively' combining ontologies. In contrast to other combination techniques that aim at integrating or assimilating cate...