Výsledky vyhledávání

Report

Coalgebraic Automata Theory: Basic Results

Autor: Kupke, C., Venema, Y.

Publikováno v: Logical Methods in Computer Science, Volume 4, Issue 4 (November 21, 2008) lmcs:1203

We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves weak pullbac

Externí odkaz: http://arxiv.org/abs/0811.1976

Zobrazit plný text záznamu

Preservation and Reflection of Bisimilarity via Invertible Steps

Autor: Turkenburg, R., Kupke, C., Rot, J., Schoen, E., Kupferman, O., Sobocinski, P.

Publikováno v: Kupferman, O.; Sobocinski, P. (ed.), Foundations of Software Science and Computation Structures: 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, 328-348. Cham : Springer Nature Switzerland
STARTPAGE=328;ENDPAGE=348;ISSN=0302-9743;TITLE=Kupferman, O.; Sobocinski, P. (ed.), Foundations of Software Science and Computation Structures: 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d3630a6b9750ff8802b214b60e10f052
https://hdl.handle.net/2066/293198

Zobrazit plný text záznamu

Equality-Friendly Well-Founded Semantics and Applications to Description Logics

Autor: Georg Gottlob, Hernich, A., Kupke, C., Lukasiewicz, T.

Publikováno v: Scopus-Elsevier

We tackle the problem of defining a well-founded semantics for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In particular, we provide a well-founded semantics (WFS) for the recent Datalog+/- fami

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2ab5abc01004336e56b599eb9860d1b
https://doi.org/10.1609/aaai.v26i1.8227

Zobrazit plný text záznamu

Expressive Logics for Coinductive Predicates

Autor: Kupke, C., Rot, J., Fernandez, M.

Publikováno v: 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Fernandez, M. (ed.), CSL 2020: 28th EACSL Annual Conference on Computer Science Logic, January 13-16, 2020, Barcelona, Spain, January 13-16, 2020, Barcelona, Spain, pp. 26:1-26:17
Logical Methods in Computer Science, 17, 1-30
Fernandez, M. (ed.), CSL 2020: 28th EACSL Annual Conference on Computer Science Logic, January 13-16, 2020, Barcelona, Spain, January 13-16, 2020, Barcelona, Spain, 26:1-26:17. Dagstuhl : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
STARTPAGE=26:1;ENDPAGE=26:17;ISSN=1868-8969;TITLE=Fernandez, M. (ed.), CSL 2020: 28th EACSL Annual Conference on Computer Science Logic, January 13-16, 2020, Barcelona, Spain, January 13-16, 2020, Barcelona, Spain
Logical Methods in Computer Science, 17, 4, pp. 1-30

The classical Hennessy-Milner theorem says that two states of an image-finite transition system are bisimilar if and only if they satisfy the same formulas in a certain modal logic. In this paper we study this type of result in a general context, mov

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8031d14ef3c3ab4ad92c7dd70bb921c2
https://lmcs.episciences.org/6593

Zobrazit plný text záznamu

Expressivity of Quantitative Modal Logics : Categorical Foundations via Codensity and Approximation

Autor: Komorida, Y., Katsumata, S., Kupke, C., Rot, J., Hasuo, Ichiro, Libkin, L.

Publikováno v: Libkin, L. (ed.), 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 29 June 2021-2 July 2021, Rome, Italy / Virtual, 1-14. ACM
STARTPAGE=1;ENDPAGE=14;TITLE=Libkin, L. (ed.), 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 29 June 2021-2 July 2021, Rome, Italy / Virtual

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2c528d060e5094d7ca9bece2605c2b5f
https://hdl.handle.net/2066/236562

Zobrazit plný text záznamu

Learning Weighted Automata over Principal Ideal Domains

Autor: Heerdt, Gerco van, Kupke, C., Rot, J., Silva, A., Goubault-Larrecq, J., König, B.

Publikováno v: Foundations of Software Science and Computation Structures
Goubault-Larrecq, J.; König, B. (ed.), Foundations of Software Science and Computation Structures: 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings, 602-621. Cham : Springer International Publishing
STARTPAGE=602;ENDPAGE=621;ISSN=0302-9743;TITLE=Goubault-Larrecq, J.; König, B. (ed.), Foundations of Software Science and Computation Structures: 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings
Goubault-Larrecq, J.; König, B. (ed.), Foundations of Software Science and Computation Structures: 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020. Proceedings, pp. 602-621

In this paper, we study active learning algorithms for weighted automata over a semiring. We show that a variant of Angluin’s seminal \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb}

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3559ddfe91b98d12ca6ab4337b00c3f0
http://arxiv.org/abs/1911.04404

Zobrazit plný text záznamu

Coalgebra Learning via Duality

Autor: Barlocco, S., Kupke, C., Rot, J., Bojańczyk, M.

Publikováno v: Bojańczyk, M. (ed.), Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, pp. 62-79
Bojańczyk, M. (ed.), Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings, 62-79. Cham : Springer International Publishing
STARTPAGE=62;ENDPAGE=79;ISSN=0302-9743;TITLE=Bojańczyk, M. (ed.), Foundations of Software Science and Computation Structures: 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6–11, 2019, Proceedings

Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as tests, based

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::91eba072821c19d42b112cf604129ae0
https://hdl.handle.net/2066/204564

Zobrazit plný text záznamu

Bisimulation for Neighbourhood Structures

Autor: Hansen, H.H., Kupke, C., Pacuit, E., Mossakowski, T., Montanari, U., Haveraaen, M.

Publikováno v: Algebra and coalgebra in computer science : 2nd iternational conference, CALCO 2007, Bergen, Norway, August 20-24, 2007. : proceedings, 279-293
STARTPAGE=279;ENDPAGE=293;TITLE=Algebra and coalgebra in computer science : 2nd iternational conference, CALCO 2007, Bergen, Norway, August 20-24, 2007. : proceedings
Algebra and Coalgebra in Computer Science ISBN: 9783540738572
CALCO
Algebra and Coalgebra in Computer Science: Second International Conference, CALCO 2007, Bergen, Norway, August 20-24, 2007 : proceedings, 279-293
STARTPAGE=279;ENDPAGE=293;TITLE=Algebra and Coalgebra in Computer Science

Neighbourhood structures are the standard semantic tool used to reason about non-normal modal logics. In coalgebraic terms, a neighbourhood frame is a coalgebra for the contravariant powerset functor composed with itself, denoted by 22. In our paper,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d2a10b45ef1d62694ab49423a0a794e8
https://hdl.handle.net/11245/1.279381

Zobrazit plný text záznamu

Duality and universal models for the meet-implication fragment of IPC

Autor: Bezhanishvili, N., Coumans, D., van Gool, S.J., de Jongh, D., Aher, M., Hole, D., Jeřábek, E., Kupke, C.

Publikováno v: Logic, Language, and Computation: 10th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2013, Gudauri, Georgia, September 23-27, 2013: revised selected papers, 97-116
STARTPAGE=97;ENDPAGE=116;TITLE=Logic, Language, and Computation
Logic, Language, and Computation ISBN: 9783662469057

In this paper we investigate the fragment of intuitionistic logic which only uses conjunction (meet) and implication, using finite duality for distributive lattices and universal models. We give a description of the finitely generated universal model

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::775a510602046e0d4abc09f506133a9e
https://dare.uva.nl/personal/pure/en/publications/duality-and-universal-models-for-the-meetimplication-fragment-of-ipc(fc5f33b4-d93f-4043-803e-c0026997ca3c).html

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání