Update sequences based on minimal generalized pstable models

Authors:
Mauricio Osorio;Claudia Zepeda
Affiliations:
Universidad de las Américas, CENTIA, Cholula, Puebla, México;Universidad Politécnica de Puebla, Tercer Carril del Ejido Serrano, Puebla, México
Venue:
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Year:
2007

Citing 6
Cited 1

Logic Programming Updating - A Guided Approach

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
On properties of update sequences based on causal rejection

Theory and Practice of Logic Programming
Ground Nonmonotonic Modal Logic S5: New Results

Journal of Logic and Computation
A semantics for updates consisting of a sequence of programs

CONIELECOMP '07 Proceedings of the 17th International Conference on Electronics, Communications and Computers
Updates in answer set programming: An approach based on basic structural properties

Theory and Practice of Logic Programming
A preference-based framework for updating logic programs

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning

P-stable models of strong kernel programs

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In case intelligent agents get new knowledge and this knowledge must be added or updated to their knowledge base, it is important to avoid inconsistencies. Currently there are several approaches dealing with updates. In this paper, we propose a semantics for update sequences. We start introducing the notion of minimal generalized (MG) pstable models that, as we argue is interesting by itself. Based on MG pstable models we construct our update semantics. In this work, we also use some representative examples to compare our update semantics to other known update semantics and observe some advantages of it.