A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: I. STRONG PROPERTIES

1 January 1995

journal article
Published by SAGE Publications in Fundamenta Informaticae

Vol. 22 (3) , 227-255
https://doi.org/10.3233/fi-1995-2233

Abstract

Our aim in this article is to present a method for classifying and characterizing the various different semantics of logic programs with negation that have been considered in the last years. Instead of appealing to more or less questionable intuition

Keywords

CLASSIFICATION THEORY
SEMANTICS
INTUITION
APPEALING
NEGATION
NORMAL LOGIC PROGRAMS

This publication has 0 references indexed in Scilit: