|
Learning Linear Temporal Logic| title | Learning Linear Temporal Logic |
|---|
| start_date | 2024/01/16 |
|---|
| schedule | 11h-12h |
|---|
| online | no |
|---|
| location_info | Sciences 3- S3 351 |
|---|
| summary | We consider the problem of learning a logical formula from a set of positive and negative examples. The logic we target is Linear Temporal Logic (LTL), a prominent formalism in program verification and analysis, software engineering, and robot motion planning.
We’ll discuss on the one hand theoretical results, in particular NP-completeness, and on the other hand a practical approach, arguing that the problem is a perfect match for GPUs (Graphical Processing Units). No knowledge of LTL or GPU will be required to follow the talk. |
|---|
| responsibles | Grandjean |
|---|
Workflow history| from state (1) | to state | comment | date |
|---|
| submitted | published | | 2024/01/10 14:37 UTC |
| |
|