# Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change (Extended Version)

arXiv: https://arxiv.org/abs/2507.06798 · HTML: https://mlsanity.com/paper/2507.06798/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 22 references that are in the map.
- First posted on arXiv 9 Jul 2025.

## Abstract (arXiv)

Dialectical systems are a mathematical formalism for modeling an agent updating a knowledge base seeking consistency. Introduced in the 1970s by Roberto Magari, they were originally conceived to capture how a working mathematician or a research community refines beliefs in the pursuit of truth. Dialectical systems also serve as natural models for the belief change of an automated agent, offering a unifying, computable framework for dynamic belief management. The literature distinguishes three main models of dialectical systems: (d-)dialectical systems based on revising beliefs when they are seen to be inconsistent, p-dialectical systems based on revising beliefs based on finding a counterexample, and q-dialectical systems which can do both. We answer an open problem in the literature by proving that q-dialectical systems are strictly more powerful than p-dialectical systems, which are themselves known to be strictly stronger than (d-)dialectical systems. This result highlights the complementary roles of counterexample and contradiction in automated belief revision, and thus also in the reasoning processes of mathematicians and research communities.