Article
Confluent Rewriting Systems in Non-Monotonic Reasoning
Fecha
1998-12-15Registro en:
Revista Computación y Sistemas; Vol. 2 No. 2 y No. 3
1405-5546
Autor
Arrazola, José
Dix, Jürgen
Osorio, Mauricio
Institución
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.