Answer Set Programming for Regular Inference
We propose an approach to non-deterministic finite automaton (NFA) inductive synthesis that is based on answer set programming (ASP) solvers. To that end, we explain how an NFA and its response to input samples can be encoded as rules in a logic program. We then ask an ASP solver to find an answer s...
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI AG
2020-10-01
|
| Serie: | Applied Sciences |
| Soggetti: | |
| Accesso online: | https://www.mdpi.com/2076-3417/10/21/7700 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|