A Computationally Grounded Framework for Cognitive Attitudes

Tiago de Lima, Emiliano Lorini, Elise Perrotin, François SchwarzentruberAAAI 2025 · DOI

Introduction

Presented at AAAI-25, this research introduces a novel formal logic designed for reasoning about the internal states—beliefs, feelings, and actions—of artificial agents. By transitioning from traditional, computationally heavy mathematical models to a "belief base" approach, the authors establish a framework that is both philosophically robust and computationally efficient.

Addressing the State Explosion Problem

In Artificial Intelligence, Epistemic Logic and BDI (Belief, Desire, Intention) models are standard for reasoning about an agent's internal state. These typically rely on Kripke semantics, representing knowledge through sets of "possible worlds." However, this approach suffers from a lack of succinctness. For instance, a game like Hanabi requires approximately $10^{23}$ states, making explicit model checking impossible. Furthermore, many existing logics fail to integrate "bipolar" motivational attitudes—the concept that agents are simultaneously attracted to "good" outcomes and repelled by "bad" ones.

Methodology: From Possible Worlds to Belief Bases

The researchers depart from the "possible worlds" paradigm in favor of Belief Bases.

  1. Belief Bases: An agent’s state is defined by a finite set of formulas they explicitly believe, from which epistemic possibilities are derived.
  2. Bipolar Desires: "Appetitive" (attraction) and "aversive" (repulsion) desires are defined based on whether a fact entails a "reward" ($good_i$) or a "punishment" ($bad_i$).
  3. Modal Language (LCA): The logic introduces operators for implicit belief, complete attraction/repulsion, and realistic attraction/repulsion.
  4. Dynamic Extension: The framework supports private belief expansion and forgetting.
  5. TQBF Reduction: Model checking is reduced to True Quantified Boolean Formulas (TQBF), enabling the use of efficient solvers.

Key Insights: Defining Cognitive Positions

A significant contribution of this framework is the formal definition of complex psychological states, or "cognitive positions," by combining primitive operators.

Definitions of cognitive positions based on attraction and repulsion.

As shown in the table above, the logic can formally represent states such as:

  • Ambivalence ($A_i \varphi$): Being both attracted to and repelled by a state.
  • Indifference ($I_i \varphi$): Having neither attraction nor repulsion.
  • Motivation ($M_i \varphi$): A directed desire toward or away from a state.

This "desire-as-belief" approach simplifies the logic while maintaining high expressive power, bridging the gap between abstract philosophy and practical software engineering.

Key Results and Performance

The authors proved that the model checking problem for their dynamic language is PSPACE-complete. They implemented a symbolic model checker in Haskell using Binary Decision Diagrams (BDDs) to evaluate scalability.

Performance metrics for the symbolic model checker across varying agent counts.

The results demonstrate remarkable efficiency. In synthetic benchmarks scaling from 1 to 60 agents, the system handled a state space of $2^{1080}$ in just 5.67 seconds. Traditional Kripke-based model checkers would be unable to initialize a model of this magnitude, proving the practical utility of the belief base approach.

Limitations and Future Directions

While powerful, the framework currently allows for belief expansions that could lead to global inconsistency. Future work will explore belief revision to handle contradictions, though this increases complexity. Additionally, the authors plan to transition from a purely qualitative model to one including graded desires to represent motivational strength.

Summary updated

BibTeX
@inproceedings{lima2025computationally,
  author = {Tiago de Lima and Emiliano Lorini and Elise Perrotin and François Schwarzentruber},
  title = {{A Computationally Grounded Framework for Cognitive Attitudes}},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year = {2025},
  doi = {10.1609/aaai.v39i14.33629},
}

Loading related content...

Figure