arXiv subjects

Jandson S. Ribeiro

Publications and source records attributed to Jandson S. Ribeiro.

5 recordsLinked to original sources

arXiv2026

Constructive Preference Relations: Navigating Undecidability in Rational LTL Contraction

We study the computational aspects of epistemic preference relations in non-classical logics, particularly linear temporal logic (LTL). Epistemic preferences form the backbone of belief contraction operators, which describe how to rationally relinquish obsolete beliefs. These preference relations have to satisfy certain innocuous conditions; and constructing such relations is usually assumed to be a trivial process. However, in the case of LTL, where relations are represented with Büchi automata, we show that this is a challenging task: the core condition, which guarantees the success of contraction, is in fact undecidable. Towards achieving effective LTL belief contraction, we then propose several concrete constructions of novel preference relations that satisfy the required conditions by design. These constructions include, among others, (1) generalisations of distance measures (e.g. Dalal) beyond the classical setting, as well as (2) the ability to hierarchically compose different preference relations. Our results not only provide rich families of preference relations for LTL, but also generalise the limited pool of concrete preference relations for the classical cases, allowing us to go beyond Dalal to achieve full rationality.

cs.LO↗

arXiv2026

Model Change for Description Logic Concepts

We consider the problem of modifying a description logic concept in light of models represented as pointed interpretations. We call this setting model change, and distinguish three main kinds of changes: eviction, which consists of only removing models; reception, which incorporates models; and revision, which combines removal with incorporation of models in a single operation. We introduce a formal notion of revision and argue that it does not reduce to a simple combination of eviction and reception, contrary to intuition. We provide positive and negative results on the compatibility of eviction and reception for EL and ALC description logic concepts and on the compatibility of revision for ALC concepts.

cs.LO↗

arXiv2025

Effective AGM Belief Contraction: A Journey beyond the Finitary Realm (Technical Report)

Despite significant efforts towards extending the AGM paradigm of belief change beyond finitary logics, the computational aspects of AGM have remained almost untouched. We investigate the computability of AGM contraction on non-finitary logics, and show an intriguing negative result: there are infinitely many uncomputable AGM contraction functions in such logics. Drastically, we also show that the current de facto standard strategies to control computability, which rely on restricting the space of epistemic states, fail: uncomputability remains in all non-finitary cases. Motivated by this disruptive result, we propose new approaches to controlling computability beyond the finitary realm. Using Linear Temporal Logic (LTL) as a case study, we identify an infinite class of fully-rational AGM contraction functions that are computable by design. We use Büchi automata to construct such functions, and to represent and reason about LTL beliefs.

cs.LO↗

arXiv2023

Finite Based Contraction and Expansion via Models

We propose a new paradigm for Belief Change in which the new information is represented as sets of models, while the agent's body of knowledge is represented as a finite set of formulae, that is, a finite base. The focus on finiteness is crucial when we consider limited agents and reasoning algorithms. Moreover, having the input as arbitrary set of models is more general than the usual treatment of formulae as input. In this setting, we define new Belief Change operations akin to traditional expansion and contraction, and we identify the rationality postulates that emerge due to the finite representability requirement. We also analyse different logics concerning compatibility with our framework.

cs.LO↗

arXiv2022

Revising Ontologies via Models: The ALC-formula Case

Most approaches for repairing description logic (DL) ontologies aim at changing the axioms as little as possible while solving inconsistencies, incoherences and other types of undesired behaviours. As in Belief Change, these issues are often specified using logical formulae. Instead, in the new setting for updating DL ontologies that we propose here, the input for the change is given by a model which we want to add or remove. The main goal is to minimise the loss of information, without concerning with the syntactic structure. This new setting is motivated by scenarios where an ontology is built automatically and needs to be refined or updated. In such situations, the syntactical form is often irrelevant and the incoming information is not necessarily given as a formula. We define general operations and conditions on which they are applicable, and instantiate our approach to the case of ALC-formulae.

cs.LO↗