Maps between Different Kinds of Two-Level Credibility-Limited Revision Operators

Two-level credibility-limited revision is a non-prioritized revision operation. When revising through a two-level credibility-limited revision, two levels of credibility and one level of incredibility are considered. When revising by a sentence at the highest level of credibility, the operator behaves like a standard revision, if the sentence is at the second level of credibility, the revision process results in a standard contraction by the negation of that sentence. If the sentence is not credible, then the original belief set remains unchanged. In this article, we introduce a novel constructive method for two-level credibility-limited revision operators, based on a modified version of entrenchment relations. Additionally, we propose a semantics for this type of operators, based on Grove’s systems of spheres. Furthermore, we present axiomatic characterizations for the newly proposed operators.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Computational Logic
Published
2025-05-05
DOI
https://doi.org/10.1145/3733830
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Maps between Different Kinds of Two-Level Credibility-Limited Revision Operators

Eduardo Fermé, Maurício D. L. Reis, Marco Garapa
ACM Transactions on Computational Logic
Logic, Reasoning, and Knowledge
article

Maps between Different Kinds of Two-Level Credibility-Limited Revision Operators

Eduardo Fermé, Maurício D. L. Reis, Marco Garapa
article en

Abstract

Two-level credibility-limited revision is a non-prioritized revision operation. When revising through a two-level credibility-limited revision, two levels of credibility and one level of incredibility are considered. When revising by a sentence at the highest level of credibility, the operator behaves like a standard revision, if the sentence is at the second level of credibility, the revision process results in a standard contraction by the negation of that sentence. If the sentence is not credible, then the original belief set remains unchanged. In this article, we introduce a novel constructive method for two-level credibility-limited revision operators, based on a modified version of entrenchment relations. Additionally, we propose a semantics for this type of operators, based on Grove’s systems of spheres. Furthermore, we present axiomatic characterizations for the newly proposed operators.

ACM Transactions on Computational LogicVol. 26(3)
University of Évora (PT), Universidade da Madeira (PT), Universidade Nova de Lisboa (PT)
Openalex Percentile: Top 96%
Logic, Reasoning, and Knowledge
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.