Syntactic transformation rules under P-Stable semantics: theory and implementation
We study the simplification of normal logic programs under the P-Stable semantics, with respect to the notions of equivalence, using many of the transformation rules found in literature in the context of Answer Set Programming (ASP). A schema for the implementation of P-Stable semantics is provided...
Na minha lista:
| Udgivet i: | Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial |
|---|---|
| Principais autores: | , |
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Asociación Española para la Inteligencia Artificial
2009
|
| Fag: | |
| Online adgang: | https://www.redalyc.org/articulo.oa?id=92513168003 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|