Declarative Representation of Revision Strategies

Simple item page
dc.creatorBrewka, Gerhard
dc.date2000-03-08
dc.date.accessioned2026-07-07T03:16:01Z
dc.date.available2026-07-07T03:16:01Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0003035
dc.identifierhttp://arxiv.org/abs/cs/0003035
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30195
dc.subjectArtificial Intelligence
dc.subjectLogic in Computer Science
dc.subjectI.2.3
dc.titleDeclarative Representation of Revision Strategies
dc.typetext

Files

Collections

arXiv