Full Meet Revision on Stratified Bases
Dados Bibliográficos
| ID | 20143549 |
|---|---|
| Autores | Michael Freund (0000-0003-1701-0988, Université d'Orléans, autor correspondente) |
| Ano | 2001 |
| Volume | 67 |
| Fascículo | 3 |
| Páginas | 189-213 |
| Data de publicação | 2001-12-01 |
| Peer Reviewed | Sim |
| Open Access | Sim |
| Tipo | ARTICLE |
| Periódico | Theoria (JOURNAL) |
| Identificadores do periódico | ISSN: 0040-5825 • E-ISSN: 1755-2567 |
| Editora | Wiley (PUBLISHER • GB) |
| DOI | 10.1111/j.1755-2567.2001.tb00203.x |
| OpenAlex | W1970760351 |
| Idioma | EN |
| Referências citadas | 11 |
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
Algebra over a field · Base (topology) · Construct (python library) · Epistemology · Iterated function · Mathematical analysis · Mathematical economics · Operator (biology) · Process (computing) · Programming language · Pure mathematics · Rationality · Advanced Algebra and Logic · Computer Science · Logic, Reasoning, and Knowledge · Mathematics · Philosophy · Semantic Web and Ontologies
| Velocidade de citação | historical |
|---|---|
| Altamente citado | Não |