Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artículo científico |
| Langue: | en |
| Publié: |
Asociación Española para la Inteligencia Artificial
2009
|
| Sujets: | |
| Accès en ligne: | https://www.redalyc.org/articulo.oa?id=92513168003 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Table des matières:
- Syntactic transformation rules under P-Stable semantics: theory and implementation Simone Pascucci Alejandra López Fernández Ingeniería Stable Semantics Logical Programming Non Monotonic Reasoning Syntactic Trasformation 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 using two well known open source tools: Lparse and Minisat. Also, a prototype written in Java of a tool based on this schema is presented. We extend the work of Fernández [4] including a simplification routine in the post-parsing phase. 2009 artículo científico 1137-3601 https://www.redalyc.org/articulo.oa?id=92513168003 en http://www.redalyc.org/revista.oa?id=925 Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial application/pdf Asociación Española para la Inteligencia Artificial Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial (España) Num.41 Vol.13