Skip to main content

Implementing a Reasoner for the Transformation Logics

Supervisors

Suitable for

Computer Science, Part B

Abstract

The Transformation Logics (TLs) are a recently-proposed family of logics for capturing patterns over sequences [1]. The logics are expected to have a broad range of applications, but there is no implementation so far. The goal of the project is to implement the first reasoner for the Transformation Logics, and design an experimental evaluation. 

Relevant paper: [1] The Transformation Logics, Alessandro Ronca, IJCAI 2024

Pre-requisites: Some familiarity with Propositional Logic, Temporal Logic, Automata. Some familiarity with Semigroups and Groups would be helpful.