Premium
Full Meet Revision on Stratified Bases
Author(s) -
FREUND MICHAEL
Publication year - 2001
Publication title -
theoria
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.34
H-Index - 16
eISSN - 1755-2567
pISSN - 0040-5825
DOI - 10.1111/j.1755-2567.2001.tb00203.x
Subject(s) - iterated function , base (topology) , construct (python library) , mathematics , operator (biology) , rationality , process (computing) , computer science , mathematical economics , algebra over a field , pure mathematics , epistemology , programming language , philosophy , mathematical analysis , biochemistry , chemistry , repressor , transcription factor , gene
We show how to construct partial nontrivial base revision operators that satisfy the analogues of the AGM postulates and depends on no extra‐logical consideration. These operators, closely related to the full meet revision process, are defined on stratified bases, in which the information can be ranked in logical sequences. Stratified bases, which can be viewed as sets of graded sheaves, are exactly the knowledge bases for which the full meet revision operator satisfies the rationality postulate K*8. As the revision of a stratified base is again a stratified base, it is possible to perform iterated revisions, and the resulting output is particularly easy to determine.