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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
MDPI AG
2020-10-01
|
| シリーズ: | Applied Sciences |
| 主題: | |
| オンライン･アクセス: | https://www.mdpi.com/2076-3417/10/21/7700 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|