Coalgebra learning via duality

Simone Barlocco; Clemens Kupke; Jurriaan Rot

doi:10.1007/978-3-030-17127-8_4

Coalgebra learning via duality

Simone Barlocco, Clemens Kupke, Jurriaan Rot

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

5 Citations (Scopus)

11 Downloads (Pure)

Abstract

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 on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using Hennessy-Milner logic. Our main contribution is an abstract learning algorithm, together with a proof of correctness and termination.

Original language	English
Title of host publication	International Conference on Foundations of Software Science and Computation Structures [FoSSaCS 2019]
Editors	Mikołaj Bojańczyk, Alex Simpson
Place of Publication	Cham, Switzerland
Publisher	Springer
Pages	62-79
Number of pages	18
ISBN (Print)	9783030171261, 9783030171278
DOIs	https://doi.org/10.1007/978-3-030-17127-8_4
Publication status	Published - 5 Apr 2019

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11425
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Keywords

automata learning
coalgebras
Hennessy-Milner logic
abstract learning algorithm

Access to Document

10.1007/978-3-030-17127-8_4Licence: CC BY 4.0

Barlocco-etal-FOSSACS2019-Coalgebra-learning-via-dualityFinal published version, 392 KBLicence: CC BY 4.0

https://link.springer.com/book/10.1007/978-3-030-17127-8

Fingerprint Dive into the research topics of 'Coalgebra learning via duality'. Together they form a unique fingerprint.

Clemens Kupke
- clemens.kupke@strath.ac.uk
- Computer And Information Sciences - Senior Lecturer
- SICSA
Person: Academic

1 Finished

Coalgebraic Foundations of Semi-Structured Data (EPSRC First Grant)
Kupke, C.
EPSRC (Engineering and Physical Sciences Research Council)
1/02/16 → 31/01/18
Project: Research

Cite this

Barlocco, S., Kupke, C., & Rot, J. (2019). Coalgebra learning via duality. In M. Bojańczyk, & A. Simpson (Eds.), International Conference on Foundations of Software Science and Computation Structures [FoSSaCS 2019] (pp. 62-79). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11425). Springer. https://doi.org/10.1007/978-3-030-17127-8_4

Barlocco, Simone ; Kupke, Clemens ; Rot, Jurriaan. / Coalgebra learning via duality. International Conference on Foundations of Software Science and Computation Structures [FoSSaCS 2019]. editor / Mikołaj Bojańczyk ; Alex Simpson. Cham, Switzerland : Springer, 2019. pp. 62-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0580636ce7244db98274f2caf564bf4a,

title = "Coalgebra learning via duality",

abstract = "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 on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using Hennessy-Milner logic. Our main contribution is an abstract learning algorithm, together with a proof of correctness and termination.",

keywords = "automata learning, coalgebras, Hennessy-Milner logic, abstract learning algorithm",

author = "Simone Barlocco and Clemens Kupke and Jurriaan Rot",

year = "2019",

month = apr,

day = "5",

doi = "10.1007/978-3-030-17127-8_4",

language = "English",

isbn = "9783030171261",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "62--79",

editor = "Miko{\l}aj Boja{\'n}czyk and Alex Simpson",

booktitle = "International Conference on Foundations of Software Science and Computation Structures [FoSSaCS 2019]",

}

Barlocco, S , Kupke, C & Rot, J 2019, Coalgebra learning via duality. in M Bojańczyk & A Simpson (eds), International Conference on Foundations of Software Science and Computation Structures [FoSSaCS 2019]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11425, Springer, Cham, Switzerland, pp. 62-79. https://doi.org/10.1007/978-3-030-17127-8_4

Coalgebra learning via duality. / Barlocco, Simone ; Kupke, Clemens; Rot, Jurriaan.

International Conference on Foundations of Software Science and Computation Structures [FoSSaCS 2019]. ed. / Mikołaj Bojańczyk; Alex Simpson. Cham, Switzerland : Springer, 2019. p. 62-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11425).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution book

TY - GEN

T1 - Coalgebra learning via duality

AU - Barlocco, Simone

AU - Kupke, Clemens

AU - Rot, Jurriaan

PY - 2019/4/5

Y1 - 2019/4/5

N2 - 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 on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using Hennessy-Milner logic. Our main contribution is an abstract learning algorithm, together with a proof of correctness and termination.

AB - 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 on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using Hennessy-Milner logic. Our main contribution is an abstract learning algorithm, together with a proof of correctness and termination.

KW - automata learning

KW - coalgebras

KW - Hennessy-Milner logic

KW - abstract learning algorithm

UR - https://link.springer.com/book/10.1007/978-3-030-17127-8

U2 - 10.1007/978-3-030-17127-8_4

DO - 10.1007/978-3-030-17127-8_4

M3 - Conference contribution book

SN - 9783030171261

SN - 9783030171278

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 62

EP - 79

BT - International Conference on Foundations of Software Science and Computation Structures [FoSSaCS 2019]

A2 - Bojańczyk, Mikołaj

A2 - Simpson, Alex

PB - Springer

CY - Cham, Switzerland

ER -

Barlocco S , Kupke C, Rot J. Coalgebra learning via duality. In Bojańczyk M, Simpson A, editors, International Conference on Foundations of Software Science and Computation Structures [FoSSaCS 2019]. Cham, Switzerland: Springer. 2019. p. 62-79. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-17127-8_4

Coalgebra learning via duality

Abstract

Publication series

Keywords

Access to Document

Clemens Kupke

Coalgebraic Foundations of Semi-Structured Data (EPSRC First Grant)

Cite this