Por favor, use este identificador para citar o enlazar este ítem:
http://repositoriodigital.ipn.mx/handle/123456789/15108
Título : | Confluent Rewriting Systems in Non-Monotonic Reasoning |
Autor : | Arrazola, José Dix, Jürgen Osorio, Mauricio |
Palabras clave : | Keywords. Well-founded semantics, stable semantics, logic programming, non-monotonic reasoning, rewriting systems, negation as failure. |
Fecha de publicación : | 15-dic-1998 |
Editorial : | Revista Computación y Sistemas; Vol. 2 No. 2 y No. 3 |
Citación : | Revista Computación y Sistemas; Vol. 2 No. 2 y No. 3 |
Citación : | Revista Computación y Sistemas;Vol. 2 No. 2 y No. 3 |
Resumen : | Abstract. We introduce the general notion 01 a Confluent LPSystem, which is a rewriting system on the set 01 all logic pmgrams over a signature L. Such a system is based on certain translormation rules and induces a semantics SEM in a natural way. We show that most 01 the well-known semantics for normal logic programs are induced by confiuent LP-systems. Moreover, we show by intmducing several new translormation rules that the corresponding LP-systems induce interesting semantics which are polynomial time computable and extend WFS. Moreover we use our appmach to define new semantics for disjunctive pmgrams. |
URI : | http://www.repositoriodigital.ipn.mx/handle/123456789/15108 |
ISSN : | 1405-5546 |
Aparece en las colecciones: | Revistas |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
ART 5.pdf | 11.77 MB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.