Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Solin, Kim"'
Autor:
Solin, Kim
Publikováno v:
Studia Logica: An International Journal for Symbolic Logic, 2012 Jun 01. 100(3), 607-630.
Externí odkaz:
http://dx.doi.org/10.1007/s11225-012-9416-9
Autor:
Meinicke, Larissa, Solin, Kim
Publikováno v:
In Electronic Notes in Theoretical Computer Science 7 March 2008 201:177-195
Autor:
Lycke, Liselott, Georgsson, Fredrik, Schedin, Staffan, Degerman, Lars, Solin, Kim, Victor, Björn
Svenska lärosäten har utvecklat egna kvalitetssystem som ska granskas och godkännas av universitetskans-lersämbetet (UKÄ). Typiskt bygger lärosätenas kvalitetssäkrings-system på cykliska mäta-värdera-åtgärda aktiviteter. I flera av dessa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d8dbeec025432bf39835313acc1a3276
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-168423
http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-168423
Autor:
Solin, Kim
This paper proposes a semiring formulation for reasoning about an agent's changing beliefs: a dynamic epistemic semiring (DES). A DES is a modal semiring extended with a revision operator. The revision operator is given a relational interpretation an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::6df369e508b0cfc612270102ac2a0561
https://opus.bibliothek.uni-augsburg.de/opus4/files/285/TB_2006_17.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/285/TB_2006_17.pdf
Autor:
Solin, Kim
A dually nondeterministic refinement algebra with a negation operator is proposed. The algebra facilitates reasoning about total-correctness preserving program transformations and nondeterministic programs. The negation operator is used to express en
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::b8d5d66fb3fe993837a14415a30bb507
https://opus.bibliothek.uni-augsburg.de/opus4/files/218/TB_2006_05.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/218/TB_2006_05.pdf
Weak omega algebra and demonic refinement algebra are two ways of describing systems with finite and infinite iteration. We show that these independently introduced kinds of algebras can actually be defined in terms of each other. By defining modal o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3341::73f0165e9f74f40a2eb07281ebd1d2a5
https://opus.bibliothek.uni-augsburg.de/opus4/files/35929/35929.pdf
https://opus.bibliothek.uni-augsburg.de/opus4/files/35929/35929.pdf
Autor:
Solin, Kim
Publikováno v:
Computer Information Systems & Industrial Management: 14th IFIP TC 8 International Conference, CISIM 2015 Warsaw, Poland, September 24-26, 2015. Proceedings; 2015, p209-224, 16p