Revision programs with explicit negation

Authors:
Yisong Wang;Mingyi Zhang
Affiliations:
Department of Computer Science, Guizhou University, Guiyang, Guizhou, P. R. China;Guizhou Academy of Sciences, Guiyang, Guizhou, P. R. China
Venue:
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Year:
2004

Citing 9
Cited 0

Well founded semantics for logic programs with explicit negation

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A new research into default logic

Information and Computation
Revision programming

Theoretical Computer Science - Special issue: database theory
Iterated logic program updates

JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Annotated revision programs

Artificial Intelligence
Nested expressions in logic programs

Annals of Mathematics and Artificial Intelligence
Generalizing Updates: From Models to Programs

LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Revision programming: a knowledge representation formalism

Revision programming: a knowledge representation formalism
A framework for declarative update specifications in logic programs

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Revision program [9], which describes the transformation from an initial database to a revised database, is a formalism for specifying revisions on database. In order to deal with the incompleteness of knowledge, the paper provides an extension for both database and revision program by introducing explicit negation. Motivated by “ ~l ←¬l” [2], we propose an extended P-justified revision semantics for the extension, which is more general than P-justified revision semantics, where we argue that the latest knowledge is preferred to the old one when it conflicts with the old. This extension is not trivial by simply regarding negative literals as positive in annotated revision programs [10]. In the end, we establish the one-to-one correspondence between the extended P-justified revisions of extended revision programs and answer sets of the corresponding extended logic programs.