Declarative Representation of Revision Strategies
Artificial Intelligence
2007-05-23 v1 Logic in Computer Science
Abstract
In this paper we introduce a nonmonotonic framework for belief revision in which reasoning about the reliability of different pieces of information based on meta-knowledge about the information is possible, and where revision strategies can be described declaratively. The approach is based on a Poole-style system for default reasoning in which entrenchment information is represented in the logical language. A notion of inference based on the least fixed point of a monotone operator is used to make sure that all theories possess a consistent set of conclusions.
Cite
@article{arxiv.cs/0003035,
title = {Declarative Representation of Revision Strategies},
author = {Gerhard Brewka},
journal= {arXiv preprint arXiv:cs/0003035},
year = {2007}
}