Nonmonotonic Theory Revision in Logic Programming

摘要

The authors deal with the problem of revising nonmonotonic theories that areclassically consistent, but do not have an acceptable (nonmonotonic) model. If a nonmonotonic semantics suffers from this lack of consistency preservation, the authors propose to apply theory revision. The authors present some postulates for such nonmonotonic theory revision and they will show that, unlike in classical theory revision, in nonmonotonic theory revision a theory has to be expanded instead of contracted in order to give it a satisfactory meaning. The authors apply the framework to the semantics of logic programming and they present some extensions of the stable, supported and positivistic semantics that satisfy both supraclassicality and consistency preservation. (Copyright (c) 1995 by Faculty of Technical Mathematics and Informatics, Delft, The Netherlands.)